The purpose of this webpage is to provide the material of the certification of an assembly implementation of the BBS PRNG with its security proof.
The experiment is described in:
[1] Reynald Affeldt,
David Nowak, and
Kiyoshi Yamada.
Certifying Assembly with Formal Security Proofs: the Case
of BBS. Science of Computer Programming,
in press, Elsevier, 2011.
doi.
which is an improved version of:
[2] ---.
Certifying Assembly with Formal Cryptographic Proofs: the Case of BBS.
In Proceedings of the Ninth International Workshop on Automated Verification of Critical Systems (AVoCS 2009), September 23-25, 2009.
pdf.
Certification of assembly code with security proofs is made possible
by a formal framework developed in the Coq
proof-assistant; this framework results from the integration of two existing
frameworks.
vars.mk so that ROOT and SSRLIB point to appropriate files. Do make all (COQBIN better not be set).
|
As explained at the end of Section 5 in the above paper [2], the formal security proof of BBS in assembly can be summarized by the figure on the right. Here are links to the relevant files: |
|