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

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

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

Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) ◽

10.29207/resti.v5i4.3297 ◽

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

High speed random number generator for section key generation in encryption devices

2013 21st Telecommunications Forum Telfor (TELFOR) ◽

10.1109/telfor.2013.6716186 ◽

2013 ◽

Cited By ~ 3

Author(s):

Miroslav Peric ◽

Predrag Milicevic ◽

Zoran Banjac ◽

Vladimir Orlic ◽

Sasa Milicevic

Keyword(s):

High Speed ◽

Random Number ◽

Random Number Generator ◽

Key Generation ◽

Number Generator

Download Full-text

Modelling of Random Number Generator based on PUFs and LFSR for secret key generation

10.1109/icesc51422.2021.9532624 ◽

2021 ◽

Author(s):

Remya Krishnan ◽

Anu Chalil

Keyword(s):

Random Number ◽

Random Number Generator ◽

Key Generation ◽

Number Generator ◽

Secret Key ◽

Secret Key Generation

Download Full-text

DNA and Blum Blum Shub Random Number Generator Based Security Key Generation Algorithm

International Journal of Security and Its Applications ◽

10.14257/ijsia.2017.11.4.01 ◽

2017 ◽

Vol 11 (4) ◽

pp. 1-10

Author(s):

Gurpreet Kour Sodhi ◽

Gurjot Singh Gaba

Keyword(s):

Random Number ◽

Random Number Generator ◽

Key Generation ◽

Number Generator ◽

Generation Algorithm

Download Full-text

Combining a quantum random number generator and quantum-resistant algorithms into the GnuGPG open-source software

Advanced Optical Technologies ◽

10.1515/aot-2020-0021 ◽

2020 ◽

Vol 9 (5) ◽

pp. 287-295

Author(s):

Francesco Raffaelli ◽

Robert Denman ◽

Richard Collins ◽

Jean-Charles Faugere ◽

Gaetano De Martino ◽

...

Keyword(s):

Open Source ◽

Open Source Software ◽

Random Number ◽

Random Number Generator ◽

Quantum Entropy ◽

Public Key ◽

Random Numbers ◽

Number Generator ◽

Cryptographic Algorithms ◽

Entropy Source

AbstractThe “quantum threat” to our current, convenient cryptographic algorithms is getting closer, with demonstrable progress by commercial quantum computing efforts. It is now more important than ever that we combine all of our tools into a new quantum-safe toolbox to develop the next generation of quantum-safe networking solutions. Here we combine an integrated quantum entropy source with quantum-resistant algorithms in the GnuGPG open-source software; leading to a fully quantum-safe version of GnuGPG. The quantum entropy source itself is capable of a raw rate of randomness in excess of 10 Gbps. After post-processing, quantum random numbers are used by the quantum-resistant algorithms to allow GnuGPG to perform its usual public-key cryptographic tasks, such as digitally signing documents, but now in a secure quantum-safe way.

Download Full-text