The Intel ® Random Number Generator
نویسنده
چکیده
Almost all cryptographic protocols require the generation and use of secret values that must be unknown to attackers. For example, random number generators are required to generate public/private keypairs for asymmetric (public key) algorithms including RSA, DSA, and Diffie-Hellman. Keys for symmetric and hybrid cryptosystems are also generated randomly. RNGs are also used to create challenges, nonces (salts), padding bytes, and blinding values. The one time pad – the only provably-secure encryption system – uses as much key material as ciphertext and requires that the keystream be generated from a truly random process.
منابع مشابه
Concurrency as a Random Number Generator Technical Report
Concurrency is difficult to master because of the underlying non-determinism of shared memory accesses. In this paper, we show how to leverage this difficulty to efficiently generate random numbers on multi-core architectures. Random numbers are required by many applications but are usually hard to generate because they rely on passive monitoring of slow underlying physical processes (e.g. I/O ...
متن کاملRecent Advances and Existing Research Questions in Platform Security
In this talk I will provide a description of recent uses Intel has made of cryptography in our platforms, including providing a hardware random number generator, using anonymous signatures, and improving performance of cryptographic algorithms. I will discuss how processor capabilities could be used more effectively by cryptographic algorithms. I will then discuss research questions in cryptogr...
متن کاملTowards Inter-Vendor Compatibility of True Random Number Generators for FPGAs
True random number generators (TRNGs) are fundamental constituents of secure embedded cryptographic systems. In this paper, we introduce a general methodology for porting TRNG across different FPGA vendor families. In order to demonstrate our methodology, we applied it to the delay-chain based TRNG (DC-TRNG) on Intel Cyclone IV and Cyclone V FPGAs. We examine vendor-agnostic generality of the u...
متن کاملA Provable-Security Analysis of Intel's Secure Key RNG
We provide the first provable-security analysis of the Intel Secure Key hardware RNG (ISK-RNG), versions of which have appeared in Intel processors since late 2011. To model the ISKRNG, we generalize the PRNG-with-inputs primitive, introduced by Dodis et al. at CCS’13 for their /dev/[u]random analysis. The concrete security bounds we uncover tell a mixed story. We find that ISKRNG lacks backwar...
متن کاملA Closer Look at the Delay-Chain based TRNG
This paper presents a refined stochastic model of the delay-chain based true random number generator (DCTRNG) and its application. DC-TRNG is a true random number generator for FPGAs that utilizes time-to-digital conversion (TDC) to accurately determine the position of the ring-oscillator jittery signal edge. Our stochastic model employs precise time characterization of the carry-chains that ar...
متن کاملThe Generalized Impressionistic Texture Matrix Generator
We describe a system for determining a random palette providing color juxtaposition in digital images, both synthetic and scanned. The result can be significantly increased visual richness and sophistication in color usage. The Generalized Impressionistic Texture Matrix Generator F. Kenton Musgrave Myeong Lim The George Washington University 20101 Academic Way Ashburn, VA 22011 (703) 729-8254 (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999