Omega network hash construction
Cryptographic hash functions are very common and important cryptographic primitives. They are commonly used for data integrity checking and data authentication. Their architecture is based on the Merkle-Damgard construction, which takes in a variablelength input and produces a fixed-length hash v...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2009
|
| 主題: | |
| 在線閱讀: | http://eprints.uthm.edu.my/3706/1/24p%20CHUAH%20CHAI%20WEN.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Cryptographic hash functions are very common and important cryptographic primitives.
They are commonly used for data integrity checking and data authentication. Their
architecture is based on the Merkle-Damgard construction, which takes in a variablelength
input and produces a fixed-length hash value. The basic Merkle-Damgard
construction runs over the input sequentially, which can lead to problems when the input
size is large since the computation time increases linearly. Therefore, an alternative
architecture which can reduce the computation time is needed, especially in today's
world where multi-core processors and multithreaded programming are common. An
Omega Network Hash Construction that can run parallel on multi-core machine has been
proposed as alternative hash function's construction. The Omega Network Hash
Construction performs better than the Merkle-Damgard construction, and its permutation
architecture shows that its security level in term of producing randomness digest value is
better than Merkle-Damgard construction. |
|---|