TY - JOUR
T1 - Secure and efficient random functions with variable-length output
AU - Zhu, Yan
AU - Ma, Di
AU - Hu, Changjun
AU - Ahn, Gail-Joon
AU - Hu, Hongxin
N1 - Funding Information:
We are indebted to anonymous reviewers for their valuable suggestions. This work was presented in part at the Global Communications Conference (GLOBECOM), Anaheim, CA, USA, 2012. This work was supported by the National 973 Program (Grant No. 2013CB329605) and the National Natural Science Foundation of China (Grant Nos. 61170264 and No. 61370187).
PY - 2014/10
Y1 - 2014/10
N2 - Many random functions, like Hash, MAC, PRG, have been used in various network applications for different security choices. However, they are either fast but insecure or cryptographic secure but slow. To integrate them together, in this paper we present a new family of square random functions, including SqHash, SqMAC and SqPRG, based on a specially truncated function (MSB or LSB), as well as circular convolution with carry bits. Provable security is provided by the privacy property in hidden number problem and Hard-core unpredication of one-way function. The experiment results show that these schemes have better performance under different input and output lengths. We also perform four types of statistical tests for randomness. The experiments indicate that our construction has good average-case randomness than SHA-2 and original Square algorithm.
AB - Many random functions, like Hash, MAC, PRG, have been used in various network applications for different security choices. However, they are either fast but insecure or cryptographic secure but slow. To integrate them together, in this paper we present a new family of square random functions, including SqHash, SqMAC and SqPRG, based on a specially truncated function (MSB or LSB), as well as circular convolution with carry bits. Provable security is provided by the privacy property in hidden number problem and Hard-core unpredication of one-way function. The experiment results show that these schemes have better performance under different input and output lengths. We also perform four types of statistical tests for randomness. The experiments indicate that our construction has good average-case randomness than SHA-2 and original Square algorithm.
KW - Algorithm
KW - Hidden number problem
KW - Random function
KW - Randomness
KW - Variable length
UR - http://www.scopus.com/inward/record.url?scp=84906511511&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84906511511&partnerID=8YFLogxK
U2 - 10.1016/j.jnca.2014.07.033
DO - 10.1016/j.jnca.2014.07.033
M3 - Article
AN - SCOPUS:84906511511
SN - 1084-8045
VL - 45
SP - 121
EP - 133
JO - Journal of Network and Computer Applications
JF - Journal of Network and Computer Applications
ER -