Abstract
Positive impact of redundancy is an aspect not much explored. This paper presents a new look at redundancy, particularly as related to public-key cryptography, pointing to a new way of building security.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. McEliece, JPL DSN Progress Report, pp. 42–44, January–February 1978, pp. 114-116
J. Hoffstein, J. Pipher and J. Silverman, NTRU, A Ring-Based Public Key Cryptosystem, Algorithmic Number Theory, (ANTS III), Portland, OR, June 1998, J.P. Buhler (ed.), Lecture Notes in Computer Science 1423, Springer-Verlag, Berlin, 1998, pp. 267–288.
D. Knuth, The Art of Computer Programming, Vol. 2, 3rdEd., Addison Wesley, 1998, p.291
G. Orton, A Multiple-Iterated Trapdoor for Dense Compact Knapsacks, Advances in Cryptology EUROCRYPTO '94 Proceedings, Berlin: Springer-Verlag, 1995, pp. 112–130
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gram, S. (2001). Redundancy, Obscurity, Self-Containment & Independence. In: Qing, S., Okamoto, T., Zhou, J. (eds) Information and Communications Security. ICICS 2001. Lecture Notes in Computer Science, vol 2229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45600-7_56
Download citation
DOI: https://doi.org/10.1007/3-540-45600-7_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42880-0
Online ISBN: 978-3-540-45600-1
eBook Packages: Springer Book Archive