A note on local randomness in polynomial random number and random function generators

Huaning Liu

doi:10.1016/j.amc.2006.07.159

A note on local randomness in polynomial random number and random function generators

2007-03-01

0

PRE

AI

H

Huaning Liu *

DOI：10.1016/j.amc.2006.07.159

原文链接

摘要

En 中文

A n-bit string is said to be (epsilon,e)-locally random, if for every choice of e <= n positions the induced distribution on e-bit strings is in the L-1-norm at most epsilon away from the uniform distribution on e-bit strings. Niederreiter and Schnorr [H. Niederreiter, C.P. Schnorr, Local randomness in polynomial random nurnber and random function generators, SIAM Journal on Computing 22 (1993) 684-694] established local randomness in polynomial random number generators (RNG) and local randomness in families of cryptographic hash functions. However, their polynomial random functions must be linearly independent. In this paper, we shall give new families of cryptographic hash functions, which do not require linear independence. Local randomness of our functions is studied. (c) 2006 Elsevier Inc. All rights reserved.

Keyword:

local randomness

hash functions

random function generator

discrepancy

A note on local randomness in polynomial random number and random function generators

摘要

AI总结

期刊

机构

引用论文