A Comparative and Overview Analysis of Elliptic Curve Cryptography Over Finite Fields

被引：1
|
作者：
Prabu, M. [1 ]
Shanmugalakshmi, R. [2 ]
机构：
[1] Anna Univ Coimbatore, Coimbatore, Tamil Nadu, India
[2] Govt Coll Technol, Dept CSE, Coimbatore, Tamil Nadu, India
来源：
2009 INTERNATIONAL CONFERENCE ON INFORMATION AND MULTIMEDIA TECHNOLOGY, PROCEEDINGS | 2009年
关键词：
ECC; cryptographic algorithms; high security; h speed; low bandwidth;
D O I：
10.1109/ICIMT.2009.66
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Recently, Finite Fields are the most important security mathematical function in the area of elliptic curve cryptography. In this paper, we classify the finite fields into a prime field and a binary field. The proposed approach offers solution to solve the real time implementation based on the finite fields. One such important property is point doubling that has not been focused previously. Finite fields are used to implement the process in a secure way. It is tedious work for the hackers to hack the function, which is based on elliptic curves over finite fields. Therefore, it is more efficient in Elliptic curves and performance and give a one example for application on EC signature. Finally, an serious discussion about the comparison between ECC and other cryptography algorithm is attempted to shape this article.
引用
收藏
页码：495 / +
页数：3
相关论文
共 50 条
  • [1] Construction of an elliptic curve over finite fields to combine with convolutional code for cryptography
    Ontiveros, B.
    Soto, I.
    Carrasco, R.
    [J]. IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 2006, 153 (04): : 299 - 306
  • [2] Software implementation of elliptic curve cryptography over binary fields
    Hankerson, D
    Hernandez, JL
    Menezes, A
    [J]. CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS-CHES 2000, PROCEEDINGS, 2001, 1965 : 1 - 24
  • [3] A performance evaluation of ARM ISA extension for elliptic curve cryptography over binary finite fields
    Bartolini, S
    Branovic, I
    Giorgi, R
    Martinelli, E
    [J]. 16TH SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING, PROCEEDINGS, 2004, : 238 - 245
  • [4] COMPARATIVE ANALYSIS OF ELLIPTIC CURVE AND LATTICE BASED CRYPTOGRAPHY
    Davenport, Amanda
    Shetty, Sachin
    [J]. PROCEEDINGS OF THE 2021 ANNUAL MODELING AND SIMULATION CONFERENCE (ANNSIM'21), 2020,
  • [5] An evolutionary approach to the design of cellular automata architecture for multiplication in elliptic curve cryptography over finite fields
    Jeon, JC
    Yoo, KY
    [J]. PRICAI 2004: TRENDS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 3157 : 241 - 250
  • [6] Overview of Scalar Multiplication in Elliptic Curve Cryptography
    Li, Ye
    Feng, Liu
    [J]. 2011 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT), VOLS 1-4, 2012, : 2670 - 2673
  • [7] Flexible Hardware Processor for Elliptic Curve Cryptography Over NIST Prime Fields
    Ananyi, Kendall
    Alrimeih, Hamad
    Rakhmatov, Daler
    [J]. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2009, 17 (08) : 1099 - 1112
  • [8] High Performance FPGA Implementation of Elliptic Curve Cryptography over Binary Fields
    Liu, Shuai
    Ju, Lei
    Cai, Xiaojun
    Jia, Zhiping
    Zhang, Zhiyong
    [J]. 2014 IEEE 13TH INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (TRUSTCOM), 2014, : 148 - 155
  • [9] Implementation of Pollard Rho Attack on Elliptic Curve Cryptography over Binary Fields
    Wienardo
    Yuliawan, Fajar
    Muchtadi-Alamsyah, Intan
    Rahardjo, Budi
    [J]. 5TH INTERNATIONAL CONFERENCE ON MATHEMATICS AND NATURAL SCIENCES (ICMNS 2014), 2015, 1677
  • [10] The Frequency of Elliptic Curve Groups over Prime Finite Fields
    Chandee, Vorrapan
    David, Chantal
    Koukoulopoulos, Dimitris
    Smith, Ethan
    [J]. CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 2016, 68 (04): : 721 - 761
12345