Publication | Open Access
The Lane hash function
35
Citations
4
References
2009
Year
Hardware SecurityCryptographic PrimitiveEngineeringIterated Hash FunctionInformation SecurityCryptographic TechnologyComputer EngineeringLightweight CryptographyLane Hash FunctionHash FunctionComputer ScienceBlock CipherBlockchainSha-3 CompetitionPerceptual HashingData SecurityCryptographyMultiple Digest Sizes
We propose the cryptographic hash function Lane as a candidate for the SHA-3 competition organised by NIST. Lane is an iterated hash function supporting multiple digest sizes. Components of the AES block cipher are reused as building blocks. Lane aims to be secure, easy to understand, elegant and flexible in implementation.
| Year | Citations | |
|---|---|---|
Page 1
Page 1