Publication Type

Journal Article

Version

publishedVersion

Publication Date

6-2002

Abstract

At PKC 2000, Inoue and Sakurai proposed some methods to design hash functions from block ciphers and codes (block codes and convolutional codes). They claimed that their hash functions are secure: 2(d-1)m/2 encryptions are necessary to find a collision, where d and m are the minimal distance of the code and the block size of block cipher, respectively. However, we show in this paper that a collision could be found with about alpha*2m encryptions, where alpha is a small number.

Keywords

cryptanalysis, hash function, block cipher, codes

Discipline

Information Security

Research Areas

Cybersecurity

Publication

Informatica: A Journal of Computing and Informatics

Volume

26

Issue

3

First Page

255

Last Page

258

ISSN

0350-5596

Publisher

Slovenian Society Informatika

City or Country

Ljubljana

Copyright Owner and License

Authors

Creative Commons License

Creative Commons Attribution 3.0 License
This work is licensed under a Creative Commons Attribution 3.0 License.

Additional URL

https://www.informatica.si/index.php/informatica/issue/view/104

Share

COinS