Making hash functions from block ciphers secure and efficient by using convolutional codes

Toru Inoue, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We improve Knudsen-Preneel's constructions for cryptographic hash functions based on block ciphers with error correcting codes. We first modify to extend original constructions, which are effective only for non-binary codes, to the case with binary codes (e.g. BCH codes). We also revise the original method by introducing convolutional codes, whereas the previous adapts only block codes. This reduces the circuit complexity of the hardware-implementation 1/N times in terms of the number of (Davies-Meyer's) module functions than that based block error correcting codes.

Original languageEnglish
Title of host publicationPublic Key Cryptography - 3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Proceedings
EditorsHideki Imai, Yuliang Zheng
PublisherSpringer Verlag
Pages391-404
Number of pages14
ISBN (Print)3540669671, 9783540669678
DOIs
Publication statusPublished - 2000
Event3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000 - Melbourne, Australia
Duration: Jan 18 2000Jan 20 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1751
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000
Country/TerritoryAustralia
CityMelbourne
Period1/18/001/20/00

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Making hash functions from block ciphers secure and efficient by using convolutional codes'. Together they form a unique fingerprint.

Cite this