Đề xuất S-hộp có tính chất mật mã tốt cho hoán vị của hàm băm Keccak
DOI:
https://doi.org/10.54654/isj.v1i11.93Keywords:
Keccak, S-box, algebraic degree, SHA3, distinguishing attackTóm tắt
Tóm tắt—Keccak là hàm băm giành được chiến thắng trong cuộc thi SHA-3 của Viện Tiêu chuẩn và Công nghệ Mỹ (NIST) tổ chức. Có nhiều tấn công thám mã khai thác bậc đại số thấp trong hoán vị của hàm băm này. Chính những kết quả này mà nhóm tác giả thiết kế Keccak đã tăng số vòng từ 18 lên 24 trong hoán vị của nó. Trên cơ sở đó, bài báo tập trung phân tích tính chất đại số của hoán vị Keccak-f trong hàm băm này, sau đó đề xuất một thành phần S-hộp mới có tính chất mật mã tốt để sử dụng trong hoán vị của hàm băm Keccak.
Abstract—Keccak is the winner of the SHA-3 competition of National Institute of Standards and Technology (NIST). There are many cryptographic attacks that exploit the low algebraic degree in permutation of this hash function. Due to these results, the Keccak design team increased the number of rounds from 18 to 24 in its permutation. On that basis, the paper focuses on analyzing the algebraic properties of the Keccak-f permutation in this hash function, then proposes a new S-box with good cryptographic properties used in Keccak’s permutation.
Downloads
References
[1] NIST, SHA-3 Stadard: Permutation-Based Hash And Extendable Output Functions. 8/2015.
[2] Boura, C. and A. Canteaut. Zero-sum distinguishers for iterated permutations and application to Keccak-f and Hamsi-256. in International Workshop on Selected Areas in Cryptography. 2010. Springer.
[3] Boura, C. and A. Canteaut. A zero-sum property for the Keccak-f permutation with 18 rounds. in 2010 IEEE International Symposium on Information Theory. 2010. IEEE.
[4] Boura, C., A. Canteaut, and C. De Canniere. Higher-order differential properties of Keccak and Luffa. in International Workshop on Fast Software Encryption. 2011. Springer.
[5] Boura, C. and A. Canteaut. On the algebraic degree of some SHA-3 candidates. in Proceedings of the Third SHA-3 Candidate Conference, Washington DC. 2012.
[6] Aumasson, J.-P. and W. Meier, Zero-sum distinguishers for reduced Keccak-f and for the core functions of Luffa and Hamsi. rump session of Cryptographic Hardware and Embedded Systems-CHES, 2009. 2009: p. 67.
[7] Duan, M. and X. Lai, Improved zero-sum distinguisher for full round Keccak-f permutation. Chinese Science Bulletin, 2012. 57(6): p. 694-697.
[8] Song, L., G. Liao, and J. Guo. Non-full sbox linearization: applications to collision attacks on round-reduced Keccak. in Annual International Cryptology Conference. 2017. Springer.
[9] Qiao, K., et al. New collision attacks on round-reduced Keccak. in Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2017. Springer.
[10] Dinur, I., O. Dunkelman, and A. Shamir. New attacks on Keccak-224 and Keccak-256. in International Workshop on Fast Software Encryption. 2012. Springer.
[11] Li, M. and L. Cheng. Distinguishing property for full round keccak-f permutation. in Conference on Complex, Intelligent, and Software Intensive Systems. 2017. Springer.
[12] Guo, J., et al., Practical collision attacks against round-reduced SHA-3. Journal of Cryptology, 2020. 33(1): p. 228-270.
[13] Rajasree, M.S. Cryptanalysis of Round-Reduced KECCAK Using Non-linear Structures. in International Conference on Cryptology in India. 2019. Springer.
[14] Bertoni, G., et al. Sponge functions. in ECRYPT hash workshop. 2007. Citeseer.
[15] Nguyễn Văn Long. “Phân tích các thành phần mật mã trong hoán vị Keccak-p”. Nghiên cứu Khoa học và Công nghệ trong lĩnh vực An toàn thông tin, ISSN 2615-9570, No 08. Vol 02. 2018.
[16] Bertoni, G., et al., Keccak implementation overview. URL: http://keccak. neokeon. org/Keccak-implementation-3.2. pdf, 2012.
Downloads
Published
How to Cite
Issue
Section
License
Proposed Policy for Journals That Offer Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Proposed Policy for Journals That Offer Delayed Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication, with the work [SPECIFY PERIOD OF TIME] after publication simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
