New DES based on elliptic curves

2012

This paper gives brief idea of the working of this Algorithm. Here we have taken one example to show the step by step procedure followed during DES implementation. During implementation we come across much complexity which was solved by proper tricks and practice. This paper is an effort to show the DES by implementing it over one plaintext and analyzing its pros and corns with its historic importance.

International Journal of Computer Applications, 2018

The purpose of this research is to enhance the cryptographic system called the Elliptic Curve. Elliptic Curve cryptosystem (ECC) is a technique of public-key encryption, which is rooted on the arithmetical construction of elliptic curves over finite fields. Elliptic Curve Cryptographic System necessitates smaller keys compared to non-ECC cryptography to offer equal security. The security of RSA is based on the computational task of considering extensive numbers leading to an increase in encryption computation time, slower connection of the SSL handshake and increase in CPU usage during handshakes. Therefore, there should be a new way of solving this problem, which is ECC encryption. Elliptic curves are effective for digital signatures, key agreement, generators, pseudo-random and other related tasks. The first phase of the project involves understanding the key exchange of Diffie-Hellman and applying the properties of the Elliptic Curves. It is terminated with key facts that the Elliptic Curve Cryptography has a shorter key length, saves bandwidth, which facilitates key generation during the encryption/decryption of data, also the assurance of faster encryption and decryption, and notwithstanding its efficiency and efficacy in small devices.

Elliptic Curve Cryptography (ECC) can be used as a tool for encrypting data, creating digital signatures or performing key exchanges. Regarding the encryption procedure, the schemes currently used are known as hybrid cryptosystems, as they use both symmetric and asymmetric techniques. Among those hybrid cryptosystems based on ECC, the Elliptic Curve Integrated Encryption Scheme (ECIES) is the best known, and as such it can be found in several cryptographic standards. In this work, we present an extensive review and comparison of the versions of ECIES included in documents from ANSI, IEEE, ISO/IEC, and SECG, highlighting the main differences between them that may prevent fully interoperable implementations of ECIES. In addition, a detailed list of the functions and capabilities needed by ECIES and available in Java Card is presented, which allows to provide some conclusions about the practical limitations of a Java Card implementation of ECIES.

International Journal of Electrical and Computer Engineering (IJECE), 2024

The elliptic curve cryptosystem (ECC) has several applications in Information Security, especially in cryptography with two main activities including encrypting and decrypting. There were several solutions of different research teams which propose various forms of the elliptic curve cryptosystem on cryptographic sector. In the paper, we proposed a solution for applying the elliptic curve on cryptography which is based on these proposals as well as basic idea about the elliptic curve cryptosystem. We also make comparison between our proposal and other listed solution in the same application of the elliptic curve for designing encryption and decryption algorithms. The comparison results are based on parameters such as time consumption (t), RAM consumption (MB), source code size (Bytes), and computational complexity.

Elliptic Curve Cryptography (ECC) is a relatively recent branch of cryptography based on the arithmetic of elliptic curves and the Elliptic Curve Discrete Logarithm Problem (ECDLP). Elliptic curve cryptographic schemes are public-key mechanisms that provide encryption, digital signature and key exchange capabilities. The best known encryption scheme based on ECC is the Elliptic Curve Integrated Encryption Scheme (ECIES), included in the ANSI X9.63, ISO/IEC 18033-2, IEEE 1363a, and SECG SEC 1 standards. In the present work, we offer a comprehensive introduction to ECIES, detailing the encryption and decryption procedures and the list of functions and special characteristics included in aforementioned standards.

Aug. 8-9, 2017 Singapore Back RTET-17, CFBHS-17, IECMAE-17, AESTWM-17, LHHSS-17 & LEBCSR-17, 2017

Security remains a major "pain" for both individuals and large organizations in today's modern world. Everything needs security, whether it is communication through telephonic media, or transfer of data files. The security or privacy can only be ensured by applying algorithms to the data defined under Cryptography. Encryption, a mechanism which changes the plaintext to a secured form defined as scrambled text(cipher). The scrambled text, then is received and decryption is done to analyze the plaintext. This involves various types such as: symmetric or asymmetric encryption. This paper brings in an improved and optimized version of 3DES algorithm. It also lists various advantages of the new algorithm over DES and Triple-DES algorithm. A brief in between DES, Triple-DES and the newly designed algorithm (Optimized DES Algorithm) is provided taking amount of complexity, user effort required, key size and number of rounds to perform successful conversion operations as base for comparison.

2013

Elliptic curve cryptography is an asymmetric key cryptography. The points on two dimensional elliptic curve are used for declaration of data encryption & decryption. It include public key generation on the elliptic curve and private key generation to decrypt the data. The present paper deals with an overview of Elliptic curve cryptography (ECC) and its implementation through coordinate geometry for data encryption. We introduce a new approach in the form of cardan's method to find points on X axis at elliptic curve over finite field and form public key cryptographic system and finally we define two dimensional alphabetic table and description in the form of algorithm to use it for plain text encryption.

Journal of Advances in Mathematics and Computer Science

The security of data encrypted with an encryption algorithm should be guaranteed such that it is never easy for a third party to recover the message from the encrypted data. To this effect, ECC has been a reliable option. However, the base equation that defines the security of Elliptic Curve Cryptography (ECC) is in the form of a linear equation with one unknown which is easy to solve. The ease with which this equation can be solved is a weak point in the algorithm. Thus, the aim of this research work is to improve the security of ECC by improving the nature of its base linear equation. Elliptic curve arithmetic was used to develop the improved model. The encryption process was specifically targeted and improved from single to double encryption using separate encryption constant for each round of encryption. Simulation was done using a 256 bits key size on selected number of character inputs. Java programming language was used to simulate the model on Net Beans IDE. Results of the r...

Emerging Trends in Engineering and Management

Now a days, as more and more information is communicated via computers, the need is to ensure that this information is secure and information can be secured by the means of encryption algorithms. Securing information refers to the methodologies that are implemented to protect sensitive information from misuse or disclosure as it causes risk. Encryption is the process of conglomerating or scrambling a message so that only the intended recipient can read it. With the fast progression of digital data exchange in electronic way, Information security is becoming much more important in data storage and transmission. With the evolution of human intelligence, the art of cryptography has become more complex in order to make information more secure. Various encryption algorithms are deployed to make information more secure. In this paper, a survey of RSA, DES and AES encryption algorithms are presented.

International Journal of Electrical and Computer Engineering (IJECE), 2011

The paper presents an extensive and careful study of elliptic curve cryptography (ECC) and its applications. This paper also discuss the arithmetic involved in elliptic curve and how these curve operations is crucial in determining the performance of cryptographic systems. It also presents different forms of elliptic curve in various coordinate system , specifying which is most widely used and why. It also explains how isogenenies between elliptic curve provides the secure ECC. Exentended form of elliptic curve i.e hyperelliptic curve has been presented here with its pros and cons. Performance of ECC and HEC is also discussed based on scalar multiplication and DLP.