Compact AES-Based Architecture for Symmetric Encryption, Hash Function, and Random Number Generation

Author(s):  
Ralf Laue ◽  
Oliver Kelm ◽  
Sebastian Schipp ◽  
Abdulhadi Shoufan ◽  
Sorin A. Huss
PLoS ONE ◽  
2021 ◽  
Vol 16 (4) ◽  
pp. e0250593
Author(s):  
Kiyoshiro Okada ◽  
Paul E. Brumby ◽  
Kenji Yasuoka

The tiny encryption algorithm (TEA) is widely used when performing dissipative particle dynamics (DPD) calculations in parallel, usually on distributed memory systems. In this research, we reduced the computational cost of the TEA hash function and investigated the influence of the quality of the random numbers generated on the results of DPD calculations. It has already been established that the randomness, or quality, of the random numbers depend on the number of processes from internal functions such as SHIFT, XOR and ADD, which are commonly referred to as “rounds”. Surprisingly, if we choose seed numbers from high entropy sources, with a minimum number of rounds, the quality of the random numbers generated is sufficient to successfully perform accurate DPD simulations. Although it is well known that using a minimal number of rounds is insufficient for generating high-quality random numbers, the combination of selecting good seed numbers and the robustness of DPD simulations means that we can reduce the random number generation cost without reducing the accuracy of the simulation results.


2014 ◽  
Vol 1 ◽  
pp. 272-275 ◽  
Author(s):  
Vincent Canals ◽  
Antoni Morro ◽  
Josep L. Rosselló

2021 ◽  
Vol 485 ◽  
pp. 126736
Author(s):  
Muhammad Imran ◽  
Vito Sorianello ◽  
Francesco Fresi ◽  
Bushra Jalil ◽  
Marco Romagnoli ◽  
...  

2021 ◽  
Vol 11 (8) ◽  
pp. 3330
Author(s):  
Pietro Nannipieri ◽  
Stefano Di Matteo ◽  
Luca Baldanzi ◽  
Luca Crocetti ◽  
Jacopo Belli ◽  
...  

Random numbers are widely employed in cryptography and security applications. If the generation process is weak, the whole chain of security can be compromised: these weaknesses could be exploited by an attacker to retrieve the information, breaking even the most robust implementation of a cipher. Due to their intrinsic close relationship with analogue parameters of the circuit, True Random Number Generators are usually tailored on specific silicon technology and are not easily scalable on programmable hardware, without affecting their entropy. On the other hand, programmable hardware and programmable System on Chip are gaining large adoption rate, also in security critical application, where high quality random number generation is mandatory. The work presented herein describes the design and the validation of a digital True Random Number Generator for cryptographically secure applications on Field Programmable Gate Array. After a preliminary study of literature and standards specifying requirements for random number generation, the design flow is illustrated, from specifications definition to the synthesis phase. Several solutions have been studied to assess their performances on a Field Programmable Gate Array device, with the aim to select the highest performance architecture. The proposed designs have been tested and validated, employing official test suites released by NIST standardization body, assessing the independence from the place and route and the randomness degree of the generated output. An architecture derived from the Fibonacci-Galois Ring Oscillator has been selected and synthesized on Intel Stratix IV, supporting throughput up to 400 Mbps. The achieved entropy in the best configuration is greater than 0.995.


2015 ◽  
Vol 137 ◽  
pp. 828-836 ◽  
Author(s):  
Che-Chi Shu ◽  
Vu Tran ◽  
Jeremy Binagia ◽  
Doraiswami Ramkrishna

Sign in / Sign up

Export Citation Format

Share Document