Securing Distributed FPGA System using Commutative RSA Core

1
R. Ambika
R. Ambika
2
S. Ramachandran
S. Ramachandran
3
K. R. Kashwan
K. R. Kashwan
1 BMS Institute of Technology

Send Message

To: Author

GJRE Volume 13 Issue F15

Article Fingerprint

ReserarchID

Z214G

Securing Distributed FPGA System using Commutative RSA Core Banner

AI TAKEAWAY

The objective of our study was to evaluate, in a population of Togolese People Living With HIV(PLWHIV), the agreement between three scores derived from the general population namely the Framingham score, the Systematic Coronary Risk Evaluation (SCORE), the evaluation of the cardiovascular risk (CVR) according to the World Health Organization.
  • 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

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.

Article content is being processed or not available yet.

23 Cites in Articles

References

  1. B Premkumar (1992). An RNS to binary converter in 2n+1, 2n, 2n-1 moduli set.
  2. Bruce Schneier (1996). Special Algorithms for Protocols.
  3. R Rivest,A Shamir,L Adleman (1978). A method for obtaining digital signatures and public-key cryptosystems.
  4. P Montgomery (1985). Multiplication without Trial Division.
  5. S Eldridge,C Walter (1993). Hardware Implementation of Montgomery's Multiplication Algorithm.
  6. A Elbirt,C Paar (1999). Towards an FPGA Architecture Optimized for Public-Key Algorithms.
  7. T Blum,C Paar (1999). Montgomery Exponentiation on Re-configurable Hardware.
  8. Y Kim,W Kang,J Choi Implementation of 1024-bit processor for RSA cryptosystem.
  9. V Bunimov,M Schimmler,B Tolg (2002). A Complexity-Effective Version of Montgomery's Algorithm.
  10. Gustavo Sutter,Jean-Pierre Deschamps,José Imana (2011). Modular Multiplication and Exponentiation Architectures for Fast RSA Cryptosystem Based on Digit Serial Computation.
  11. Jin-Hua Hong,Cheng-Wen Wu (2003). Cellular-Array Modular Multiplier for Fast RSA Public-Key Cryptosystem Based on Modified Booth's Algorithm.
  12. C Mcivor,M Mcloone,J Mccanny (2004). Modified Montgomery modular multiplication and RSA exponentiation techniques.
  13. Alexandre Tenca,K C¸ Etin,Koc (2003). A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm.
  14. Marcelo Kaihara,N Takagi (2005). A Hardware Algorithm for Modular Multiplication/Division.
  15. C Koç,Acar,Tolga,B Kaliski (1996). Analyzing and comparing Montgomery multiplication algorithms.
  16. Ching-Chao Yang,Tian-Sheuan Chang,Chein-Wei Jen (1998). A New RSA Cryptosystem Hardware Design Based on Montgomery's Algorithm.
  17. Zhimin Chen,Patrick Schaumont (2011). A Parallel Implementation of Montgomery Multiplication on Multicore Systems: Algorithm, Analysis, and Prototype.
  18. Daniel Guilhermeperin,Joãobaptista Mesquita,Martins (2011). Montgomery Modular Multiplication on Reconfigurable Hardware: Systolic versus Multiplexed Implementation.
  19. P Fournaris,O Koufopavlou (2005). A new RSA encryption architecture and hardware implemen-tation based on optimized Montgomery multiplication.
  20. P Montgomery (1985). Modular Multiplication without Trial Division.
  21. L Batina,G Muurling (2002). Montgomery in Practice: How to Do It More Efficiently in Hardware.
  22. D Walter (2002). Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli.
  23. Nemanja Perovic,Mena Popovic-Bozovic (2012). FPGA implementation of RSA cryptoalgorithm using shift and carry algorithm.

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.

R. Ambika. 2013. \u201cSecuring Distributed FPGA System using Commutative RSA Core\u201d. Global Journal of Research in Engineering - F: Electrical & Electronic GJRE-F Volume 13 (GJRE Volume 13 Issue F15): .

Download Citation

Issue Cover
GJRE Volume 13 Issue F15
Pg. 47- 58
Journal Specifications

Crossref Journal DOI 10.17406/gjre

Print ISSN 0975-5861

e-ISSN 2249-4596

Classification
Not Found
Version of record

v1.2

Issue date

December 31, 2013

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 4916
Total Downloads: 2618
2026 Trends
Research Identity (RIN)
Related Research
Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

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

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

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 BMS Institute of Technology
S. Ramachandran
S. Ramachandran
K. R. Kashwan
K. R. Kashwan

Research Journals