Information Security and Cryptology – ICISC 2008

Volume 5461 of the series Lecture Notes in Computer Science pp 368-382

On Formal Verification of Arithmetic-Based Cryptographic Primitives

  • David NowakAffiliated withResearch Center for Information Security, AIST

* Final gross prices may vary according to local VAT.

Get Access


Cryptographic primitives are fundamental for information security: they are used as basic components for cryptographic protocols or public-key cryptosystems. In many cases, their security proofs consist in showing that they are reducible to computationally hard problems. Those reductions can be subtle and tedious, and thus not easily checkable. On top of the proof assistant Coq, we had implemented in previous work a toolbox for writing and checking game-based security proofs of cryptographic primitives. In this paper we describe its extension with number-theoretic capabilities so that it is now possible to write and check arithmetic-based cryptographic primitives in our toolbox. We illustrate our work by machine checking the game-based proofs of unpredictability of the pseudo-random bit generator of Blum, Blum and Shub, and semantic security of the public-key cryptographic scheme of Goldwasser and Micali.


machine formalization cryptographic primitives CSPRBG semantic security