Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor
Paul Barrett
- 01 Jan 1987
- pp 311-323
TL;DR: In this paper, the authors describe 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.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
PMNS for Efficient Arithmetic and Small Memory Cost
TL;DR: The Polynomial Modular Number System (PMNS) is an integer number system which aims to speed up arithmetic operations modulo a prime.
Cloud-based secure human action recognition with fully homomorphic encryption
Ruyan Wang,Qi Zeng,Zhigang Yang,Puning Zhang +3 more
Modern Computer Arithmetic (version 0.5.1)
Richard P. Brent,Paul Zimmermann +1 more
TL;DR: This book focuses on algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics such as modular arithmetic, greatest common divisors, the Fast Fourier Transform (FFT), and the computation of elementary and special functions.
On the performance of GPU public-key cryptography
Samuel Neves,Filipe Araujo +1 more
- 11 Sep 2011
TL;DR: In this article, the authors focus their attention on the NVIDIA GT200 architecture, currently one of the most popular for general purpose GPU computation and study the particular case of modular exponentiation, the crucial operation behind most modern public-key cryptography algorithms.
Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography
Angshuman Karmakar,Sujoy Sinha Roy,Frederik Vercauteren,Ingrid Verbauwhede +3 more
- 13 Jul 2016
TL;DR: In this paper, an efficient modular multiplication algorithm for primes of the form p = 2\cdot {2^a}3^b-1 with b even, typically used in post-quantum cryptography is proposed.
References
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Communicating sequential processes
TL;DR: It is suggested that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method.
A Method for Obtaining Digital Signatures and Public Key Cryptosystems (Formerly on Digital Signatures and Public Key Cryptosystems)
Ronald L. Rivest,Adi Shamir,Len Adelman +2 more
- 01 Jan 1977
TL;DR: In this paper, a message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret prime numbers p and q.
8.2K
•Book
The Art of Computer Programming, Volume 2: Seminumerical Algorithms
Donald E. Knuth
- 01 Jan 1981
4.4K
Related Papers (5)
Alfred Menezes,Scott A. Vanstone,Paul C. van Oorschot +2 more
- 01 Jan 1996
Victor S. Miller
- 18 Aug 1985