Abstract
An overview of well known and not so well known data encryption systems is given. Some suggestions for their use in capability based computer systems are made and problems are pointed out.
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
Adleman, Rivest, Shamir “A method for obtaining digital signatures and public-key cryptosystems.” Comunications of the ACM, 1978
Brassard Modern Cryptology. New York, Berlin, 1988.
Coppersmith “Fast evaluation of logarithms in fields of characteristic two.” IEEE Transactions in Information Theory IT-30, 1984.
Diffie, Hellman “New directions in cryptography.” IEEE Transactions in Information Theory IT-22, 1976.
Fiat, Shamir How To Prove Yourself: Practical Solutions to the Identification and Signature Problems. Weizmann Institute of Science, Rehovot, 1986.
El Gamal “A public key cryptosystem and a signature scheme based on discrete logarithms.” IEEE Transactions in Information Theory.
Guillou, Quisquater A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In Eurocrypt, 1988.
Hellman, Merkle “Hiding information and signatures in trapdoor knapsacks.” IEEE Transactions in Information Theory IT-24, 1978.
Koblitz A Course in Number Theory and Cryptography. New York, Berlin, 1987.
Lenstra “Factoring integers with elliptic curves.” Report 86-18, Universiteit van Amstgerdam, 1986.
Massey “Logarithms in finite cyclic groups—cryptographic issues.” Proceedings of the 4th Benelux Symposium on Information Theory, 1983.
Meyer, C. Cryptography: a guide for the design and implementation of cryptographic systems. John Wiley & Sons, Inc. 1982
National Bureau of Standards Data Encryption Standard. Washington, DC, 1977.
Rosenberg MONADS-PC System Management Instructions. Newcastle, N.S.W., 1987.
Shamir “A polynomial time algorithm for breaking the basic Merkle—Helman cryptosystem.” Proceedings of the 23rd Annual Symposium on the Foundations of Computer Science, 1982.
Silverman The Arithmetic of Elliptic Curves. New York, Berlin, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 British Computer Society
About this paper
Cite this paper
Müller, W. (1990). Algorithms for Data Encryption. In: Rosenberg, J., Keedy, J.L. (eds) Security and Persistence. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3178-6_7
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3178-6_7
Publisher Name: Springer, London
Print ISBN: 978-3-540-19646-4
Online ISBN: 978-1-4471-3178-6
eBook Packages: Springer Book Archive