Formalizing human ignorance collision-resistant hashing without the keys
There is a rarely mentioned foundational problem involving collision-resistant hash-functions: common constructions are keyless, but formal definitions are keyed. The discrepancy stems from the fact that a function H: {0,1}*→ {0, 1}nalways admits an efficient collision-finding algorithm, it's j...
Saved in:
主要作者: | Phillip Rogaway |
---|---|
格式: | Book Series |
出版: |
2018
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84887264252&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/61601 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Chiang Mai University |
相似書籍
-
Variationally universal hashing
由: Ted Krovetz, et al.
出版: (2018) -
CBC MACs for arbitrary-length messages: The three-key constructions
由: John Black, et al.
出版: (2018) -
Practical pseudo-collisions for hash functions ARIRANG-224/384
由: Guo, Jian, et al.
出版: (2012) -
Chosen-prefix collisions on AES-like hashing
由: Chen, Shiyao, et al.
出版: (2025) -
GPU implementation of a collision search for RIPEMD-128 hash function
由: Heng, Heok Hui
出版: (2016)