Algorithms for Data Encryption
Part of the Workshops in Computing book series (WORKSHOPS COMP.)
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.
KeywordsElliptic Curve Finite Field Elliptic Curf Knapsack Problem Encryption System
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.
Unable to display preview. Download preview PDF.
- 1.Adleman, Rivest, Shamir “A method for obtaining digital signatures and public-key cryptosystems.” Comunications of the ACM, 1978Google Scholar
- 3.Coppersmith “Fast evaluation of logarithms in fields of characteristic two.” IEEE Transactions in Information Theory IT-30, 1984.Google Scholar
- 4.Diffie, Hellman “New directions in cryptography.” IEEE Transactions in Information Theory IT-22, 1976.Google Scholar
- 5.Fiat, Shamir How To Prove Yourself: Practical Solutions to the Identification and Signature Problems. Weizmann Institute of Science, Rehovot, 1986.Google Scholar
- 6.El Gamal “A public key cryptosystem and a signature scheme based on discrete logarithms.” IEEE Transactions in Information Theory.Google Scholar
- 7.Guillou, Quisquater A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In Eurocrypt, 1988.Google Scholar
- 8.Hellman, Merkle “Hiding information and signatures in trapdoor knapsacks.” IEEE Transactions in Information Theory IT-24, 1978.Google Scholar
- 10.Lenstra “Factoring integers with elliptic curves.” Report 86-18, Universiteit van Amstgerdam, 1986.Google Scholar
- 11.Massey “Logarithms in finite cyclic groups—cryptographic issues.” Proceedings of the 4th Benelux Symposium on Information Theory, 1983.Google Scholar
- 12.Meyer, C. Cryptography: a guide for the design and implementation of cryptographic systems. John Wiley & Sons, Inc. 1982Google Scholar
- 13.National Bureau of Standards Data Encryption Standard. Washington, DC, 1977.Google Scholar
- 14.Rosenberg MONADS-PC System Management Instructions. Newcastle, N.S.W., 1987.Google Scholar
- 15.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.Google Scholar
© British Computer Society 1990