Jean-Christophe Zapalowicz

According to our database1, Jean-Christophe Zapalowicz authored at least 10 papers between 2012 and 2014.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Security of the pseudorandom number generators and implementations of public key signature schemes. (Sécurité des générateurs pseudo-aléatoires et des implémentations de schémas de signature à clé publique).
PhD thesis, 2014

Synthesis of Fault Attacks on Cryptographic Implementations.
IACR Cryptol. ePrint Arch., 2014

Making RSA-PSS Provably Secure Against Non-Random Faults.
IACR Cryptol. ePrint Arch., 2014

Binary Elligator Squared.
IACR Cryptol. ePrint Arch., 2014

Statistical Properties of Short RSA Distribution and Their Cryptographic Applications.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
Attacking RSA-CRT signatures with faults on montgomery multiplication.
J. Cryptogr. Eng., 2013

Recovering Private Keys Generated with Weak PRNGs.
Proceedings of the Cryptography and Coding - 14th IMA International Conference, 2013

Time/Memory/Data Tradeoffs for Variants of the RSA Problem.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith's Methods.
Proceedings of the Public Key Cryptography - PKC 2012, 2012


  Loading...