Abstract
A public key scheme with trapdoor based on a group of modular knapsacks is proposed. In parallel architecture encryption and decryption are very fast.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Garey, M. R. and Johnson, D. S., Computers and intractability: A guide to the theory of NP-completeness, 1979.
MacEliece, R. J., A public-key cryptosystem based on algebraic coding theory, DSN Progress Rep. 42–44, Jet Propulsion Laboratory, 114–116, 1978.
Niederreiter, H., Knapsack-type cryptosystems and algebraic coding theory, Problems of Control and Information Theory, 15, 159–166, 1986.
Shamir, A., An Efficient Identification Scheme Based on Permuted Kernels (extended abstract), 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niemi, V. (1991). A new trapdoor in knapsacks. In: Damgård, I.B. (eds) Advances in Cryptology — EUROCRYPT ’90. EUROCRYPT 1990. Lecture Notes in Computer Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46877-3_36
Download citation
DOI: https://doi.org/10.1007/3-540-46877-3_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53587-4
Online ISBN: 978-3-540-46877-6
eBook Packages: Springer Book Archive