scholarly journals New RSA Encryption Mechanism Using One-Time Encryption Keys and Unpredictable Bio-Signal for Wireless Communication Devices

Electronics ◽  
2020 ◽  
Vol 9 (2) ◽  
pp. 246 ◽  
Author(s):  
Hoyoung Yu ◽  
Youngmin Kim
Keyword(s):  
Wireless Communication ◽  
Prime Number ◽  
Random Number ◽  
Random Number Generator ◽  
Large Data ◽  
Prime Numbers ◽  
Data Encryption ◽  
Communication Devices ◽  
The Stability ◽  
Encryption Method

Applying the data encryption method used in conventional personal computers (PC) to wireless communication devices such as IoT is not trivial. Because IoT equipment is extremely slow in transferring data and has a small hardware area compared with PCs, it is difficult to transfer large data and perform complicated operations. In particular, it is difficult to apply the RSA encryption method to wireless communication devices because it guarantees the stability of data encryption because it is difficult to factor extremely large prime numbers. Furthermore, it has become even more difficult to apply the RSA encryption method to IoT devices as a paper recently published indicated that it enables rapid fractional decomposition when using RSA encryption with a prime number generated through several pseudo-random number generators. To compensate for the disadvantages of RSA encryption, we propose a method that significantly reduces the encryption key using a true prime random number generator (TPRNG), which generates a prime number that cannot be predicted through bio-signals, and a disposable RSA encryption key. TPRNG has been verified by the National Institute of Standards and Technology. The NIST test and an RSA algorithm are implemented through Verilog.

scholarly journals A true Random-Number Encryption Method employing block cipher and PRNG

2014 ◽  
Vol 11 (3) ◽  
pp. 905-924 ◽  
Author(s):  
Yi-Li Huang ◽  
Fang-Yie Leu ◽  
Jian-Hong Chen ◽  
Chu Cheng-Chung
Keyword(s):  
Block Cipher ◽  
Random Number ◽  
Data Encryption ◽  
Advanced Encryption Standard ◽  
Random Numbers ◽  
Security Level ◽  
Current Time ◽  
Data Encryption Standard ◽  
Time Points ◽  
Encryption Method

In January 1999, distributed.net collaborated with the Electronic Frontier Foundation to break a DES (i.e., Data Encryption Standard) key, spending 22 hours and 15 minutes, and implying that the DES is no longer a secure encryption method. In this paper, we propose a more secure one, called the True Random Number Encryption Method (TRNEM for short), which employs current time, true random numbers and system security codes as parameters of the encryption process to increase the security level of a system. The same plaintext file encrypted by the TRNEM at different time points generates different ciphertext files. So these files are difficult to be cracked. We also analyze the security of the DES, AES (i.e., Advanced Encryption Standard) and TRNEM, and explain why the TRNEM can effectively defend some specific attacks, and why it is safer than the DES and AES.

Perbandingan Penggunaan Bilangan Prima Aman Dan Tidak Aman Pada Proses Pembentukan Kunci

2015 ◽  
Vol 1 (3) ◽  
pp. 194
Author(s):  
Yudhi Andrian
Keyword(s):  
Prime Number ◽  
Random Number ◽  
Discrete Logarithm ◽  
Prime Numbers ◽  
Public Key ◽  
Key Generation ◽  
Private Key ◽  
Encryption And Decryption

Algoritma ElGamal merupakan algoritma dalam kriptografi yang termasuk dalam kategori algoritma asimetris. Keamanan algoritma ElGamal terletak pada kesulitan penghitungan logaritma diskret pada bilangan modulo prima yang besar sehingga upaya untuk menyelesaikan masalah logaritma ini menjadi sangat sukar. Algoritma ElGamal terdiri dari tiga proses, yaitu proses pembentukan kunci, proses enkripsi dan proses dekripsi. Proses pembentukan kunci kriptografi ElGamal terdiri dari pembentukan kunci privat dan pembentukan kunci public. Pada proses ini dibutuhkan sebuah bilangan prima aman yang digunakan sebagai dasar pembentuk kunci public sedangkan sembarang bilangan acak digunakan sebagai pembentuk kunci privat. Pada penelitian sebelumnya digunakan bilangan prima aman pada proses pembentukan kunci namun tidak dijelaskan alasan mengapa harus menggunakan bilangan prima aman tersebut. Penelitian ini mencoba membandingkan penggunaan bilangan prima aman dan bilangan prima tidak aman pada pembentukan kunci algoritma elgamal. Analisa dilakukan dengan mengenkripsi dan dekripsi sebuah file dengan memvariasikan nilai bilangan prima aman dan bilangan prima tidak aman yang digunakan untuk pembentukan kunci public dan kunci privat. Dari hasil analisa dapat disimpulkan bahwa dengan menggunakan bilangan prima aman maupun bilangan prima tidak aman, proses pembentukan kunci, enkripsi dan dekripsi tetap dapat berjalan dengan baik, semakin besar nilai bilangan prima yang digunakan, maka kapasitas cipherteks juga semakin besar.Elgamal algorithm is an algorithm in cryptography that is included in the category of asymmetric algorithms. The security of Elgamal algorithm lies in the difficulty in calculating the discrete logarithm on large number of prime modulo that attempts to solve this logarithm problem becomes very difficult. Elgamal algorithm is consists of three processes, that are the key generating, encryption and decryption process. Key generation of elgamal cryptography process is consisted of the formation of the private key and public key. In this process requires a secure prime number is used as the basis for forming public key while any random number used as forming of the private key. In the previous research is used secure prime number on key generating process but does not explain the reasons of using the secure primes. This research tried to compare using secure and unsecure primes in elgamal key generating algorithm. The analysis is done by encrypting and decrypting a file by varying the value of secure and unsecure of prime numbers that are used on generating of a public and a private key. From the analysis it can be concluded that using secure and unsecure of prime numbers, the process of key generating, encryption and decryption can run well, the greater value of prime numbers are used, the greater the capacity of the ciphertext.

scholarly journals An Overview of Spintronic True Random Number Generator

2021 ◽  
Vol 9 ◽  
Author(s):  
Zhenxiao Fu ◽  
Yi Tang ◽  
Xi Zhao ◽  
Kai Lu ◽  
Yemin Dong ◽  
...  
Keyword(s):  
Random Number ◽  
Tunnel Junctions ◽  
Random Number Generator ◽  
Magnetic Tunnel Junctions ◽  
High Energy ◽  
Data Encryption ◽  
Switching Behavior ◽  
Future Research ◽  
Number Generator ◽  
True Random Number Generator

A True Random Number Generator is an essential component in data encryption, hardware security, physical unclonable functions, and statistical analyses. Conventional CMOS devices usually exploit the thermal noise or jitter to generate randomness, which suffers from high energy consumption, slow bit generating rate, large area, and over-complicated circuit. In this mini review, we introduce the novel physical randomness generating mechanism based on the stochastic switching behavior of magnetic tunnel junctions. As compared to CMOS technologies, the random number generator based on spintronic devices can have many inherent advantages, such as simpler structure, compact area, higher throughput, and better energy-efficiency. Here, we review and compare various existing schemes at the device and circuit levels to achieve high performance magnetic tunnel junctions based on a True Random Number Generator. Future research trends and challenges are also discussed to stimulate more works in this area.

Sign in / Sign up

Export Citation Format

Share Document