Subset sum pseudorandom numbers: fast generation and distribution

DOI10.1515/JMC.2009.007zbMath1236.11067MaRDI QIDQ3182467

Joachim von zur Gathen, Igor E. Shparlinski

Publication date: 9 October 2009

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

zbMATH Keywords

exponential sumsknapsack problempseudorandom numberssubset sum problem

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (2)

Attacks on pseudo random number generators hiding a linear structure ⋮ Cryptanalysis of the Knapsack Generator

Cites Work

• On upper bounds of Chalk and Hua for exponential sums
• Exponential sums modulo prime powers
• On the multidimensional distribution of the subset sum generator of pseudorandom numbers

This page was built for publication: Subset sum pseudorandom numbers: fast generation and distribution