Implementing Network Security Protocols based on Elliptic Curve Cryptography (original) (raw)
Related papers
Implementing Network Security Protocols based on Elliptic CurveCryptog y
1999
Elliptic curve cryptography provides a methodology for obtaining high-speed, efficient, and scalable implementations of network security protocols. In this paper, we describe in detail three protocols based on elliptic curve cryptographic techniques, and the results of our implementation of the elliptic curve cryptography over the Galois field GF (2 k), where k is a composite number.
IJERT-An Implementation Of Elliptic Curve Cryptography
International Journal of Engineering Research and Technology (IJERT), 2013
https://www.ijert.org/an-implementation-of-elliptic-curve-cryptography https://www.ijert.org/research/an-implementation-of-elliptic-curve-cryptography-IJERTV2IS1419.pdf The internet is slowly becoming an increasingly dangerous mode of communication for all forms of highly sensitive data. The increased dependency by individuals, institutions and corporations over the Internet to carry out critical business processes have provided a playing field for the intruders to carry out different attacks on the system and on the network. The security to critically confidential information such as personal identity information, credit card details, online transactions and e-commerce is the need of the hour which depends on top of cryptography. It is thought that RSA is a very secure cryptography algorithm and almost all software products provide advanced data encryption are designed over it. The bit length for RSA has increased over the years to make the encryption very tough, which increases the processing time and storage requirement is the real concern for today. The objective of this paper is to propose an alternative algorithm for cryptography based on mathematical objects known as elliptic curves. The proposed algorithms provide a better security with shorter bit length than RSA. Hence elliptic curve cryptography is the only solution today where better security can be achieved with a smaller key size thereby reducing the processing overhead.
Elliptic Curve Cryptography and Security Protocol
GIS SCIENCE
Algebraic curves over binary and finite fields used in the design of public key cryptography. This paper discusses some topics in algebraic curve cryptography namely elliptic curve cryptography with recent developments and different algorithms in Elliptic curve cryptography and also discussed discrete logarithmic problem and security protocol.
V International Enformatika …, 2005
In this paper the authors propose a protocol, which uses Elliptic Curve Cryptography (ECC) based on the ElGamal's algorithm, for sending small amounts of data via an authentication server. The innovation of this approach is that there is no need for a symmetric algorithm or a safe communication channel such as SSL. The reason that ECC has been chosen instead of RSA is that it provides a methodology for obtaining high-speed implementations of authentication protocols and encrypted mail techniques while using fewer bits for the keys. This means that ECC systems require smaller chip size and less power consumption. The proposed protocol has been implemented in Java to analyse its features and vulnerabilities in the real world.
On Assurance of Information Security using Elliptic Curves Cryptosystems
Journal of Internet Technology and Secured Transaction, 2012
We present in this paper an important area of information security emerged in the last decades, namely Elliptic Curves Cryptosystems (ECC). Compared to traditional public-key cryptosystems like RSA or Diffie-Hellman, ECC offers equivalent security with smaller key sizes; these result in faster computations, lower power consumption, as well as memory and bandwidth savings. ECC are more and more considered as an attractive public-key cryptosystem for mobile/wireless environments. ECC are especially useful for mobile devices, which are typically limited in terms of their CPU, power and network connectivity. ECC are the next frontier in the use of security mechanisms by providing good security margins with lower computational cost. ECC's domain is an important field emerged in information security. The elliptic curves (EC) are used for conceiving efficient factorization algorithms and for proving the primality. They are used in public key cryptosystems and in pseudorandom bit generators, too. The elliptic curves were also applied in Codes Theory, where they were used to create very good error protected codes. In this paper, our aim is to examine the security, implementation and performance of ECC applications on various mobile devices. Also, our goal is to compare ECC and conventional PKC performances. Doing these, we want to prove that ECC could become the next-generation of PKC.
ELLIPTIC CURVE BASED SECURE MESSAGING SYSTEM
In this paper, an implementation of a secure messaging system based on Elliptic Curve Cryptography (ECC) is presented. Elliptic curve cryptography provides a methodology for obtaining high-speed, efficient, and scalable implementations of a messaging system. In this paper, we describe in detail the working and implementation of elliptic curve cryptographic techniques, and the results of our implementation of the elliptic curve cryptography and finally we will compare our results with the rival of ECC i.e., RSA [2]. Elliptic Curve cryptography is an emerging public key cryptosystem which provides the same degree of security as systems used in Secure Socket Layers (SSL) today with approximately one-eighth the key size [4]. This results in bandwidth savings, efficient implementation and compactness in silicon without any effect on security as compared to its rival, RSA [2]. We have used ECC for key exchange and Advance Encryption Standard (AES) for encryption. The implementation of ECC is based on polynomial representation of National Institute of Standards and Technology (NIST) approved curves over binary field. The system is developed using a host of available tools and libraries, meeting the prime requirements of ease of use. The developed system can easily be adapted to meet the need of any organization. With such attributes, the technology becomes especially useful for mobile devices and other small devices that are limited in the power, CPU performance, memory or bandwidth.
Application of Elliptic Curves Cryptography In Wireless Communications Security
JOURNAL OF APPLIED …, 2006
This paper provides an overview of elliptic curves and their use in cryptography. The focus of the paper is on the performance advantages obtained in the wireless environments by using elliptic curve cryptography instead of traditional cryptosystems such as RSA. Specific applications to secure messaging and identity-based encryption are also discussed.
A Detailed Study of Elliptic Curve Cryptography Algorithm and Its Performance.
International Journal of Engineering Sciences & Research Technology, 2013
In this paper, we propose a detailed study of Elliptic Curve Cryptography Algorithm and its performance..ECC can be used with fewer keys to give more security, high speed in a less bandwidth. While these advantages make ECC propose for mobile devices, they can provide computational burden on secure web servers. In resource constrained system, Elliptic Curve Cryptography is a promising alternative for public algorithms, because it provides similar level of security with proposed shorter keys than conventional integer based public key algorithm. ECC over binary field is taken up with special interest because the operation in binary filed operation, are thought to be more in space and efficient in time. However, the software implementation of ECC over binary field are still slow, especially on low end processors, which are used in small computing devices such as sensors node, mobile phone, etc. This proposed paper, studied the Cryptography algorithms and software implementation of ECC. Firstly, while implementing ECC with software, the choice of some architectural parameters like word size may affect the choice of algorithms or not, has been examined. Also, identification of software for low-end processors has been done. In addition, this paper has examined several implements to the instruction that architecture of an 8 bit processor and studied their impact on the performance of ECC with other algorithms. ECC is well is well suited for high speeds, lower power consumption, bandwidth savings, storage efficiencies, smaller certificates and it reduces computational time and also the amount of data transmitted and stored, and strong security for low-power devices in wireless networks.
IMPLEMENTATION OF ELLIPTIC - CURVE CRYPTOGRAPHY
IAEME Publication, 2020
Elliptic curve cryptography (ECC) is a procedure to generate public key between two distant partners namely, Alice and Bob used in public key cryptography. This method is based on the algebraic structure of elliptic curves over finite fields. ECC is important in the sense that it involve keys of smaller length in comparison to other non-Elliptic curve cryptography to provide equivalent security. During this work, we implement an algorithm in python programming language to generate public key using the method of ECC.
Elliptic Curve Cryptography using Authenticated Encryption
Asymmetric encryption is used by many applications to provide secure communication between two parties. Asymmetric encryption uses more memory and require more computation. Elliptic Curve Cryptography (ECC) is an asymmetric cryptographic technique that is widely in use on small computational devices because it has the effect of using a strong cryptographic mechanism to generate small keys. ECC is used in a variety of devices, like sensors, Internet of Things (IoT), etc., [3], to reduce power consumption and improve device performance. ECC is strong to implement for the secure communication, if the information is encoded on an Elliptic curve. Equally important is ensuring that ECC maps the message on to the elliptic curve which can be used for encryption. The goal of this work is to provide authenticated encryption for encoding message and map the message on to the curve.