“Pseudo-random” number generation within cryptographic algorithms: The DDS case
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 277-291
- https://doi.org/10.1007/bfb0052242
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- How to Predict Congruential GeneratorsPublished by Springer Nature ,2001
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete LogarithmsPublished by Springer Nature ,2000
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- Inferring sequences produced by pseudo-random number generatorsJournal of the ACM, 1989
- Minkowski's Convex Body Theorem and Integer ProgrammingMathematics of Operations Research, 1987
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986
- Deciphering a linear congruential encryptionIEEE Transactions on Information Theory, 1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983