Subset sum pseudorandom numbers: fast generation and distribution

DOI10.1515/JMC.2009.007MaRDI QIDQ3182467zbMATH OpenFDO

Authors Joachim von zur Gathen, Igor E. Shparlinski

Publication date 9 October 2009

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

Full work available at URL https://doi.org/10.1515/JMC.2009.007

zbMATH Keywords

exponential sumsknapsack problemsubset sum problempseudorandom numbers

Mathematics Subject Classification ID

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

Recommendations

• On the multidimensional distribution of the subset sum generator of pseudorandom numbers
• Selected Areas in Cryptography
• Sum-discrepancy test on pseudorandom number generators
• Efficient cryptographic schemes provably as secure as subset sum
• scientific article; zbMATH DE number 910854

Cites work

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

Cited in

(8)

• Fixed points of the subset sum pseudorandom number generators
• On subset sums of pseudo-recursive sequences
• scientific article; zbMATH DE number 721906 (Why is no real title available?)
• Cryptanalysis of the knapsack generator
• Attacks on pseudo random number generators hiding a linear structure
• On the distribution of the subset sum pseudorandom number generator on elliptic curves
• Selected Areas in Cryptography
• 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

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