The following pages link to Jean-Sébastien Coron (Q271579):
Displaying 50 items.
- How to build an ideal cipher: the indifferentiability of the Feistel construction (Q271585) (← links)
- Practical cryptanalysis of ISO 9796-2 and EMV signatures (Q315558) (← links)
- (Q882778) (redirect page) (← links)
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring (Q882779) (← links)
- A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model (Q1009100) (← links)
- Formal verification of side-channel countermeasures via elementary circuit transformations (Q1656021) (← links)
- Improved side-channel analysis of finite-field multiplication (Q1695890) (← links)
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme (Q1695964) (← links)
- Faster evaluation of sboxes via common shares (Q1695997) (← links)
- Improved cryptanalysis of the AJPS Mersenne based cryptosystem (Q2023810) (← links)
- Side-channel masking with pseudo-random generator (Q2055660) (← links)
- Random probing security: verification, composition, expansion and new constructions (Q2096491) (← links)
- A polynomial-time algorithm for solving the hidden subset sum problem (Q2096513) (← links)
- Secure wire shuffling in the probing model (Q2128997) (← links)
- On Kilian's randomization of multilinear map encodings (Q2176654) (← links)
- Cryptanalysis of CLT13 multilinear maps with independent slots (Q2176656) (← links)
- Improved factorization of \(N=p^rq^s\) (Q2287505) (← links)
- A note on the bivariate Coppersmith theorem (Q2377067) (← links)
- Cryptanalysis of ISO/IEC 9796-1 (Q2482334) (← links)
- Index calculation attacks on RSA signature and encryption (Q2491257) (← links)
- (Q2707406) (← links)
- Factoring $$N=p^rq^s$$ for Large r and s (Q2799036) (← links)
- Security Analysis of the Modular Enhanced Symmetric Role Authentication (mERA) Protocol (Q2803662) (← links)
- Cryptanalysis of GGH15 Multilinear Maps (Q2829232) (← links)
- Practical Multilinear Maps over the Integers (Q2845689) (← links)
- Supplemental Access Control (PACE v2): Security Analysis of PACE Integrated Mapping (Q2889764) (← links)
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers (Q2894423) (← links)
- Higher-Order Side Channel Security and Mask Refreshing (Q2946888) (← links)
- Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity (Q2946940) (← links)
- Improved Generic Algorithms for Hard Knapsacks (Q3003392) (← links)
- (Q3043924) (← links)
- Cryptanalysis of the RSA Subgroup Assumption from TCC 2005 (Q3084345) (← links)
- Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures (Q3183578) (← links)
- (Q3374902) (← links)
- (Q3374921) (← links)
- A Domain Extender for the Ideal Cipher (Q3408200) (← links)
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations (Q3457113) (← links)
- New Multilinear Maps Over the Integers (Q3457114) (← links)
- Side Channel Cryptanalysis of a Higher Order Masking Scheme (Q3525056) (← links)
- A New DPA Countermeasure Based on Permutation Tables (Q3540052) (← links)
- On the Broadcast and Validity-Checking Security of pkcs#1 v1.5 Encryption (Q3575032) (← links)
- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves (Q3582757) (← links)
- Analysis and Improvement of the Random Delay Countermeasure of CHES 2009 (Q3583443) (← links)
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent (Q3600210) (← links)
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach (Q3612560) (← links)
- An Efficient Method for Random Delay Generation in Embedded Software (Q3642928) (← links)
- Fault Attacks on RSA Signatures with Partially Unknown Messages (Q3642948) (← links)
- PSS Is Secure against Random Fault Attacks (Q3650719) (← links)
- (Q4250806) (← links)
- (Q4263419) (← links)