Secure and efficient random functions with variable-length output

Yan Zhu, Di Ma, Changjun Hu, Gail-Joon Ahn, Hongxin Hu

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
Pages (from-to)121-133
Number of pages13
JournalJournal of Network and Computer Applications
Volume45
DOIs
StatePublished - 2014

Fingerprint

Statistical tests
Convolution
Experiments

Keywords

  • Algorithm
  • Hidden number problem
  • Random function
  • Randomness
  • Variable length

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture

Cite this

Secure and efficient random functions with variable-length output. / Zhu, Yan; Ma, Di; Hu, Changjun; Ahn, Gail-Joon; Hu, Hongxin.

In: Journal of Network and Computer Applications, Vol. 45, 2014, p. 121-133.

Research output: Contribution to journalArticle

Zhu, Yan ; Ma, Di ; Hu, Changjun ; Ahn, Gail-Joon ; Hu, Hongxin. / Secure and efficient random functions with variable-length output. In: Journal of Network and Computer Applications. 2014 ; Vol. 45. pp. 121-133.
@article{42f2c0d1e7204946bfe45c2b50e0008c,
title = "Secure and efficient random functions with variable-length output",
abstract = "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.",
keywords = "Algorithm, Hidden number problem, Random function, Randomness, Variable length",
author = "Yan Zhu and Di Ma and Changjun Hu and Gail-Joon Ahn and Hongxin Hu",
year = "2014",
doi = "10.1016/j.jnca.2014.07.033",
language = "English (US)",
volume = "45",
pages = "121--133",
journal = "Journal of Network and Computer Applications",
issn = "1084-8045",
publisher = "Academic Press Inc.",

}

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

PY - 2014

Y1 - 2014

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

VL - 45

SP - 121

EP - 133

JO - Journal of Network and Computer Applications

JF - Journal of Network and Computer Applications

SN - 1084-8045

ER -