Securing Distributed FPGA System using Commutative RSA Core

§ Vinayaka Missions University, Salem, India
‡ S J B Institute of Technology, Bangalore, India S J B Institute of Technology, Bangalore, India
Sona College of Engineering, Salem, India

Send Message

To: Author

Securing Distributed FPGA System using Commutative RSA Core

Article Fingerprint

ReserarchID

Z214G

Securing Distributed FPGA System using Commutative RSA Core Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background
This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

Abstract

Protecting important data is of utmost concern to the organizations or multiple transceiver based communication systems and, cryptography is one of the primary ways to do the job. RSA algorithm is extensively used in the popular implementations of Public Key Infrastructures. Many cryptographic protocols and attacks on these protocols make use of the fact that the order in which encryption is performed does not affect the result of the encryption, i.e., encryption is commutative. On the other hand, the need of a security feature encompassing data authentication among multiple MIMO or transceivers has become very critical. This paper presents the implementation of a cryptography core based on Commutative RSA public key cryptography algorithm for accomplishing data security and authentication in environment comprising multiple FPGA cores without any key exchange overheads. In spite of considering conventional two terminal communications, we have implemented a scalable architecture for multi distributed FPGA based systems and realizes commutative RSA algorithm for verifying data security among multiple transceiver terminals. In this approach, a sophisticated RSA cryptographic technique based on commutative Encryption methodology has been implemented for distributed FPGA terminals. The proposed system architecture has used the Montgomery multiplication algorithm with exponential modular multiplication and Radix-2 multiplication based multiparty cryptography. The proposed multiplier is able to work with any precision of the input operands, limited only by memory or control constraints. The result obtained for this approach has illustrated a very high computational efficiency with minimum memory or space occupancy and higher operational frequency. The proposed PM based CRSA cryptography core has exhibited 12.1% higher throughput as compared to Serial Montgomery based CRSA. Similarly, the frequency or speed of the proposed system is also higher. The proposed system exhibits trade-off of 0.03% in power consumption.

References

22 Cites in Article
  1. 1. B. Premkumar (1992). An RNS to binary converter in 2n+1, 2n, 2n-1 moduli set. IEEE Trans. Circuits Syst. II, 39(7), 480-482.
  2. 2. B. SCHNEIER (1996). Applied Cryptography: Protocols, Algorithms, and Source Code in C.
  3. 3. R. Rivest,A. Shamir,L. Adleman (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126.
  4. 4. (1985). Modular multiplication without trial division. pp, 44(170), 519-521.
  5. 5. S. Eldridge,C. Walter (1993). Hardware Implementation of Montgomery. pp, 42, 693-699.
  6. 6. A. Elbirt,C. Paar (1999). Toward an FPGA architecture optimized for public-key algorithms. the SPIE Symposium on Voice, Video and Communications, Sept
  7. 7. T. Blum,C. Paar (1999). Montgomery Exponentiation on Re-configurable Hardware. pp, 1999, 70-77.
  8. 8. Y. Kim,W. Kang,J. Choi (2000). Implementation of 1024-bit processor for RSA cryptosystem.
  9. 9. V. Bunimov,M. Schimmler,B. Tolg (2002). A Complexity-Effective Version of Montgomery’s Algorithm. Presented at the Workshop on Complexity Effective Designs (WECD02
  10. 10. Jean-Pierre Gustavo D. Sutter,José Luis (2011). Modular Multiplication and Exponentiation Architectures for Fast RSA Cryptosystem Based on Digit Serial Computation. IEEE Transactions on Industrial Electronics, 58(7), 3101-3109.
  11. 11. Jin-Hua Hong,Cheng-Wen Wu (2003). Cellular-Array Modular Multiplier for Fast RSA Public-Key Cryptosystem Based on Modified Booth’s Algorithm. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION SYSTEMS, 11
  12. 12. C. McIvor,M. McLoone,J. McCanny Modified Montgomery modular multiplication and RSA exponentiation techniques. IEE Proceedings online No. 20040791 DOI: 10.1049/ip-cdt
  13. 13. Alexandre Tenca,C. Koc (2003). A scalable architecture for modular multiplication based on montgomery's algorithm. IEEE Transactions on Computers, 52(9), 1215-1221.
  14. 14. Marcelo Kaihara,N. Takagi (2005). A Hardware Algorithm for Modular Multiplication/ Division. IEEE TRANSACTIONS ON COMPUTERS, 54(01), 12-21.
  15. 15. C. Koç,Acar,Tolga,B. Kaliski Analyzing and comparing Montgomery multiplication algorithms. Micro, IEEE Publication, 16, 5298231.
  16. 16. Tian-Sheuan Ching-Chao Yang,Chein- Jen (1998). A New RSA Cryptosystem Hardware Design Based on Montgomery’s Algorithm. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS—II: ANALOG AND DIGITAL SIGNAL PROCESSING, 45
  17. 17. Zhimin Chen,Patrick Schaumont (2011). A Parallel Implementation of Montgomery Multiplication on Multicore Systems: Algorithm, Analysis, and Prototype. IEEE Transactions on Computers, 60(12), 1692-1703.
  18. 18. Guilherme Perin,Daniel Mesquita,JoãoBaptista Martins (2011). Montgomery Modular Multiplication on Reconfigurable Hardware: Systolic versus Multiplexed Implementation. International Journal of Reconfigurable Computing, 10.
  19. 19. A. Fournaris,O. Koufopavlou (2005). A New RSA Encryption Architecture and Hardware Implementation based on Optimized Montgomery Multiplication. May, 2005, 4645-4648.
  20. 20. L. Batina,G. Muurling (2002). Montgomery in Practice: How to Do It More Efficiently in Hardware. pp, 40-52.
  21. 21. D. Walter (2002). Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli. pp, 30-39.
  22. 22. Nemanja Perovic,Mena Popovic-Bozovic (2012). FPGA implementation of RSA cryptoalgorithm using shift and carry algorithm. 2012 20th Telecommunications Forum (TELFOR, 1040-1043.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

R. Ambika, S. Ramachandran, K. R. Kashwan. 2013. "Securing Distributed FPGA System using Commutative RSA Core". Global Journal of Research in Engineering - F: Electrical & Electronic GJRE-F Volume 13 (GJRE Volume 13 Issue 48 (F15)).

More Citation Formats

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjre

Print ISSN 0975-5861

e-ISSN 2249-4596

Keywords
Classification
GJRE-F Classification FOR Code: 090699
Version of record

v1.2

Issue date
November 12, 2013

Language
English
Order Article Reprint
Experience in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 1.6K
Total Downloads: 80
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Securing Distributed FPGA System using Commutative RSA Core

R. Ambika
R. Ambika
S. Ramachandran
S. Ramachandran
K. Kashwan
K. Kashwan