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
A RISC-V Post Quantum Cryptography Instruction Set Extension for Number Theoretic Transform to Speed-Up CRYSTALS Algorithms
Pietro Nannipieri,Stefano Di Matteo,Luca Zulberti,Francesco Albicocchi,Sergio Saponara,Luca Fanucci +5 more
TL;DR: In this paper, the authors investigate a solution trading-off performance and complexity to execute the lattice-based algorithms CRYSTALS-Kyber and -Dilithium.
48
Efficient RNS Bases for Cryptography
Jean-Claude Bajard,Nicolas Méloni,Thomas Plantard +2 more
- 11 Jul 2005
TL;DR: An analysis of the criteria for selecting some bases giving efficient conversions of modular multiplication algorithms in RNS is proposed and methods for constructing an efficient basis in function of the size of different parameters like the basic operators, the key of the cryptosystem, etc are given.
48
FPGA-based Accelerators of Fully Pipelined Modular Multipliers for Homomorphic Encryption
Sunwoong Kim,Keewoo Lee,Wonhee Cho,Jung Hee Cheon,Rob A. Rutenbar +4 more
- 01 Dec 2019
TL;DR: A set of novel FPGA-based accelerators for fully pipelined ModMults to address the speed problem of modular multiplication, and the proposed Barrett and Shoup ModMult designs show the highest throughput/DSP value although precomputation required in the ShOUP ModMult design is not used.
47
An Efficient Implementation of the NewHope Key Exchange on FPGAs
Yufei Xing,Shuguo Li +1 more
TL;DR: This work proposes an efficient implementation of NewHope on Xilinx Artix-7 7020 FPGA platform that consumes 3158 slices, 10285 LUTs, 6623 registers in the server side, and 3042 slices, 10345 LUTing in the client side, achieving a 45% reduction in LUT, 30% reductionIn FF while the total time utilization also decreases by 16% compared with the up to date and directly related work.
47
Accelerating LTV Based Homomorphic Encryption in Reconfigurable Hardware
Yarkin Doröz,Erdinc Ozturk,Erkay Savas,Berk Sunar +3 more
- 13 Sep 2015
TL;DR: A custom hardware accelerator optimized for a class of reconfigurable logic to bring LTV based somewhat homomorphic encryption (SWHE) schemes one step closer to deployment in real-life applications.
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