IJSTR

International Journal of Scientific & Technology Research

Home About Us Scope Editorial Board Blog/Latest News Contact Us
0.2
2019CiteScore
 
10th percentile
Powered by  Scopus
Scopus coverage:
Nov 2018 to May 2020

CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT

IJSTR >> Volume 8 - Issue 11, November 2019 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



Functional Analysis of Keyless Digest Functions: A Security Perspective

[Full Text]

 

AUTHOR(S)

P.KARTHIK, Dr. P.SHANTHI BALA

 

KEYWORDS

Keyless Digest Functions, Functional Analysis of Standard keyless-digest functions, Cryptographic digest functions, Construction principles of modern digest functions, Security vulnerabilities of modern digests, Security analysis of digest functions, Keyless digests, Security metrics of MDC for integrity verification.

 

ABSTRACT

The term data security revolves around two radical things namely data protection and data integrity. The advent of cloud solutions has completely transformed the data storage and access mechanisms. Today, technology permits the user to store and access data through the internet without much access restriction. Therefore, conserving the integrity of data becomes the most grueling task than it was thought formerly. The digest functions come in aid to provide a comprehensive solution for the integrity violations of remote data. But, the cryptographic attacks on the digest functions like MD4, MD5, RIPEMD, and SHA-160 algorithms made the research community to reconsider the design principles of the digest functions for the cryptographic use. This work attempts to perform a functional analysis of the standard keyless-digest functions like MD-5, SHA-160, SHA-2 Family, and SHA-3 family in the perspective of security. The term data security revolves around two radical things namely data protection and data integrity. The advent of cloud solutions has completely transformed the data storage and access mechanisms. Today, technology permits the user to store and access data through the internet without much access restriction. Therefore, conserving the integrity of data becomes the most grueling task than it was thought formerly. The digest functions come in aid to provide a comprehensive solution for the integrity violations of remote data. But, the cryptographic attacks on the digest functions like MD4, MD5, RIPEMD, and SHA-160 algorithms made the research community to reconsider the design principles of the digest functions for the cryptographic use. This work attempts to perform a functional analysis of the standard keyless-digest functions like MD-5, SHA-160, SHA-2 Family, and SHA-3 family in the perspective of security.

 

REFERENCES

[1] Bartkewitz, Timo. "Building hash functions from block ciphers, their security and implementation properties." Ruhr-University Bochum (2009).
[2] Preneel, Bart, René Govaerts, and Joos Vandewalle. "Hash functions based on block ciphers: A synthetic approach." Annual International Cryptology Conference. Springer, Berlin, Heidelberg, 1993.
[3] Al-Kuwari, Saif, James H. Davenport, and Russell J. Bradford. "Cryptographic hash functions: recent design trends and security notions." (2010): 133-150.
[4] Menezes, Alfred J. "van Oorschot, Paul C. Vanstone, Scott A." Handbook of applied cryptography (1996).
[5] Webster, A. F., and Stafford E. Tavares. "On the design of S-boxes." Conference on the theory and application of cryptographic techniques. Springer, Berlin, Heidelberg, 1985.
[6] Kam, John B., and George I. Davida. "Structured design of substitution-permutation encryption networks." IEEE Transactions on Computers 10 (1979): 747-753.
[7] Matsui, Mitsuru. "Linear cryptanalysis method for DES cipher." Workshop on the Theory and Application of Cryptographic Techniques. Springer, Berlin, Heidelberg, 1993.
[8] FIPS, NIST. "198: The keyed-hash message authentication code (HMAC)." National Institute of Standards and Technology, Federal Information Processing Standards(2002): 29.
[9] Damgård, Ivan Bjerre. "Collision free hash functions and public key signature schemes." Workshop on the Theory and Application of of Cryptographic Techniques. Springer, Berlin, Heidelberg, 1987.
[10] Dewangan, Chandra Prakash, et al. "Study of avalanche effect in AES using binary codes." IEEE Conference on Advanced Communication Control and Computing Technologies (ICACCCT). 2012.
[11] Bellare, Mihir, and Phillip Rogaway. "The exact security of digital signatures-How to sign with RSA and Rabin." International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg, 1996.
[12] Bellare, Mihir, and Phillip Rogaway. "Random oracles are practical: A paradigm for designing efficient protocols." Proceedings of the 1st ACM conference on Computer and communications security. ACM, 1993.
[13] Bellare, Mihir, and Phillip Rogaway. "Optimal asymmetric encryption." Workshop on the Theory and Application of of Cryptographic Techniques. Springer, Berlin, Heidelberg, 1994.
[14] Canetti, Ran, Oded Goldreich, and Shai Halevi. "On the random-oracle methodology as applied to length-restricted signature schemes." Theory of Cryptography Conference. Springer, Berlin, Heidelberg, 2004.
[15] Cannetti, R., O. Goldreich, and Shai Halevi. "The random oracle methodology, revisited (preliminary version)." Proc. 30th Annual ACM Symp. On Theory of Computing, Perugia, Italy, ACM Press. 1998.
[16] Coron, Jean-Sébastien, et al. "Merkle-Damgård revisited: How to construct a hash function." Annual International Cryptology Conference. Springer, Berlin, Heidelberg, 2005.
[17] Preneel, Bart. Analysis and design of cryptographic hash functions. Diss. Katholieke Universiteit te Leuven, 1993.
[18] Preneel, Bart. "The state of cryptographic hash functions." School organized by the European Educational Forum. Springer, Berlin, Heidelberg, 1998.
[19] Goldwasser, Shafi, Silvio Micali, and Ronald L. Rivest. "A digital signature scheme secure against adaptive chosen-message attacks." SIAM Journal on Computing 17.2 (1988): 281-308.
[20] Yuval, Gideon. "How to swindle Rabin." Cryptologia 3.3 (1979): 187-191.
[21] Bellare, Mihir, and Tadayoshi Kohno. "Hash function balance and its impact on birthday attacks." International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg, 2004.
[22] Damgård, Ivan bjerre. "a design principle for hash functions." conference on the theory and application of cryptology. Springer, new york, ny, 1989.
[23] Merkle, Ralph c. "one way hash functions and des." conference on the theory and application of cryptology. Springer, new york, ny, 1989.
[24] Lai, Xucjia, and James L. Massey. "hash functions based on block ciphers." workshop on the theory and application of of cryptographic techniques. Springer, berlin, heidelberg, 1992.
[25] Rivest, ronald. The md5 message-digest algorithm. No. Rfc 1321. 1992.
[26] Eastlake 3rd, d., and Paul jones. Us secure hash algorithm 1 (sha1). No. Rfc 3174. 2001.
[27] Bertoni, Guido, et al. "Keccak sponge function family main document." Submission to NIST (Round 2) 3.30 (2009).
[28] Bertoni, Guido, et al. "Keccak." Annual international conference on the theory and applications of cryptographic techniques. Springer, Berlin, Heidelberg, 2013.
[29] NIST, Third-round report of the SHA-3 cryptographic hash algorithm competition (November 2012), http://dx.doi.org/10.6028/NIST.IR.7896
[30] Bertoni, Guido, et al. "Duplexing the sponge: single-pass authenticated encryption and other applications." International Workshop on Selected Areas in Cryptography. Springer, Berlin, Heidelberg, 2011.
[31] Wang, Xiaoyun, et al. "Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD." IACR Cryptology ePrint Archive 2004 (2004): 199.
[32] Klima, Vlastimil. "Tunnels in Hash Functions: MD5 Collisions Within a Minute." IACR Cryptology ePrint Archive 2006 (2006): 105
[33] Xie, Tao, and Dengguo Feng. "Construct MD5 Collisions Using Just A Single Block Of Message." IACR Cryptology ePrint Archive 2010 (2010): 643.
[34] Wang, Xiaoyun, Yiqun Lisa Yin, and Hongbo Yu. "Collision search attacks on SHA1." (2005).
[35] Wang, Xiaoyun, Yiqun Lisa Yin, and Hongbo Yu. "Finding collisions in the full SHA-1." Annual international cryptology conference. Springer, Berlin, Heidelberg, 2005.
[36] Khovratovich, Dmitry, Christian Rechberger, and Alexandra Savelieva. "Bicliques for preimages: attacks on Skein-512 and the SHA-2 family." Fast Software Encryption. Springer, Berlin, Heidelberg, 2012.
[37] https://es.cs.uni-kl.de/research/applications/sha2/
[38] Chang, Shu-jen, et al. "Third-round report of the SHA-3 cryptographic hash algorithm competition." NIST Interagency Report 7896 (2012): 121.