Cryptanalysis of the knapsack generator
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 177035 (Why is no real title available?)
- scientific article; zbMATH DE number 503278 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- An Introduction to Mathematical Cryptography
- Analysis and design of stream ciphers
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Efficient cryptographic schemes provably as secure as subset sum
- Fast Software Encryption
- Fast correlation attacks on the summation generator.
- Feedback shift registers, 2-adic span, and combiners with memory
- New generic algorithms for hard knapsacks
- On Lovász' lattice reduction and the nearest lattice point problem
- Selected Areas in Cryptography
- Subset sum pseudorandom numbers: fast generation and distribution
Cited in
(4)- scientific article; zbMATH DE number 6622827 (Why is no real title available?)
- Improvement of key generation for a number field based knapsack cryptosystem
- Attacks on pseudo random number generators hiding a linear structure
- Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key Cipher
This page was built for publication: Cryptanalysis of the knapsack generator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3013084)