A block cipher based pseudo random number generator secure against side-channel key recovery
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We study the security of a block cipher-based pseudorandom number generator (PRNG), both in the black box world and in the physical world, separately. We first show that the construction is a secure PRNG in the ideal cipher model. Then, we demonstrate its security against a Bayesian side-channel key recovery adversary. As a main result, we show that our construction guarantees that the success rate of the adversary does not increase with the number of physical observations, but in a limited and controlled way. Besides, we observe that, under common assumptions on side-channel attack strategies, increasing the security parameter (typically the block cipher key size) by a polynomial factor involves an increase of a side-channel attack complexity by an exponential factor, making the probability of a successful attack negligible. We believe this work provides a first interesting example of the way the algorithmic design of a cryptographic scheme influences its side-channel resistance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
Research works printed but not linked: 16
- M. Abdalla M. Bellare Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-Keying Techniques in the proceedings of Asiacrypt 2000 Lecture Notes in Computer Science vol 1976 pp 546 -- 559 Kyoto Japan December 2000. M. Abdalla M. Bellare Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-Keying Techniques in the proceedings of Asiacrypt 2000 Lecture Notes in Computer Science vol 1976 pp 546--559 Kyoto Japan December 2000. · doi:10.1007/3-540-44448-3_42
- 10.1006/jcss.1999.1694 · DOI · Paper page
- M. Bellare , T. Kohno , A Theoretical Treatment of Related-Key Attacks: RKA-PRPs , RKA-PRFs, and applications, in the proceedings of Eurocrypt 2003 , Lecture Notes in Computer Science , vol 5656, pp 491 -- 506 , Warsaw , Poland, May 2003. M. Bellare, T. Kohno, A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and applications, in the proceedings of Eurocrypt 2003, Lecture Notes in Computer Science, vol 5656, pp 491--506, Warsaw, Poland, May 2003. · DOI · Paper page
- J. Black P. Rogaway T. Shrimpton Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV in the proceedings of Crypto 2002 Lecture Notes in Computer Science vol 2442 pp 320 -- 335 Santa Barbare USA August 2002. J. Black P. Rogaway T. Shrimpton Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV in the proceedings of Crypto 2002 Lecture Notes in Computer Science vol 2442 pp 320--335 Santa Barbare USA August 2002. · DOI · Paper page
- S. Chari , J. Rao , P. Rohatgi , Template Attacks , in the proceedings of CHES 2002 , Lecture Notes in Computer Science, vol 2523 , pp 13 -- 28 , Redwood City, CA, USA, August 2002 . S. Chari, J. Rao, P. Rohatgi, Template Attacks, in the proceedings of CHES 2002, Lecture Notes in Computer Science, vol 2523, pp 13--28, Redwood City, CA, USA, August 2002.
- FIPS 197, " Advanced Encryption Standard ," Federal Information Processing Standard , NIST, U.S. Dept . of Commerce , November 26 , 2001 . FIPS 197, "Advanced Encryption Standard," Federal Information Processing Standard, NIST, U.S. Dept. of Commerce, November 26, 2001.
- O. Goldreich , Foundations of Cryptography, vol 1 , Cambridge U. Press , 2001 . O. Goldreich, Foundations of Cryptography, vol 1, Cambridge U. Press, 2001. · DOI · Paper page
- L. Goubin , J. Patarin , DES and Differential Power Analysis , in the proceedings of CHES 1999 , Lecture Notes in Computer Science, vol 1717 , pp 158 -- 172 , Worcester, MA, USA, August 1999 . L. Goubin, J. Patarin, DES and Differential Power Analysis, in the proceedings of CHES 1999, Lecture Notes in Computer Science, vol 1717, pp 158--172, Worcester, MA, USA, August 1999.
- 10.1145/1315245.1315282 · DOI · Paper page
- 10.1137/0217022 · DOI · Paper page
- P. Kocher , Design and Validation Strategies for Obtaining Assurance in Countermeasures to Power Analysis and Related Attacks , in the proceedings of the NIST Physical Security Workshop , Honolulu, Hawai , September 2005 . P. Kocher, Design and Validation Strategies for Obtaining Assurance in Countermeasures to Power Analysis and Related Attacks, in the proceedings of the NIST Physical Security Workshop, Honolulu, Hawai, September 2005.
- S. Mangard , Hardware Countermeasures against DPA - A Statistical Analysis of Their Effectiveness , in the proceedings of CT-RSA 2004 , Lecture Notes in Computer Science, vol 2964 , pp 222 -- 235 , San Francisco, CA, USA, February 2004 . S. Mangard, Hardware Countermeasures against DPA - A Statistical Analysis of Their Effectiveness, in the proceedings of CT-RSA 2004, Lecture Notes in Computer Science, vol 2964, pp 222--235, San Francisco, CA, USA, February 2004.
- S. Micali , L. Reyzin , Physically Observable Cryptography , in the proceedings of TCC 2004 , LNCS, vol 2951, pp. 278 -- 296 , Cambridge, Massachusetts, USA , February 2004 . S. Micali, L. Reyzin, Physically Observable Cryptography, in the proceedings of TCC 2004, LNCS, vol 2951, pp. 278--296, Cambridge, Massachusetts, USA, February 2004.
- 10.1007/11894063_3 · doi:10.1007/11894063_3
- K. Tiri , M. Akmal , I. Verbauwhede , A Dynamic and Differential CMOS Logic with Signal Independent Power Consumption to Withstand Differential Power Analysis on Smart Cards , ESSCIRC 2003 . K. Tiri, M. Akmal, I. Verbauwhede, A Dynamic and Differential CMOS Logic with Signal Independent Power Consumption to Withstand Differential Power Analysis on Smart Cards, ESSCIRC 2003.
- A. C. Yao , Theory and Applications of Trapdoor Functions ( Extended Abstract) , in the proceedings of FOCS 1982 , pp. 80 -- 91 . A. C. Yao, Theory and Applications of Trapdoor Functions (Extended Abstract), in the proceedings of FOCS 1982, pp. 80--91.
Cited by
A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
Standaert, F.-X., Malkin, T. G., & Yung, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_26 · Cited by 925
Self-citationLocal Shannon entropy measure with statistical tests for image randomness
Wu, Y., Zhou, Y., Saveriades, G., Agaian, S., Noonan, J. P., & Natarajan, P. (2013) · Information Sciences · doi:10.1016/j.ins.2012.07.049 · Cited by 722
“In contrast, a block cipher itself is normally considered as a cryptographically secure PRNG [43], whose generated sequences also attain the properties Eqs.”
BackgroundProvably Secure Higher-Order Masking of AES
Rivain, M., & Prouff, E. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15031-9_28 · Cited by 526
Leakage-Resilient Cryptography
Dziembowski, S., & Pietrzak, K. (2008) · 2008 49th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2008.56 · Cited by 504
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
Akavia, A., Goldwasser, S., & Vaikuntanathan, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00457-5_28 · Cited by 490
Metadata
- Authors
- Petit, C., Standaert, F.-X., Pereira, O., Malkin, T. G., & Yung, M.
- Venue
- Proceedings of the 2008 ACM symposium on Information, computer and communications security
- Publisher
- ACM
- Published
- 2008-03-18
- Pages
- 56-65
- OpenAlex
- W2020981190
- Cited by
- 70
- References
- 1
- FWCI
- 9.68
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.