Βιβλιογραϕία
140
[33]
Christof Paar and Jan Pelzl.
Understanding cryptography: a textbook for students
and practitioners. Springer Science & Business Media, 2009.
[34]
Itai Dinur, Orr Dunkelman, and Adi Shamir.
Improved practical attacks on
round-reduced Keccak.
Journal of cryptology, 27:183–209, 2014.
[35]
Sandip Ghoshal, Pradosh Bandyopadhyay, Surojit Roy, and Monalisa Baneree.
A journey from md5 to sha-3. In
Trends in Communication, Cloud, and Big Data:
Proceedings of 3rd National Conference on CCB, 2018, pages 107–112. Springer,
2020.
[36]
Chin-Chen Chang and Ya-Fen Chang.
Signing a digital signature without
using
one-way
hash
functions
and
message
redundancy
schemes.
IEEE
Communications Letters, 8(8):485–487, 2004.
[37]
Shai
Halevi
and
Hugo
Krawczyk.
Strengthening
digital
signatures
via
randomized hashing.
In
Annual International Cryptology Conference, pages
41–59. Springer, 2006.
[38]
Moni
Naor
and
Moti
Yung.
Universal
one-way
hash
functions
and
their
cryptographic
applications.
In
Proceedings of the twenty-first annual ACM
symposium on Theory of computing, pages 33–43, 1989.
[39]
Kannan Balasubramanian. Hash functions and their applications. In
Algorithmic
Strategies for Solving Complex Problems in Cryptography, pages 66–77. IGI
Global, 2018.
[40]
Dexi Wang,
Yu Jiang,
Houbing Song,
Fei He,
Ming Gu,
and Jiaguang Sun.
Verification of implementations of cryptographic hash functions.
IEEE Access,
5:7816–7825, 2017.
[41]
Jonathan Katz and Andrew Y Lindell. Aggregate message authentication codes.
In
Cryptographers’ Track at the RSA Conference, pages 155–169. Springer, 2008.
[42]
Bart Preneel and Paul C Van Oorschot.
On the security of iterated message
authentication codes.
IEEE Transactions on Information theory, 45(1):188–199,
1999.
[43]
P Karthik,
P Shanthibala,
Akashdeep Bhardwaj,
Salil Bharany,
Heejung Yu,
and Yousaf Bin Zikria.
A novel subset-based polynomial design for enhancing
the
security
of
short
message-digest
with
inflated
avalanche
and
random