TY - GEN
T1 - Secure and efficient constructions of hash, MAC and PRF for mobile devices
AU - Zhu, Yan
AU - Wang, Shanbiao
AU - Ma, Di
AU - Hu, Hongxin
AU - Ahn, Gail-Joon
PY - 2012
Y1 - 2012
N2 - Numerous cryptographic techniques have been developed to be used on mobile devices for various security and privacy protections. However, these cryptographic primitives, working under different mathematical assumptions, tend to become more and more complex and intricate, which makes it increasingly more difficult for proper implementation and management. Thus, it is desired to simplify management and improve efficiency by means of designing a general function family to meet a variety of security requirements. In this paper, we present such a family of square functions, including SqHash, SqMAC and SqPRF, based on a specially truncated function (MSB or LSB). We further improve the efficiency of these algorithms by using 'circular convolution with carry bits' which makes parallel processing possible. We prove the security of these functions based on the privacy in hidden number problem and hard-core predicate of one-way function. We also show that the proposed schemes achieve better performance with a complexity reduction from O(n2) to O(kn/w) for n-bit message, k-bit output and w-bit word size.
AB - Numerous cryptographic techniques have been developed to be used on mobile devices for various security and privacy protections. However, these cryptographic primitives, working under different mathematical assumptions, tend to become more and more complex and intricate, which makes it increasingly more difficult for proper implementation and management. Thus, it is desired to simplify management and improve efficiency by means of designing a general function family to meet a variety of security requirements. In this paper, we present such a family of square functions, including SqHash, SqMAC and SqPRF, based on a specially truncated function (MSB or LSB). We further improve the efficiency of these algorithms by using 'circular convolution with carry bits' which makes parallel processing possible. We prove the security of these functions based on the privacy in hidden number problem and hard-core predicate of one-way function. We also show that the proposed schemes achieve better performance with a complexity reduction from O(n2) to O(kn/w) for n-bit message, k-bit output and w-bit word size.
KW - Algorithm
KW - Cryptography
KW - Hash
KW - Hidden Number Problem
KW - MAC
KW - Pseudorandom
UR - http://www.scopus.com/inward/record.url?scp=84877643830&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84877643830&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2012.6503235
DO - 10.1109/GLOCOM.2012.6503235
M3 - Conference contribution
AN - SCOPUS:84877643830
SN - 9781467309219
T3 - GLOBECOM - IEEE Global Telecommunications Conference
SP - 949
EP - 954
BT - 2012 IEEE Global Communications Conference, GLOBECOM 2012
T2 - 2012 IEEE Global Communications Conference, GLOBECOM 2012
Y2 - 3 December 2012 through 7 December 2012
ER -