Area Optimized Low Latency Karatsuba Ofman Multiplier Variant for Embedded ECC

α
Sunil Devidas Bobade
Sunil Devidas Bobade
σ
Dr.Vijay R. Mankar
Dr.Vijay R. Mankar
α Sant Gadge Baba Amravati University

Send Message

To: Author

Area Optimized Low Latency Karatsuba Ofman Multiplier Variant for Embedded ECC

Article Fingerprint

ReserarchID

A96OM

Area Optimized Low Latency Karatsuba Ofman Multiplier Variant for Embedded ECC Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • 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

Abstract

Due to resource constrains, implementation of secure protocols for securing embedded systems has become a challenging task. System designers are advised to design and install area efficient versions of existing, proven security protocols. System designers are finding ways and means to compress existing security protocols without compromising security and without tampering with basic security structure of algorithm. Modular multiplication, point multiplication, point doubling are few critical activities to be carried out in ECC algorithm. By optimizing Modular Multiplier, area efficiency in ECC algorithm can be achieved. In this paper, we propose Area optimized and low latency multiplier that implements the efficient KOA algorithm in altogether novel style to be used in ECC architecture. The proposed algorithm uses a novel technique of splitting input operands based on exponent’s parity and it eventually helps in reducing FPGA footprint and offers low latency by avoiding overlapping, prime concern for any embedded system. The complete modular multiplier and the crypto processor module is synthesized and simulated using Xilinx ISE Design suite 14.4 software. We have investigated area occupancy of proposed multiplier and crypto processor and concluded that proposed scheme occupies relatively reduced percentage area of FPGA as compared to the one using traditional KOA multiplier.

References

8 Cites in Article
  1. Hossein Mahdizadeh,Massoud Masoumi (2013). Novel architecture for efficient FPGA implementation of elliptic curve cryptographic processor over GF(2 163 ).
  2. Sunil Devidas,Bobade Dr,R Vijay,Mankar (2015). Low footprint Hybrid Finite field multiplier for Embedded cryptography.
  3. Roy Rebeiro,C Mukhopadhyay,D (2013). Theoretical modeling of elliptic curve scalar multiplier on LUT-based FPGAs for area and speed.
  4. Jarvinen Azarderakhsh,M Mozaffari-Kermani (2014). Efficient algorithm and architecture for elliptic curve cryptography for extremely constrained secure applications.
  5. Kazuo Sakiyama,Miroslav Knežević,Junfeng Fan,Bart Preneel,Ingrid Verbauwhede (2011). Tripartite modular multiplication.
  6. Roy Rebeiro,C Mukhopadhyay (2013). Theoretical modeling of elliptic curve scalar multiplier on LUT-based FPGAs for area and speed.
  7. R Azarderakhsh,K Karabina (2013). A New Double Point Multiplication Algorithm and its Application to Binary Elliptic Curves with Endomorphisms.
  8. A Kaleel Rahuman,G Athisha (2013). Reconfigurable Architecture for Elliptic Curve Cryptography Using FPGA.

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

Sunil Devidas Bobade. 2015. \u201cArea Optimized Low Latency Karatsuba Ofman Multiplier Variant for Embedded ECC\u201d. Global Journal of Research in Engineering - J: General Engineering GJRE-J Volume 15 (GJRE Volume 15 Issue J3): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjre

Print ISSN 0975-5861

e-ISSN 2249-4596

Keywords
Classification
GJRE-J Classification: FOR Code: 291899
Version of record

v1.2

Issue date

May 8, 2015

Language
en
Experiance 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: 4317
Total Downloads: 2185
2026 Trends
Related Research

Published Article

Due to resource constrains, implementation of secure protocols for securing embedded systems has become a challenging task. System designers are advised to design and install area efficient versions of existing, proven security protocols. System designers are finding ways and means to compress existing security protocols without compromising security and without tampering with basic security structure of algorithm. Modular multiplication, point multiplication, point doubling are few critical activities to be carried out in ECC algorithm. By optimizing Modular Multiplier, area efficiency in ECC algorithm can be achieved. In this paper, we propose Area optimized and low latency multiplier that implements the efficient KOA algorithm in altogether novel style to be used in ECC architecture. The proposed algorithm uses a novel technique of splitting input operands based on exponent’s parity and it eventually helps in reducing FPGA footprint and offers low latency by avoiding overlapping, prime concern for any embedded system. The complete modular multiplier and the crypto processor module is synthesized and simulated using Xilinx ISE Design suite 14.4 software. We have investigated area occupancy of proposed multiplier and crypto processor and concluded that proposed scheme occupies relatively reduced percentage area of FPGA as compared to the one using traditional KOA multiplier.

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]

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.

Area Optimized Low Latency Karatsuba Ofman Multiplier Variant for Embedded ECC

Sunil Devidas Bobade
Sunil Devidas Bobade Sant Gadge Baba Amravati University
Dr.Vijay R. Mankar
Dr.Vijay R. Mankar

Research Journals