A Method of Buiding Unkeyed Hash Function on Even Polynomial Ring
Main Article Content
Abstract
Cryptographic hash functions are used in many applications of modern cryptography, such as authentication, integrity checking of data messages, digital signatures... This paper proposes a symmetry-key block crypto system 256 bits input/output. The encryption scheme is unbalanced four branches Feistel network; the encryption function and subkeys for the encryption loops are based on cyclic geometric progressions over even polynomial ring $\mathbb{Z}_{2}[x]/x^{\prime\prime}+1$ with $n=2^{k}$ In the next part of the paper, the article recommended applies this crypto system to a hash function with 512 bits output length. Finally, some diffusion calculations of the proposed crypto system and hash function are also presented.
Keywords
Polynomial ring, Cyclic geometric progressionc, Block symmetry crypto system, Feistel network, hash function
Article Details
References
[1] Nguyen Binh, "Cyclic and Local Cyclic Codes over Polynomial Ring", Journal of Science and Technology, Vietnam, Vol. 50 (2012), pp. 735-749, ISSN 0866 708X.
[2] Nguyen Binh, Le Dinh Thich The oders of polynomials and algorithms for defining order of polynomial over polynomial ring, VICA-5, Hanoi. Vietnam, 2002.
[3] Ho Quang Buu, Ngo Duc Thien, Tran Duc Su, "Constructing a Crypto system based on Cyclic Geometric Progressions in Polynomial Rings", Jounal of Science and Technology, Vietnam Academy of Science and Technology, Vol. 50-2A, (2012) pp. 109-119, ISSN 0866 708X.
[4] Ngo Duc Thien, Dang Hoai Bac, "A method of building a crypto system based on unbalanced Feistel network and its application in hash functions", Tạp chí Nghiên cứu khoa học và công nghệ quân sự, ISSN 1859-1043, số 34, 2014, pp.41-48.
[5] Pascal JUNOD, "Statistical Cryptanalysis of Block Ciphers", Thèse $N^{0}$ 3179, Insitute de systèmes de communication, Ecole Polytechnique Fédérale de Lausanne, 2005.
[6] Jean-Yves Chouinard ELG 5373, "Secure Communications and Data Encryption, School of Information Technology and Engineering", University of Ottawa, April 2002.
[7] A. Menezes, P. van Oorschot, and S. Vanstone. "Handbook of Applied Cryptography", CRC Press, 1996.
[2] Nguyen Binh, Le Dinh Thich The oders of polynomials and algorithms for defining order of polynomial over polynomial ring, VICA-5, Hanoi. Vietnam, 2002.
[3] Ho Quang Buu, Ngo Duc Thien, Tran Duc Su, "Constructing a Crypto system based on Cyclic Geometric Progressions in Polynomial Rings", Jounal of Science and Technology, Vietnam Academy of Science and Technology, Vol. 50-2A, (2012) pp. 109-119, ISSN 0866 708X.
[4] Ngo Duc Thien, Dang Hoai Bac, "A method of building a crypto system based on unbalanced Feistel network and its application in hash functions", Tạp chí Nghiên cứu khoa học và công nghệ quân sự, ISSN 1859-1043, số 34, 2014, pp.41-48.
[5] Pascal JUNOD, "Statistical Cryptanalysis of Block Ciphers", Thèse $N^{0}$ 3179, Insitute de systèmes de communication, Ecole Polytechnique Fédérale de Lausanne, 2005.
[6] Jean-Yves Chouinard ELG 5373, "Secure Communications and Data Encryption, School of Information Technology and Engineering", University of Ottawa, April 2002.
[7] A. Menezes, P. van Oorschot, and S. Vanstone. "Handbook of Applied Cryptography", CRC Press, 1996.