scholarly journals Data Encryption using Advanced Encryption Standard with Key Generation by Elliptic Curve Diffie-Hellman

2017 ◽  
Vol 11 (3) ◽  
pp. 17-28 ◽  
Author(s):  
Samiksha Sharma ◽  
Vinay Chopra
Keyword(s):  
Elliptic Curve ◽  
Data Encryption ◽  
Advanced Encryption Standard ◽  
Key Generation ◽  
Diffie Hellman

Architectures for Advanced Cryptographic Systems

2004 ◽  
pp. 1-63 ◽  
Author(s):  
Guido Bertoni ◽  
Jorge Guajardo ◽  
Christof Paar
Keyword(s):  
Elliptic Curve ◽  
Analytical Techniques ◽  
Basic Structure ◽  
Data Encryption ◽  
General Purpose ◽  
Advanced Encryption Standard ◽  
Secure Storage ◽  
Elliptic Curve Cryptosystems ◽  
Cryptographic Algorithms ◽  
Modern Cryptography

In the last 20-30 years, the world of modern cryptography has been largely dominated by traditional systems such as the Data Encryption Standard and the RSA algorithm. Such systems have provided a secure way for storing and transmitting information and they are nowadays incorporated in many network protocols and secure storage media. More recently, the increasing advance of crypto-analytical techniques and tools and the emergence of new applications, for example wireless communications and mobile computing, have stimulated the research and development of innovative cryptographic algorithms. These newer systems require a more detailed and sophisticated mathematical formalization and operations, which are not normally supported by general-purpose processors. For example, many basic operations required to implement recently proposed cryptographic algorithms, such as the Advanced Encryption Standard or Elliptic Curve Cryptosystems, are based on arithmetic in finite fields (or Galois fields). This chapter is, thus, intended to give an overview of such developments in modern cryptography. In particular, it aims at giving the reader a comprehensive understanding of innovative cryptosystems, their basic structure, alternative existing hardware architectures to implement them, and their performance requirements and characterizations. Emphasis will be made throughout on two important cases: the Advanced Encryption Standard and Elliptic Curve Cryptosystems.

scholarly journals Hyper-and-elliptic-curve cryptography

2014 ◽  
Vol 17 (A) ◽  
pp. 181-202 ◽  
Author(s):  
Daniel J. Bernstein ◽  
Tanja Lange
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Base Point ◽  
Scalar Multiplication ◽  
Key Generation ◽  
Diffie Hellman ◽  
Fixed Base ◽  
Shared Secret ◽  
Genus 2 ◽  
Point Scalar Multiplication

AbstractThis paper introduces ‘hyper-and-elliptic-curve cryptography’, in which a single high-security group supports fast genus-2-hyperelliptic-curve formulas for variable-base-point single-scalar multiplication (for example, Diffie–Hellman shared-secret computation) and at the same time supports fast elliptic-curve formulas for fixed-base-point scalar multiplication (for example, key generation) and multi-scalar multiplication (for example, signature verification).

scholarly journals NTTRU: Truly Fast NTRU Using NTT

2019 ◽  
pp. 180-201 ◽  
Author(s):  
Vadim Lyubashevsky ◽  
Gregor Seiler
Keyword(s):  
Elliptic Curve ◽  
The Other ◽  
Security Level ◽  
Key Generation ◽  
Large Margin ◽  
Diffie Hellman ◽  
Public Keys ◽  
Encryption Schemes ◽  
Standardization Process ◽  
Number Of Cycles

We present NTTRU – an IND-CCA2 secure NTRU-based key encapsulation scheme that uses the number theoretic transform (NTT) over the cyclotomic ring Z7681[X]/(X768−X384+1) and produces public keys and ciphertexts of approximately 1.25 KB at the 128-bit security level. The number of cycles on a Skylake CPU of our constant-time AVX2 implementation of the scheme for key generation, encapsulation and decapsulation is approximately 6.4K, 6.1K, and 7.9K, which is more than 30X, 5X, and 8X faster than these respective procedures in the NTRU schemes that were submitted to the NIST post-quantum standardization process. These running times are also, by a large margin, smaller than those for all the other schemes in the NIST process as well as the KEMs based on elliptic curve Diffie-Hellman. We additionally give a simple transformation that allows one to provably deal with small decryption errors in OW-CPA encryption schemes (such as NTRU) when using them to construct an IND-CCA2 key encapsulation.

Architectures for Advanced Cryptographic Systems

2008 ◽  
pp. 771-817
Author(s):  
Guido Bertoni ◽  
Jorge Guajardo ◽  
Christof Paar
Keyword(s):  
Elliptic Curve ◽  
Analytical Techniques ◽  
Basic Structure ◽  
Data Encryption ◽  
General Purpose ◽  
Advanced Encryption Standard ◽  
Secure Storage ◽  
Elliptic Curve Cryptosystems ◽  
Cryptographic Algorithms ◽  
Modern Cryptography

In the last 20-30 years, the world of modern cryptography has been largely dominated by traditional systems such as the Data Encryption Standard and the RSA algorithm. Such systems have provided a secure way for storing and transmitting information and they are nowadays incorporated in many network protocols and secure storage media. More recently, the increasing advance of crypto-analytical techniques and tools and the emergence of new applications, for example wireless communications and mobile computing, have stimulated the research and development of innovative cryptographic algorithms. These newer systems require a more detailed and sophisticated mathematical formalization and operations, which are not normally supported by general-purpose processors. For example, many basic operations required to implement recently proposed cryptographic algorithms, such as the Advanced Encryption Standard or Elliptic Curve Cryptosystems, are based on arithmetic in finite fields (or Galois fields). This chapter is, thus, intended to give an overview of such developments in modern cryptography. In particular, it aims at giving the reader a comprehensive understanding of innovative cryptosystems, their basic structure, alternative existing hardware architectures to implement them, and their performance requirements and characterizations. Emphasis will be made throughout on two important cases: the Advanced Encryption Standard and Elliptic Curve Cryptosystems.

scholarly journals AES Image Encryption (Advanced Encryption Standard)

2021 ◽  
Vol 9 (12) ◽  
pp. 1357-1363
Author(s):  
Paavni Gaur
Keyword(s):  
Image Encryption ◽  
Block Size ◽  
Image Data ◽  
Data Encryption ◽  
Advanced Encryption Standard ◽  
Key Generation ◽  
Secret Key ◽  
Unauthorized Access ◽  
Confidential Data ◽  
Encryption And Decryption

Abstract: An Image Encryption and Decryption Using AES (Advance Encryption Standard) Algorithm is proposed in the project. Due to increasing use of image in various field, it is very important to protect the confidential image data from unauthorized access. The design uses the iterative approach with block size of 128 bit and key size of 128, 192 or 256 bit. The numbers of round for key size of 256 bits is 14 , for 128 bits is 10 and for 192 bits is 12. As secret key increases the security as well as complexity of the cryptography algorithms. In this paper , an algorithm in which the image is an input to AES Encryption to get the encrypted image and then input it to AES Decryption to get the original image is proposed and explained which will further be implemented by me. The paper shows the study in which a system could be used for effective image data encryption and key generation in diversified application areas, where sensitive and confidential data needs to be transmitted along with the image.

scholarly journals Efficient Hybrid Cryptography Algorithm

2020 ◽  
Vol 55 (3) ◽  
Author(s):  
Mayes M. Hoobi
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Search Space ◽  
Data Encryption ◽  
Key Generation ◽  
Data Encryption Standard ◽  
Standard Algorithm ◽  
Encryption Algorithms ◽  
Brute Force Attack ◽  
Complexity Increase

Cryptography is the operation of transferring a specific message to prevent an attacker from accessing the contents of a message. To increase the level of security in any communication, both parties must have a copy of the encryption key. The Data Encryption Standard algorithm is insufficient due to its weak key generation, so that the key must be reconfigured to make this algorithm more secure, effective, and stronger. The key for encryption enhances securities of the Data Encryption Standard algorithm. This research assumed a combination of two efficient encryption algorithms to achieve the goal of information security by adding a new level of security to the Data Encryption Standard algorithm using the elliptic curve cryptography algorithm. This aim was met by adding two new key functions; the first one is EncK(), and the second one is DecK() for an encryption and decryption key of the Data Encryption Standard algorithm to make this algorithm more secure against attackers. The results obtained from this research also demonstrate good resistance against a brute-force attack, which makes the system more effective by applying the elliptic curve cryptography algorithm to encrypt and decrypt keys using the Data Encryption Standard. In addition, these modifications enhance the degree of complexity, increase key search space, and make the ciphered message more difficult for an attacker to crack.

scholarly journals Optimized CSIDH Implementation Using a 2-Torsion Point

Cryptography ◽  
2020 ◽  
Vol 4 (3) ◽  
pp. 20 ◽  
Author(s):  
Donghoe Heo ◽  
Suhri Kim ◽  
Kisoon Yoon ◽  
Young-Ho Park ◽  
Seokhie Hong
Keyword(s):  
Elliptic Curve ◽  
Group Action ◽  
Large Degree ◽  
Transitive Group ◽  
Optimization Method ◽  
Torsion Point ◽  
Torsion Points ◽  
Diffie Hellman ◽  
Odd Degree ◽  
Montgomery Curve

The implementation of isogeny-based cryptography mainly use Montgomery curves, as they offer fast elliptic curve arithmetic and isogeny computation. However, although Montgomery curves have efficient 3- and 4-isogeny formula, it becomes inefficient when recovering the coefficient of the image curve for large degree isogenies. Because the Commutative Supersingular Isogeny Diffie-Hellman (CSIDH) requires odd-degree isogenies up to at least 587, this inefficiency is the main bottleneck of using a Montgomery curve for CSIDH. In this paper, we present a new optimization method for faster CSIDH protocols entirely on Montgomery curves. To this end, we present a new parameter for CSIDH, in which the three rational two-torsion points exist. By using the proposed parameters, the CSIDH moves around the surface. The curve coefficient of the image curve can be recovered by a two-torsion point. We also proved that the CSIDH while using the proposed parameter guarantees a free and transitive group action. Additionally, we present the implementation result using our method. We demonstrated that our method is 6.4% faster than the original CSIDH. Our works show that quite higher performance of CSIDH is achieved while only using Montgomery curves.

Sign in / Sign up

Export Citation Format

Share Document