IEICE TRANSACTIONS on Fundamentals
A Family of Fast Dedicated One-Way Hash Functions Based on Linear Cellular Automata over GF(q)
Summary :
This paper proposes a novel one-way hash function that can serve as a tool in achieving authenticity and data integrity. The one-way hash function can be viewed as a representative of a family of fast dedicated one-way hash functions whose construction is based on linear cellular automata over GF(a). The design and analysis of security of the function is accomplished by the use of very recently published results on cellular automata and their applications in cryptography. The analysis indicates that the one-way hash function is secure against all known attacks. A promising property of the proposed one-way hash function is that it is especially suitable for compact and fast implementation.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E82-A No.1 pp.40-47
- Publication Date
- 1999/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Miodrag MIHALJEVIC, Yuliang ZHENG, Hideki IMAI, "A Family of Fast Dedicated One-Way Hash Functions Based on Linear Cellular Automata over GF(q)" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 1, pp. 40-47, January 1999, doi: .
Abstract: This paper proposes a novel one-way hash function that can serve as a tool in achieving authenticity and data integrity. The one-way hash function can be viewed as a representative of a family of fast dedicated one-way hash functions whose construction is based on linear cellular automata over GF(a). The design and analysis of security of the function is accomplished by the use of very recently published results on cellular automata and their applications in cryptography. The analysis indicates that the one-way hash function is secure against all known attacks. A promising property of the proposed one-way hash function is that it is especially suitable for compact and fast implementation.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_1_40/_p
Copy
@ARTICLE{e82-a_1_40,
author={Miodrag MIHALJEVIC, Yuliang ZHENG, Hideki IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Family of Fast Dedicated One-Way Hash Functions Based on Linear Cellular Automata over GF(q)},
year={1999},
volume={E82-A},
number={1},
pages={40-47},
abstract={This paper proposes a novel one-way hash function that can serve as a tool in achieving authenticity and data integrity. The one-way hash function can be viewed as a representative of a family of fast dedicated one-way hash functions whose construction is based on linear cellular automata over GF(a). The design and analysis of security of the function is accomplished by the use of very recently published results on cellular automata and their applications in cryptography. The analysis indicates that the one-way hash function is secure against all known attacks. A promising property of the proposed one-way hash function is that it is especially suitable for compact and fast implementation.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - A Family of Fast Dedicated One-Way Hash Functions Based on Linear Cellular Automata over GF(q)
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 40
EP - 47
AU - Miodrag MIHALJEVIC
AU - Yuliang ZHENG
AU - Hideki IMAI
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 1999
AB - This paper proposes a novel one-way hash function that can serve as a tool in achieving authenticity and data integrity. The one-way hash function can be viewed as a representative of a family of fast dedicated one-way hash functions whose construction is based on linear cellular automata over GF(a). The design and analysis of security of the function is accomplished by the use of very recently published results on cellular automata and their applications in cryptography. The analysis indicates that the one-way hash function is secure against all known attacks. A promising property of the proposed one-way hash function is that it is especially suitable for compact and fast implementation.
ER -
English
