Local Randomness in Polynomial Random Number and Random Function Generators

DOI10.1137/0222045MaRDI QIDQ3137704zbMATH OpenOpenAlexFDO

Authors Harald Niederreiter, Claus Peter Schnorr

Publication date 10 October 1993

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0222045

zbMATH Keywords

one-way functionslocal randomnesscryptographic has functionspolynomial random function generatorspolynomial random number generatorsupper bounds for exponential sums

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Cryptography (94A60) Estimates on exponential sums (11L07) Pseudo-random numbers; Monte Carlo methods (11K45) Theory of computing (68Q99)

Recommendations

• A note on local randomness in polynomial random number and random function generators
• scientific article; zbMATH DE number 4182680
• Local randomness in pseudorandom sequences
• Algebraic attacks against random local functions and their countermeasures
• Efficient, perfect polynomial random number generators

Cited in

(4)

• Algebraic attacks against random local functions and their countermeasures
• A note on local randomness in polynomial random number and random function generators
• Polynomial pseudo-random number generator via cyclic phase
• Algorithmic Number Theory

This page was built for publication: Local Randomness in Polynomial Random Number and Random Function Generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137704)