Improved bounds on the size of separating hash families of short length
© 2020 by the Mathematical Association of Thailand. In this paper, we present some new upper bounds on the size of separating hash families of type {w1,w2} of short length, where the length N is not exceeding 2w2. A new proof for tight bounds on the size of separating hash families of type {1, w} is...
Saved in:
主要作者: | Penying Rochanakul |
---|---|
格式: | 雜誌 |
出版: |
2020
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85084473395&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/70731 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
New Bounds on 2-Frameproof Codes of Length 4
由: Penying Rochanakul
出版: (2020) -
Cryptanalysis of the LAKE hash family
由: Biryukov, Alex, et al.
出版: (2012) -
Analysis of cryptographic hash functions
由: Guo, Jian
出版: (2011) -
Improved meet-in-the-middle Nostradamus attacks on AES-like hashing
由: Dong, Xiaoyang, et al.
出版: (2024) -
Asymptotic improvement of GV bound
由: Yip, Jose Zheng Ho
出版: (2022)