A Provable-Security Analysis of Intel’s Secure Key RNG

DOI10.1007/978-3-662-46800-5_4zbMath1365.94459OpenAlexW649077362MaRDI QIDQ2948324

R. Seth Terashima, Thomas Shrimpton

Publication date: 30 September 2015

Published in: Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46800-5_4

zbMATH Keywords

random number generatorprovable securityentropy extraction

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10)

Related Items (3)

Salvaging Weak Security Bounds for Blockcipher-Based Constructions ⋮ A robust and sponge-like PRNG with improved efficiency ⋮ Security analysis of NIST CTR-DRBG

This page was built for publication: A Provable-Security Analysis of Intel’s Secure Key RNG