Linear Bandwidth Naccache-Stern Encryption

DOI10.1007/978-3-540-85855-3_22MaRDI QIDQ3540055zbMATH OpenOpenAlexFDO

Authors Benoît Chevallier-Mames, David Naccache, Jacques Stern

Publication date 20 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85855-3_22

zbMATH Keywords

efficiencymultiplicative knapsackNS cryptosystempublic key cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Birthday type attacks to the Naccache-Stern knapsack cryptosystem
• A new trapdoor knapsack public key cryptosystem
• Non-injective knapsack public-key cryptosystems
• scientific article; zbMATH DE number 691485
• A knapsack-based probabilistic encryption scheme

Cites work

• Cryptocomputing with rationals
• Gauss' algorithm revisited
• scientific article; zbMATH DE number 3957110 (Why is no real title available?)
• Probabilistic encryption
• Secure integration of asymmetric and symmetric encryption schemes

Cited in

(5)

• Birthday type attacks to the Naccache-Stern knapsack cryptosystem
• Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
• Cryptanalysis of the CLR-cryptosystem
• Narrow Bandwidth Is Not Inherent in Reverse Public-Key Encryption
• A general construction for monoid-based knapsack protocols

This page was built for publication: Linear Bandwidth Naccache-Stern Encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540055)