Special vs Random Curves: Could the Conventional Wisdom Be Wrong?
The conventional wisdom in cryptography is that for greatest security one should choose parameters as randomly as possible. In particular, in elliptic and hyperelliptic curve cryptography this means making random choices of the coefficients of…
Automated Whitebox Fuzz Testing
A Cryptographic Compiler for Information-Flow Security
Joint work with Tamara Rezk and Gurvan le Guernic (MSR-INRIA Joint Centre http://msr-inria.inria.fr/projects/sec) We relate two notions of security: one simple and abstract, based on information flows in programs, the other more concrete, based on…
Bilinear Complexity of the Multiplication in a Finite Extention of a Finite Field
Let q=pr be a prime power and Fq be the finite field with q elements. We study the multiplication of two polynomials in Fq [X], with degree ≤ n-1, modulo an irreducible polynomial of degree…
Deniable Authentication on the Internet
We revisit the question of deniable cryptographic primitives, where, intuitively, a malicious party observing the interaction, cannot later prove to a third party that the interaction took place. Example include deniable message authentication, key exchange…
Code-Carrying Authorization
Cryptography: From Theory to Practice
You use cryptography every time you make a credit card-based Internet purchase or use an ATM machine. But what is it? How does it work and how do we know when it is secure? This…