Public-Key Cryptographic Algorithms

2012 ◽  
pp. 205-240
Keyword(s):  
Public Key ◽  
Cryptographic Algorithms

scholarly journals Survey on Asymmetric Key Cryptographic Algorithms

2020 ◽  
pp. 404-408
Author(s):  
Sabitha S ◽  
Binitha V Nair
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
The Public ◽  
Private Key ◽  
Design And Implementation ◽  
Diffie Hellman ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

Cryptography is an essential and effective method for securing information’s and data. Several symmetric and asymmetric key cryptographic algorithms are used for securing the data. Symmetric key cryptography uses the same key for both encryption and decryption. Asymmetric Key Cryptography also known as public key cryptography uses two different keys – a public key and a private key. The public key is used for encryption and the private key is used for decryption. In this paper, certain asymmetric key algorithms such as RSA, Rabin, Diffie-Hellman, ElGamal and Elliptical curve cryptosystem, their security aspects and the processes involved in design and implementation of these algorithms are examined.

scholarly journals Analisis dan Implementasi Algoritma Asimetris Dual Modulus RSA (DM-RSA) pada Aplikasi Chat

2021 ◽  
Vol 5 (4) ◽  
pp. 768-773
Author(s):  
Aminudin ◽  
Ilyas Nuryasin
Keyword(s):  
Prime Numbers ◽  
Public Key ◽  
Generation Process ◽  
Key Generation ◽  
The Public ◽  
Asymmetric Model ◽  
Rsa Algorithm ◽  
Private Key ◽  
Public Keys ◽  
Cryptographic Algorithms

The RSA algorithm is one of the cryptographic algorithms with an asymmetric model where the algorithm has two keys, namely the public key and the private key. However, as time goes on, these algorithms are increasingly exposed to security holes and make this algorithm vulnerable to being hacked by people who do not have authority. The vulnerability stems from the algorithm's public keys (e and n). The strength of the RSA algorithm is based on the difficulty of factoring two prime numbers that are generated during the key generation process, if these values ​​can be known using certain methods, the public key and private key values ​​will be found. Therefore, there are many studies that improvise the RSA algorithm, one of which is the Dual Modulus RSA (DM-RSA) algorithm. The algorithm uses four prime numbers which produce 2 modulus and 4 keys (2 public keys and 2 private keys). From the results of the Kraitchik factorization test, it was found that the DM-RSA algorithm was proven to be more resistant up to 2 times or even more than the standard RSA algorithm. This is evidenced by the fact that the value of n is 24 bits, the RSA algorithm can last up to 63204 ms (1 minute 22 seconds) while the Dual Modulus RSA algorithm lasts up to 248494123 ms (142 minutes 47 seconds).  

scholarly journals Cryptanalysis of Compact-LWE and Related Lightweight Public Key Encryption

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Dianyan Xiao ◽  
Yang Yu
Keyword(s):  
Quantum Computing ◽  
Privacy Protection ◽  
Essential Role ◽  
Public Key Cryptography ◽  
Security And Privacy ◽  
Public Key ◽  
Public Key Encryption ◽  
Worst Case ◽  
Cryptographic Algorithms ◽  
Iot Devices

In the emerging Internet of Things (IoT), lightweight public key cryptography plays an essential role in security and privacy protection. With the approach of quantum computing era, it is important to design and evaluate lightweight quantum-resistant cryptographic algorithms applicable to IoT. LWE-based cryptography is a widely used and well-studied family of postquantum cryptographic constructions whose hardness is based on worst-case lattice problems. To make LWE friendly to resource-constrained IoT devices, a variant of LWE, named Compact-LWE, was proposed and used to design lightweight cryptographic schemes. In this paper, we study the so-called Compact-LWE problem and clarify that under certain parameter settings it can be solved in polynomial time. As a consequence, our result leads to a practical attack against an instantiated scheme based on Compact-LWE proposed by Liu et al. in 2017.

scholarly journals A Practical Analysis of the Fermat Factorization and Pollard Rho Method for Factoring Integers

2021 ◽  
Vol 12 (1) ◽  
pp. 33
Author(s):  
Aminudin Aminudin ◽  
Eko Budi Cahyono
Keyword(s):  
Prime Factor ◽  
Average Duration ◽  
Public Key Cryptography ◽  
Public Key ◽  
Public And Private ◽  
The Public ◽  
Factorization Algorithm ◽  
Cryptographic Algorithms ◽  
Prime Factors ◽  
Practical Analysis

The development of public-key cryptography generation using the factoring method is very important in practical cryptography applications. In cryptographic applications, the urgency of factoring is very risky because factoring can crack public and private keys, even though the strength in cryptographic algorithms is determined mainly by the key strength generated by the algorithm. However, solving the composite number to find the prime factors is still very rarely done. Therefore, this study will compare the Fermat factorization algorithm and Pollard rho by finding the key generator public key algorithm's prime factor value.  Based on the series of test and analysis factoring integer algorithm using Fermat's Factorization and Pollards' Rho methods, it could be concluded that both methods could be used to factorize the public key which specifically aimed to identify the prime factors. During the public key factorizing process within 16 bytes – 64 bytes, Pollards' Rho's average duration was significantly faster than Fermat's Factorization.

scholarly journals Towards security recommendations for public-key infrastructures for production environments in the post-quantum era

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Sergey E. Yunakovsky ◽  
Maxim Kot ◽  
Nikolay Pozhar ◽  
Denis Nabokov ◽  
Mikhail Kudinov ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Public Key Cryptography ◽  
Public Key ◽  
Quantum Computers ◽  
Security Systems ◽  
Security Issues ◽  
Production Environments ◽  
Cryptographic Algorithms ◽  
Primary Focus ◽  
The Impact

AbstractQuantum computing technologies pose a significant threat to the currently employed public-key cryptography protocols. In this paper, we discuss the impact of the quantum threat on public key infrastructures (PKIs), which are used as a part of security systems for protecting production environments. We analyze security issues of existing models with a focus on requirements for a fast transition to post-quantum solutions. Although our primary focus is on the attacks with quantum computing, we also discuss some security issues that are not directly related to the used cryptographic algorithms but are essential for the overall security of the PKI. We attempt to provide a set of security recommendations regarding the PKI from the viewpoints of attacks with quantum computers.

Comparative Study of Cryptographic Algorithms

2019 ◽  
Vol 8 (1) ◽  
pp. 13-22
Author(s):  
Mohanad ABDULHAMID ◽  
Nyagathu GICHUKI
Keyword(s):  
Comparative Study ◽  
Data Encryption ◽  
The Other ◽  
Public Key ◽  
Data Encryption Standard ◽  
Private Key ◽  
Other Hand ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms

This paper presents a comparative study of two cryptosystems, Data Encryption Standard (DES) and the Rivest-Shamir-Adleman (RSA) schemes. DES is a symmetric (or private) key cipher. This means that the same key is used for encryption and decryption. RSA, on the other hand, is an asymmetric (or public) key cipher, meaning that two keys are used, one for encryption and the other for decryption. The objective of this paper is to implement these two schemes in software. The program is written in the Java™ language. It generates a key from a passphrase given by the user, encrypts and decrypts a message using the same key, for the case of DES. In RSA, decryption is done by computing the decryption key from the encryption key. Finally, the program returns the time taken to encrypt and decrypt a message.

Multi-layer and Clustering based Security Implementation for an IoT Environment

2022 ◽  
Vol 11 (2) ◽  
pp. 0-0
Keyword(s):  
Information Transmission ◽  
Sensor Node ◽  
Mutual Authentication ◽  
Public Key ◽  
Sink Node ◽  
The Public ◽  
Sensor Devices ◽  
Cryptographic Algorithms ◽  
Encryption Decryption ◽  
Iot Devices

IoT devices are having many constraints related to computation power and memory etc. Many existing cryptographic algorithms of security could not work with IoT devices because of these constraints. Since the sensors are used in large amount to collect the relevant data in an IoT environment, and different sensor devices transmit these data as useful information, the first thing needs to be secure is the identity of devices. The second most important thing is the reliable information transmission between a sensor node and a sink node. While designing the cryptographic method in the IoT environment, programmers need to keep in mind the power limitation of the constraint devices. Mutual authentication between devices and encryption-decryption of messages need some sort of secure key. In the proposed cryptographic environment, there will be a hierarchical clustering, and devices will get registered by the authentication center at the time they enter the cluster. The devices will get mutually authenticated before initiating any conversation and will have to follow the public key protocol.

On a class of strongly asymmetric PKA algorithms

2015 ◽  
Vol 9 (3) ◽  
Author(s):  
Luigi Accardi ◽  
Massimo Regoli
Keyword(s):  
Matrix Model ◽  
Key Agreement ◽  
Key Exchange ◽  
Public Key ◽  
Discrete Logarithms ◽  
Essential Ingredient ◽  
Cryptographic Algorithms ◽  
Exchange Algorithms ◽  
The Matrix

AbstractIn the papers [New features for public key exchange algorithms, in: 18-th International ICWG Meeting (Krakow 2011)], [Strongly asymmetric PKD cryptographic algorithms: An implementation using the matrix model, in: Proceedings ISEC Conference (Shizuoka 2011)] a new scheme to produce public key agreement (PKA) algorithms was proposed and some examples based on polynomials (toy models) were discussed. In the present paper we introduce a non-commutative realization of the above mentioned scheme and prove that non-commutativity can be an essential ingredient of security in the sense that, in the class of algorithms constructed, under some commutativity assumptions on the matrices involved, we can find a breaking strategy, but dropping these assumptions we can not, even if we assume, as we do in all the attacks discussed in the present paper, that discrete logarithms have zero cost.

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 Cryptography

2005 ◽  
pp. 2368-2372
Author(s):  
Eberhard Stickel
Keyword(s):  
Private Information ◽  
Public Key Cryptography ◽  
Public Key ◽  
Crucial Issue ◽  
Message Transmission ◽  
Cryptographic Algorithms ◽  
Secure Transmission

Secure transmission of private information is a crucial issue in today’s highly computerized world. Cryptographic algorithms are used to provide privacy of message transmission and to certify authenticity of sender and/or receiver of a message and message integrity as well as undeniability of transmitted messages (Menezes et al., 1996).

Sign in / Sign up

Export Citation Format

Share Document