Subset sum pseudorandom numbers: fast generation and distribution

DOI10.1515/JMC.2009.007zbMATH Open1236.11067MaRDI QIDQ3182467FDOQ3182467

Igor E. Shparlinski, Joachim von zur Gathen

Publication date: 9 October 2009

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

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

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)

Cites Work

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

Cited In (5)

• Fixed points of the subset sum pseudorandom number generators
• Title not available (Why is that?)
• Attacks on pseudo random number generators hiding a linear structure
• Cryptanalysis of the Knapsack Generator
• 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)