Abstract
A possible public-key cipher is described and its security against various cryptanalytic attacks is considered.
Chapter PDF
Similar content being viewed by others
Keywords
- Euclidean Algorithm
- Simple Permutation
- Polynomial Formula
- Trapdoor Information
- Exhaustive Search Procedure
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
Shimshon Berkovits (Uni. of Lowell, Dept. of Computer Science), private communication, Aug., 1985.
John J. Cade, A new public-key cipher which allows signatures, talk given at the Second S.I.A.M. Conference on Applied Linear Algebra, Raleigh, NC, Apr. 30–May 2, 1985.
N. S. James, R. Lidl, and H. Niederreiter, Breaking the Cade cipher, preprint, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cade, J.J. (1987). A Modification of a Broken Public-Key Cipher. In: Odlyzko, A.M. (eds) Advances in Cryptology — CRYPTO’ 86. CRYPTO 1986. Lecture Notes in Computer Science, vol 263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47721-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-47721-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18047-0
Online ISBN: 978-3-540-47721-1
eBook Packages: Springer Book Archive