Cryptanalysis of the Knapsack Generator

DOI10.1007/978-3-642-21702-9_11zbMath1282.94050OpenAlexW941011284MaRDI QIDQ3013084

Willi Meier, Simon Knellwolf

Publication date: 7 July 2011

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21702-9_11

zbMATH Keywords

pseudorandom generatorknapsackstream cipher

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Attacks on pseudo random number generators hiding a linear structure

Uses Software

• NTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Lovász' lattice reduction and the nearest lattice point problem
• Analysis and design of stream ciphers
• Feedback shift registers, 2-adic span, and combiners with memory
• Fast correlation attacks on the summation generator.
• Efficient cryptographic schemes provably as secure as subset sum
• Subset sum pseudorandom numbers: fast generation and distribution
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• New Generic Algorithms for Hard Knapsacks
• An Introduction to Mathematical Cryptography
• Selected Areas in Cryptography
• Fast Software Encryption

This page was built for publication: Cryptanalysis of the Knapsack Generator