Implementation of Elliptic Curve Cryptography in Binary Field

Susantio, D R; Muchtadi-Alamsyah, Intan

doi:10.1088/1742-6596/710/1/012022

Cited by 7 publications

(7 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In previous papers we have presented implementations of elliptic curves in Weierstrass form in a binary field: the implementation of a binary field arithmetic operation algorithm [3,4] and the implementation of the simplified Elliptic Curve Integrated Encryption Scheme (S-ECIES) in a binary field [5]. In the current paper, we present the implementation of Curve25519 in S-ECIES, thus showing that Curve25519 can also serve other purposes than key exchange.…”

Section: Introductionmentioning

confidence: 89%

Implementation of Elliptic Curve25519 in Cryptography

Muchtadi-Alamsyah¹,

Tama²

2020

Theorizing STEM Education in the 21st Century

View full text Add to dashboard Cite

Bernstein's design implementation of elliptic Curve25519 in key exchange is claimed to be highly secure and efficient. This curve is, for example, used in the key exchange scheme of TextSecure for Instant Messaging. In this paper, we present an implementation of elliptic Curve25519 in the simplified Elliptic Curve Integrated Encryption Scheme, thus showing that elliptic Curve25519 can also serve other purposes than key exchange. The curve is in Montgomery form, which makes it possible to use Montgomery ladder. Point compression, point decompression, encryption, and decryption algorithms are presented for the simplified Elliptic Curve Integrated Encryption Scheme.

show abstract

Section: Introductionmentioning

confidence: 89%

Implementation of Elliptic Curve25519 in Cryptography

Muchtadi-Alamsyah¹,

Tama²

2020

Theorizing STEM Education in the 21st Century

View full text Add to dashboard Cite

show abstract

“…Let the values of a and b be 1 & also let p be 11 for the curve F p Putting this values in equation 1, we get y 2 = x 3 +x +1 (mod 11) The set of solutions are E= {(1,10), (1,1), (3,5), (3,6), (4,2), (4,9), ( Let point P be (6,6), then the doubling operation is. = (3 * 6 2 +1)/ (2 * 6) mod 11 = (108/12) mod 11 = 9…”

Section: Proposed Methodologymentioning

confidence: 99%

“…The encryption of text by Elliptic Curve Integrated Encryption Scheme was proposed by D R Susantio et al [6]. For the various IoT applications, Elliptic Curve Cryptography provides better security.…”

Section: Correlated Workmentioning

confidence: 99%

An Optimal Multilevel Encryption Technique for Securing the Data Transmission in IoT

Roy,

Das,

Das

2020

IJEAT

View full text Add to dashboard Cite

Abstract: Internet of Things(IoT) is playing a pivotal role in our daily life as well as in various fields like Health, agriculture, industries etc. In the go, the data in the various IoT applications will be easily available to the physical dominion and thus the process of ensuringthe security of the data will be a major concern. For the extensive implementation of the numerous applications of IoT , the data security is a critical component. In our work, we have developed an encryption technique to secure the data of IoT. With the help of Merkle-Hellman encryption the data collected from the various IoT devices are first of all encrypted and then the secret message is generated with the help of Elliptic Curve Cryptography.

show abstract

“…ECC is used to provide a key exchange, encryption and digital signature, based on the difficulty of an underlying mathematical problem such as the discrete logarithm problem (DLP) in a group defined by points on an elliptic curve over a finite field [11]. ECC remains the strongest public-key cryptosystem known with an addition rule enabling encryption and decryption [1,51]. It uses a small key size, and it is a replacement to Rivest, Shamir, Adleman (RSA) protocols [3] The elliptic curve cryptography is performed over two finite fields: (1) Prime field (F p ) and (2) Binary field F(2 m ) .…”

Section: Why Ecc Over Binary Field?mentioning

confidence: 99%

An Identity-Based Elliptic Curve Cryptography for Mobile Payment Security

et al. 2020

View full text Add to dashboard Cite

Security breaches have been observed in different dimensions in mobile payment system. The violation of user's privacy is a common phenomenon in mobile payment transactions. This study presents an improved security scheme for a mobile payment system using elliptic curve cryptography over a binary field with International Mobile Equipment Identity to ensure higher security. The scheme uses a payment gateway for registration and maps all input text to elliptic curve points using ASCII values. Payment details are stored on the gateway, which is encrypted but decrypted only with merchant's decryption key. The proposed scheme was evaluated in terms of key size, security strength, computational power, memory capacity, encryption and decryption time and mobile phone battery. The result shows that the scheme provides integrity, confidentiality and privacy. The result also shows that the proposed scheme is time-efficient and computationally inexpensive for resourceconstrained environment like mobile payment system.

show abstract

Implementation of Elliptic Curve Cryptography in Binary Field

Cited by 7 publications

References 2 publications

Implementation of Elliptic Curve25519 in Cryptography

Implementation of Elliptic Curve25519 in Cryptography

An Optimal Multilevel Encryption Technique for Securing the Data Transmission in IoT

An Identity-Based Elliptic Curve Cryptography for Mobile Payment Security

Contact Info

Product

Resources

About