Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor

  • Paul Barrett
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 263)

Abstract

A description of the techniques employed at Oxford University to obtain a high speed implementation of the RSA encryption algorithm on an “off-the-shelf” digital signal processing chip. Using these techniques a two and a half second (average) encrypt time (for 512 bit exponent and modulus) was achieved on a first generation DSP (The Texas Instruments TMS 32010) and times below one second are achievable on second generation parts. Furthermore the techniques of algorithm development employed lead to a provably correct implementation.

References

  1. R L Rivest, A Shamir and L Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”, Communications ACM Vol 21 (2) (Feb 1978)Google Scholar
  2. Dorothy E R Denning, “Cryptography and Data Security”, Addisson-Wesley (1983)Google Scholar
  3. Texas Instruments, “TMS 32010 User’s Guide”’ (1983)Google Scholar
  4. Donald E Knuth, “The Art of Computer Programming Volume 2-Seminumerical Algorithms”, Addisson-Wesley (second edition — 1981)Google Scholar
  5. P D Barrett, “Communications Authentication and Security using Public Key Encryption — A Design for Implementation.” (Oxford University Programming Research Group MSc Thesis (1984)Google Scholar
  6. C A R Hoare, “Notes of Communicating Sequential Processes”, Oxford University Computing Laboratory (1983)Google Scholar
  7. David Gries, “The Science of Computer Programming”, Springer-Verlay (1981)Google Scholar
  8. Edsger Dijkstra, “A Discipline of Programming”, Prentice Hall (1976)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Paul Barrett
    • 1
  1. 1.Computer Security LtdUK

Personalised recommendations