Alpha-DBL: A Reasonable High Secure Double-Block-Length Hash Function
DOI:
https://doi.org/10.54654/isj.v2i12.122Keywords:
double-block-length compression function, collision security, preimage security, ideal cipher modelTóm tắt
Abstract—We propose a new double-block-length compression function which is called Alpha-DBL. This scheme uses two parallel secure single block length schemes based on a block cipher with -bit key and -bit block size to compress a -bit string to a -bit one. We show that the Alpha-DBL scheme attains nearly optimal collision security and preimage security bounds (up to and queries for finding a collision and a preimage, respectively). More precisely, for , no adversary making less than queries can find a collision with probability greater than 1/2. To our knowledge, this collision security bound is nearly better than other such compression functions. In addition, we provide a preimage security analysis of Alpha-DBL that shows security bound of queries for . Using this scheme in the iterated hash function construction can preserve the collision resistance security and the preimage resistance security.
Tóm tắt—Chúng tôi đề xuất một hàm nén độ dài khối kép mới được gọi là Alpha-DBL. Lược đồ này sử dụng hai lược đồ độ dài khối đơn an toàn song song dựa trên mã khối với khóa -bit và kích thước khối -bit để nén chuỗi -bit thành chuỗi -bit. Chúng tôi đã chứng minh rằng, lược đồ Alpha-DBL đạt được cận an toàn kháng va chạm và kháng tiền ảnh gần như tối ưu (tối đa và truy vấn tương ứng để tìm va chạm và tiền ảnh). Cụ thể với , một kẻ tấn công bất kỳ thực hiện ít hơn truy vấn chỉ có thể tìm thấy một va chạm với xác suất nhỏ hơn 1/2. Theo hiểu biết của chúng tôi, cận an toàn kháng va chạm này tốt hơn so với các hàm nén khác. Ngoài ra, chúng tôi đã đưa ra phân tích độ an toàn kháng tiền ảnh của Alpha-DBL cho thấy cận an toàn là 2 truy vấn cho . Sử dụng lược đồ này trong việc xây dựng hàm băm được lặp có thể bảo toàn độ an toàn kháng va chạm và an toàn kháng tiền ảnh.
Downloads
References
Lai, X. and Massey, J.L. “Hash functions based on block ciphers”. Workshop on the Theory and Application of Cryptographic Techniques. Springer, Berlin, Heidelberg, 1992.
Hirose, S. “Some plausible constructions of double-block-length hash functions”. International Workshop on Fast Software Encryption. Springer, Berlin, Heidelberg, 2006.
Stam, M. “Blockcipher-based hashing revisited”. Fast Software Encryption. Springer, Berlin, Heidelberg, 2009.
Hirose, S. “Provably secure double-block-length hash functions in a black-box model. International Conference on Information Security and Cryptology. Springer, Berlin, Heidelberg, 2004.
Özen, O. and Stam, M. “Another glance at double-length hashing”. IMA International Conference on Cryptography and Coding. Springer, Berlin, Heidelberg, 2009.
Fleischmann, Ewan, et al. “Weimar-DM: a highly secure double-length compression function”. Australasian Conference on Information Security and Privacy. Springer, Berlin, Heidelberg, 2012.
Miyaji, A. and Rashed, M. “A new (n, 2n) double block length hash function based on single key scheduling”. The 29th International Conference on Advanced Information Networking and Applications (AINA), IEEE, 2015.
Fleischmann, E., Gorski, M., and Lucks, S. “Security of cyclic double block length hash functions”. IMA International Conference on Cryptography and Coding. Springer, Berlin, Heidelberg, 2009.
Armknecht, F., et al. “The preimage security of double-block-length compression functions”. International Conference on the Theory and Application of Cryptology and Information Security. Springer, Berlin, Heidelberg, 2011.
Lee, J., Stam, M., and Steinberger, J. “The security of Tandem-DM in the ideal cipher model”. Journal of Cryptology, 2017. 30(2): p. 495-518
Mennink, B., “Provable security of cryptographic hash functions”. University of Bristol, UK, 2013.
Rogaway, P., Shrimpton, T. “Cryptographic hash-function basics: Definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance”. In International workshop on fast software encryption. Springer, Berlin, Heidelberg, 2004.
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).
