The FSR-255 family of hash functions with a variable length of hash result

Authors:
Tadeusz Gajewski;Izabela Janicka-Lipska;Janusz Stokłosa
Affiliations:
Poznan University of Technology, Institute of Control and Information Engineering, pl. Sklodowskiej-Curie 5, 60-965 Poznan, Poland;Poznan University of Technology, Institute of Control and Information Engineering, pl. Sklodowskiej-Curie 5, 60-965 Poznan, Poland;Poznan University of Technology, Institute of Control and Information Engineering, pl. Sklodowskiej-Curie 5, 60-965 Poznan, Poland
Venue:
Artificial intelligence and security in computing systems
Year:
2003

Citing 2
Cited 1

Handbook of Applied Cryptography

Handbook of Applied Cryptography
Construction of m-ary de Bruijn Sequences (Extendet abstract)

ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology

Modifications of SHA-0 to prevent attacks

ICISS'05 Proceedings of the First international conference on Information Systems Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper a family of cryptographic hash functions with a variable length of hash result, called the FSR-255 family, is presented. The hash functions are defined by some processing structures based on seventeen 15-stage nonlinear feedback shift registers. The feedback functions can be modified by the user to customize the hash function. An algorithm for computing the hash result of length r≤255 is given. It was successfully tested against the birthday attack: no collisions have been found. The FSR-255 family hardware implementation is presented at the level of logical structure. The circuit is designed for implementing as a full custom ASIC, and is optimized to increase the processing rate. The device is capable of working on-line, and can be customized by the user.