Home Subset sum pseudorandom numbers: fast generation and distribution
Article Open Access

Subset sum pseudorandom numbers: fast generation and distribution

  • Joachim von zur Gathen and Igor E. Shparlinski
Published/Copyright: August 19, 2009
Download Article (PDF)
Become an author with De Gruyter Brill
Submit Manuscript Author Information
Journal of Mathematical Cryptology
From the journal Journal of Mathematical Cryptology Volume 3 Issue 2

Received: 2008-08-01
Revised: 2009-05-31
Published Online: 2009-08-19
Published in Print: 2009-August

© de Gruyter 2009

Articles in the same Issue

  1. A cryptographic primitive based on hidden-order groups
  2. Improved security analysis for OMAC as a pseudorandom function
  3. Subset sum pseudorandom numbers: fast generation and distribution
  4. Another look at some fast modular arithmetic methods
https://doi.org/10.1515/JMC.2009.007
Keywords for this article
Pseudorandom numbers; subset sum problem; knapsack problem; exponential sums
Creative Commons
BY-NC-ND 3.0

Articles in the same Issue

  1. A cryptographic primitive based on hidden-order groups
  2. Improved security analysis for OMAC as a pseudorandom function
  3. Subset sum pseudorandom numbers: fast generation and distribution
  4. Another look at some fast modular arithmetic methods
Sign up now to receive a 20% welcome discount
Institutional Access
How does access work?
Have an idea on how to improve our website?
Please write us.
© 2025 De Gruyter Brill
Downloaded on 6.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/JMC.2009.007/html
Scroll to top button