RSA public keys with inside structure: Proofs of key generation and identities for web-of-trust

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).

Download Full-text

Analisis Pola Identifikasi Zero Knowledge Proof Dengan Algoritma Feige Fiat Shamir Menggunakan Blum Blum Shub

MEANS (Media Informasi Analisa dan Sistem) ◽

10.54367/means.v6i1.1203 ◽

2021 ◽

pp. 7-12

Author(s):

Cherlina Helena Purnamasari Panjaitan ◽

Lisda Juliana Pangaribuan

Keyword(s):

Random Number ◽

Random Number Generator ◽

Public Key ◽

Key Generation ◽

Number Generator ◽

Zero Knowledge ◽

The Public ◽

Public Keys ◽

Generation Test ◽

Zero Knowledge Proof

Protocol Zero Knowledge Proof is one of the protocols in Cryptography that has a fairly good level of security, because it applies the concept of "Truly Zero Knowledge Proof" which is not leaking any information. This protocol is used in the Fiat Shamir, Guillou Quisquater and Schnorr Feige Algorithms, all of which are Cryptographic Algorithms using private keys and public keys. In the Public key, all three of these Algorithms use a random number generator at the values p and q to get the public key. In this study, the author will generate a public key generation test using CPRNG (Cryptographically-secure Pseudo-Random Number Generator) with the Blum Blum Shub algorithm. The test will be conducted on the Fiat Feige Algorithm, the formation of the key will use the Blum Blum Shub Algorithm, but the Identification Protocol still uses the Fiat Shamir Feige Algorithm. The results of this study show the Feige Fiat Algorithm with the Blum Blum Shub Algorithm as the key builder successfully identifies the pattern sent by the signer.

Download Full-text

NTTRU: Truly Fast NTRU Using NTT

IACR Transactions on Cryptographic Hardware and Embedded Systems ◽

10.46586/tches.v2019.i3.180-201 ◽

2019 ◽

pp. 180-201 ◽

Cited By ~ 1

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.

Download Full-text