New Definition of Density on Knapsack Cryptosystems

DOI10.1007/978-3-540-68164-9_11zbMath1142.94349OpenAlexW97054113MaRDI QIDQ3506377

Noboru Kunihiro

Publication date: 13 June 2008

Published in: Progress in Cryptology – AFRICACRYPT 2008 (Search for Journal in Brave)

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

zbMATH Keywords

Shannon Entropy(pseudo-)densityLattice AttackLow-Weight Knapsack Cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Preimage selective trapdoor function: how to repair an easy problem ⋮ Quadratic compact knapsack public-key cryptosystem ⋮ Cryptanalysis of a knapsack-based probabilistic encryption scheme

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved low-density subset sum algorithms
• Low-density attack revisited
• Lattice points in high-dimensional spheres
• Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
• A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
• Solving low-density subset sum problems
• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• Adapting Density Attacks to Low-Weight Knapsacks
• Enumerative source encoding
• Hiding information and signatures in trapdoor knapsacks
• Cryptanalysis of the Chor-Rivest cryptosystem

This page was built for publication: New Definition of Density on Knapsack Cryptosystems