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:
Main Author: | Penying Rochanakul |
---|---|
Format: | Journal |
Published: |
2020
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85084473395&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/70731 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
New Bounds on 2-Frameproof Codes of Length 4
by: Penying Rochanakul
Published: (2020) -
Cryptanalysis of the LAKE hash family
by: Biryukov, Alex, et al.
Published: (2012) -
Analysis of cryptographic hash functions
by: Guo, Jian
Published: (2011) -
Improved meet-in-the-middle Nostradamus attacks on AES-like hashing
by: Dong, Xiaoyang, et al.
Published: (2024) -
Asymptotic improvement of GV bound
by: Yip, Jose Zheng Ho
Published: (2022)