scholarly journals Hyper Elliptical Curve Cryptography (Hecc) For Cloud

2019 ◽  
Vol 8 (4) ◽  
pp. 11771-11776
Keyword(s):  
Elliptic Curve ◽  
Public Key ◽  
Secret Key ◽  
Public Key Cryptosystems ◽  
Cryptographic Algorithm ◽  
Hash Algorithm ◽  
Cryptographic Algorithms ◽  
User Friendly ◽  
Hashing Algorithm ◽  
Hyper Elliptic Curve

This system provides an insight into developing a distributed system which is secure, robust and user friendly. This thesis suggests a design and implementation of a digital envelope that combines the hashing algorithm of MD5, the symmetric key algorithm of AES and the asymmetric key algorithm of Hyper Elliptic Curve. A hybrid algorithm is designed, combining the best of both AES and ECC over GF(p) cryptography. The MD5 hash algorithm is adopted to ensure integrity of the data. Cryptography (HECC). This paper discusses securing the data in clouds through implementing the key for encryption and decryption using hyper elliptical curve cryptography. The focus is on Advanced Encryption Standard (AES), the most commonly used secret key cryptographic algorithm, and Hyper Elliptic Curve Cryptography (HECC), public key cryptographic algorithms which have gained popularity in the recent years and are replacing traditional public key cryptosystems, such as RSA and ECC. Such techniques are necessary in order to use high security cryptographic algorithms in real world applications.

Public-Key Encryption

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Elliptic Curve ◽  
Public Key Cryptography ◽  
Public Key ◽  
Public Key Encryption ◽  
Hybrid Encryption ◽  
Public Key Cryptosystems ◽  
Encryption And Decryption ◽  
Encryption Schemes ◽  
Hard Problems ◽  
Set Up

In this chapter, we introduce public-key encryption. We first consider the motivation behind the concept of public-key cryptography and introduce the hard problems on which popular public-key encryption schemes are based. We then discuss two of the best-known public-key cryptosystems, RSA and ElGamal. For each of these public-key cryptosystems, we discuss how to set up key pairs and perform basic encryption and decryption. We also identify the basis for security for each of these cryptosystems. We then compare RSA, ElGamal, and elliptic-curve variants of ElGamal from the perspectives of performance and security. Finally, we look at how public-key encryption is used in practice, focusing on the popular use of hybrid encryption.

A CUBIC EL-GAMAL ENCRYPTION SCHEME BASED ON LUCAS SEQUENCE AND ELLIPTIC CURVE

2021 ◽  
Vol 10 (11) ◽  
pp. 3439-3447
Author(s):  
T. J. Wong ◽  
L. F. Koo ◽  
F. H. Naning ◽  
A. F. N. Rasedee ◽  
M. M. Magiman ◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Mathematical Problem ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Encryption Scheme ◽  
Secret Key ◽  
Chosen Plaintext Attack ◽  
The Public ◽  
Lucas Sequence

The public key cryptosystem is fundamental in safeguard communication in cyberspace. This paper described a new cryptosystem analogous to El-Gamal encryption scheme, which utilizing the Lucas sequence and Elliptic Curve. Similar to Elliptic Curve Cryptography (ECC) and Rivest-Shamir-Adleman (RSA), the proposed cryptosystem requires a precise hard mathematical problem as the essential part of security strength. The chosen plaintext attack (CPA) was employed to investigate the security of this cryptosystem. The result shows that the system is vulnerable against the CPA when the sender decrypts a plaintext with modified public key, where the cryptanalyst able to break the security of the proposed cryptosystem by recovering the plaintext even without knowing the secret key from either the sender or receiver.

On Securing Cloud Storage Using a Homomorphic Framework

2018 ◽  
pp. 99-114
Author(s):  
Daya Sagar Gupta ◽  
G. P. Biswas
Keyword(s):  
Elliptic Curve ◽  
Cloud Storage ◽  
Homomorphic Encryption ◽  
Cloud Security ◽  
Public Key ◽  
Cloud System ◽  
Secret Message ◽  
Security Mechanism ◽  
Secret Key ◽  
Hard Problems

In this chapter, a cloud security mechanism is described in which the computation (addition) of messages securely stored on the cloud is possible. Any user encrypts the secret message using the receiver's public key and stores it. Later on, whenever the stored message is required by an authentic user, he retrieves the encrypted message and decrypts it by using his secret key. However, he can also request the cloud for an addition of encrypted messages. The cloud system only computes the requested addition and sends it to the authentic user; it cannot decrypt the stored encrypted messages on its own. This addition of encrypted messages should be the same as the encryption of the addition of original messages. In this chapter, the authors propose a homomorphic encryption technique in which the above-discussed scenario is possible. The cloud securely computes the addition of the encrypted messages which is ultimately the encryption of the addition of the original messages. The security of the proposed encryption technique depends on the hardness of elliptic curve hard problems.

A SEEP (Security Enhanced Electronic Payment) Protocol Design Using 3BC, ECC (F), and HECC Algorithm

2008 ◽  
pp. 639-653
Author(s):  
Byung Kwan Lee ◽  
Seung Hae Yang ◽  
Tai-Chi Lee
Keyword(s):  
Elliptic Curve ◽  
Data Encryption ◽  
Elliptic Curve Cryptosystem ◽  
Electronic Payment ◽  
The Public ◽  
Payment Protocol ◽  
Hash Algorithm ◽  
Set Protocol ◽  
Secure Hash Algorithm ◽  
Hyper Elliptic Curve

Unlike SET (Secure Electronic Transaction) protocol, this paper proposes a SEEP (Security Enhanced Electronic Payment) protocol, which uses ECC (Elliptic Curve Cryptosystem with F2m not Fp) (Koblitz, 1987; Harper, Menezes, & Vanstone, 1993; Miller, 1986), SHA (Secure Hash Algorithm), and 3BC (Block Byte Bit Cipher) instead of RSA and DES. To improve the strength of encryption and the speed of processing, the public key and the private key of ECC and HECC (Hyper Elliptic Curve Cryptosystem) are used in 3BC (Cho & Lee, 2002; Cho, Shin, Lee, & Lee, 2002) algorithm, which generates session keys for the data encryption. In particular, when ECC and HECC are combined with 3BC, the strength of security is improved significantly. As the process of the digital envelope used in the existing SET protocol is removed by the 3BC algorithm in this paper, the processing time is reduced substantially. In addition, the use of multiple signatures has some advantages, such as reducing the size of transmission data as an intermediate payment agent and avoiding the danger of eavesdropping of private keys.

A CUBIC EL-GAMAL ENCRYPTION SCHEME BASED ON LUCAS SEQUENCE AND ELLIPTIC CURVE

2021 ◽  
Vol 10 (11) ◽  
pp. 3439-3447
Author(s):  
T. J. Wong ◽  
L. F. Koo ◽  
F. H. Naning ◽  
A. F. N. Rasedee ◽  
M. M. Magiman ◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Mathematical Problem ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Encryption Scheme ◽  
Secret Key ◽  
Chosen Plaintext Attack ◽  
The Public ◽  
Lucas Sequence

The public key cryptosystem is fundamental in safeguard communication in cyberspace. This paper described a new cryptosystem analogous to El-Gamal encryption scheme, which utilizing the Lucas sequence and Elliptic Curve. Similar to Elliptic Curve Cryptography (ECC) and Rivest-Shamir-Adleman (RSA), the proposed cryptosystem requires a precise hard mathematical problem as the essential part of security strength. The chosen plaintext attack (CPA) was employed to investigate the security of this cryptosystem. The result shows that the system is vulnerable against the CPA when the sender decrypts a plaintext with modified public key, where the cryptanalyst able to break the security of the proposed cryptosystem by recovering the plaintext even without knowing the secret key from either the sender or receiver.

FPGA based hardware acceleration for elliptic curve public key cryptosystems

2004 ◽  
Vol 70 (3) ◽  
pp. 299-313 ◽  
Author(s):  
M. Ernst ◽  
B. Henhapl ◽  
S. Klupsch ◽  
S. Huss
Keyword(s):  
Elliptic Curve ◽  
Hardware Acceleration ◽  
Public Key ◽  
Public Key Cryptosystems

Remote Digital Signing for Mobile Commerce

2011 ◽  
pp. 263-284 ◽  
Author(s):  
Oguz Kaan Onbilger ◽  
Randy Chow ◽  
Richard Newman
Keyword(s):  
Mobile Commerce ◽  
Public Key ◽  
Battery Life ◽  
Secret Key ◽  
Agent Model ◽  
Public Key Cryptosystems ◽  
Disconnected Operation ◽  
Multi Agent ◽  
Physical Limitations ◽  
Contract Signing

Mobile agents (MAs) are a promising technology which directly address physical limitations of mobile devices such as limited battery life, intermittent and low-bandwidth connections, with their capability of providing disconnected operation. This chapter addresses the problem of digital contract signing with MAs, which is an important part of any mobile commerce activity and one special challenging case of computing with secrets remotely in public. The authors use a multi-agent model together with simple secret splitting schemes for signing with shares of a secret key carried by MAs, cooperating to accomplish a trading task. In addition to known key splitting techniques of RSA, authors introduce similar techniques for El Gamal and DSS public key cryptosystems. The objective is to achieve a simple and ubiquitous solution by using the well-known public-key cryptosystem implementations, which conform to the established standards.

scholarly journals Design of a Modular Multiplier for Public-Key Cryptography Applications Using Residue Number System and Signed-Digit Representation

2020 ◽  
Author(s):  
Mohammad Hizzani
Keyword(s):  
Public Key Cryptography ◽  
Number System ◽  
Residue Number System ◽  
Public Key ◽  
Modular Multiplication ◽  
Secret Key ◽  
Public Key Cryptosystems ◽  
Number Systems ◽  
Wide Range ◽  
Residue Number

Public-Key Cryptosystems are prone to wide range of cryptanalyses due to its property of having key pairs one of them is public. Therefore, the recommended length of these keys is extremely large (e.g. in RSA and D-H the key is at least 2048 bits long) and this leads the computation of such cryptosystems to be slower than the secret-key cryptosystems (i.e. AES and AES-family). Since, the key operation in such systems is the modular multiplication; in this research a novel design for the modular multiplication based on the Montgomery Multiplication, the Residue Number Systems for moduli of any form, and the Signed-Digit Representation is proposed. The proposed design outperforms the current designs in the literature in terms of delay with at least 28% faster for the key of 2048 bits long. Up to our knowledge, this design is the first design that utilizes Signed-Digit Representation with the Residue Number System for moduli of any form.

Sign in / Sign up

Export Citation Format

Share Document