Journal of Information Processing Systems

  • 제8권1호
  • /
  • Pages.119-132
  • /
  • 2012
  • /
  • 1976-913X(pISSN)
  • /
  • 2092-805X(eISSN)
한국정보처리학회 (Korea Information Processing Society)
권호 표지
DOI QR코드

DOI QR Code

An Improved Fast and Secure Hash Algorithm

  • Agarwal, Siddharth (Department of Computer Science and Engineering National Institute of Technology) ;
  • Rungta, Abhinav (Department of Computer Science and Engineering National Institute of Technology) ;
  • Padmavathy, R. (Department of Computer Science and Engineering National Institute of Technology) ;
  • Shankar, Mayank (Department of Computer Science and Engineering National Institute of Technology) ;
  • Rajan, Nipun (Department of Computer Science and Engineering National Institute of Technology)
  • 투고 : 2011.06.30
  • 심사 : 2011.08.29
  • 발행 : 2012.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Recently, a fast and secure hash function SFHA - 256 has been proposed and claimed as more secure and as having a better performance than the SHA - 256. In this paper an improved version of SFHA - 256 is proposed and analyzed using two parameters, namely the avalanche effect and uniform deviation. The experimental results and further analysis ensures the performance of the newly proposed and improved SFHA-256. From the analysis it can be concluded that the newly proposed algorithm is more secure, efficient, and practical.

키워드

참고문헌

  1. D. Davies and W. L. Price, The application of digital signatures based on public key cryptosystems, NPL Report DNACS 39/80, 1980.
  2. I.B. Damgard, "Collision free hash functions and public key signature schemes," Advances in Cryptology, Proc. Eurocrypt'87, LNCS 304, D. Chaum and W.L. Price, Eds., Springer-Verlag, 1988, pp.203-216.
  3. C. Mitchell, D. Rush, and M. Walker, "A remark on hash functions for message authentication," Computers & Security, vol8, 1989, pp.517-524. https://doi.org/10.1016/0167-4048(89)90081-3
  4. M. Naor and M. Yung, "Universal one-way hash functions and their cryptographic applications," Proc. 21st ACM Symposium on the Theory of Computing, 1990, pp.387-394.
  5. http://www.schneier.com/blog/archives/2005/02/cryptanalysis_o.html
  6. T. ElGamal , "A public key cryptosystem and a signature scheme based on discrete logarithms". IEEE Transaction of Information Theory, vol.31 (4), 1985, pp.469-472. https://doi.org/10.1109/TIT.1985.1057074
  7. Accredited Standards Committee X9, American National Standard X9.62-2005, Public Key Cryptography for the Financial Services Industry, The Elliptic Curve Digital Signature Algorithm (ECDSA), 2005.
  8. Certicom Research, Standards for efficient cryptography, SEC 1: Elliptic Curve Cryptography, Version 2.0, 2009.
  9. Hassan. M. Elkamchouchi, Mohamed E. Nasr, Roayat Ismail Abdelfatah, "A New Secure and Fast Hashing Algorithm (SFHA-256)", 25th National Radio Science Conference, 2008.
  10. Dan Boneh, Matthew Franklin, "Identity-Based Encryption from the Weil Pairing", SIAM Journal of Computing, vol32(3), 2001, pp.586-615. https://doi.org/10.1137/S0097539701398521

피인용 문헌

  1. Enhanced chained and Cuckoo hashing methods for multi-core CPUs vol.17, pp.3, 2014, https://doi.org/10.1007/s10586-013-0343-y
  2. Distributed Risk Aversion Parameter Estimation for First-Price Auction in Sensor Networks vol.9, pp.12, 2013, https://doi.org/10.1155/2013/795630
  3. Server-based code obfuscation scheme for APK tamper detection vol.9, pp.6, 2016, https://doi.org/10.1002/sec.936
  4. Three-Factor Anonymous Authentication and Key Agreement Scheme for Telecare Medicine Information Systems vol.38, pp.12, 2014, https://doi.org/10.1007/s10916-014-0136-8
  5. Button-based method for the prevention of near field communication relay attacks vol.28, pp.10, 2015, https://doi.org/10.1002/dac.2751