High-order masking of NTRU. | 0 | 0.34 | 2022 |
Secure Wire Shuffling In The Probing Model | 0 | 0.34 | 2021 |
High-order Polynomial Comparison and Masking Lattice-based Encryption. | 0 | 0.34 | 2021 |
Side-channel Masking with Pseudo-Random Generator. | 0 | 0.34 | 2019 |
Improved Cryptanalysis Of The Ajps Mersenne Based Cryptosystem | 0 | 0.34 | 2019 |
Formal Verification of Side-channel Countermeasures via Elementary Circuit Transformations. | 2 | 0.36 | 2018 |
High Order Masking of Look-up Tables with Common Shares. | 1 | 0.36 | 2018 |
Improved High-Order Conversion From Boolean to Arithmetic Masking. | 0 | 0.34 | 2018 |
Improved Factorization of N=p^rq^s. | 0 | 0.34 | 2018 |
Zeroizing Attacks On Indistinguishability Obfuscation Over Clt13 | 7 | 0.43 | 2017 |
High-Order Conversion From Boolean To Arithmetic Masking | 2 | 0.39 | 2017 |
Cryptanalysis of GGH15 Multilinear Maps. | 2 | 0.36 | 2016 |
Factoring N=p^rq^s for Large r and s. | 3 | 0.39 | 2016 |
Improved Factorization of N=prqs. | 0 | 0.34 | 2016 |
Security Analysis of the Modular Enhanced Symmetric Role Authentication (mERA) Protocol. | 0 | 0.34 | 2016 |
Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity. | 8 | 0.52 | 2015 |
Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures | 8 | 0.47 | 2015 |
Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations | 70 | 1.58 | 2015 |
A Number-Theoretic Error-Correcting Code | 0 | 0.34 | 2015 |
Improved Side-Channel Analysis Of Finite-Field Multiplication | 8 | 0.52 | 2015 |
Factoring N=p^r q^s for Large r and s. | 0 | 0.34 | 2015 |
New Multilinear Maps over the Integers. | 77 | 2.16 | 2015 |
Cryptanalysis of Two Candidate Fixes of Multilinear Maps over the Integers. | 26 | 1.07 | 2014 |
Higher Order Masking of Look-up Tables. | 13 | 0.64 | 2014 |
Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity. | 1 | 0.36 | 2014 |
Practical Multilinear Maps over the Integers. | 199 | 6.39 | 2013 |
Batch Fully Homomorphic Encryption over the Integers. | 0 | 0.34 | 2013 |
A Note on the Bivariate Coppersmith Theorem | 0 | 0.34 | 2013 |
Higher-Order Side Channel Security and Mask Refreshing. | 44 | 1.21 | 2013 |
A Variant of Coppersmith's Algorithm with Improved Complexity and Efficient Exhaustive Search. | 0 | 0.34 | 2013 |
On the use of shamir's secret sharing against side-channel analysis | 9 | 0.61 | 2012 |
Supplemental access control (PACE v2): security analysis of PACE integrated mapping | 8 | 0.55 | 2012 |
Another look at affine-padding RSA signatures | 0 | 0.34 | 2012 |
Conversion of security proofs from one leakage model to another: a new issue | 16 | 0.55 | 2012 |
Public key compression and modulus switching for fully homomorphic encryption over the integers | 102 | 3.43 | 2012 |
Another Look at RSA Signatures With Affine Padding. | 0 | 0.34 | 2011 |
Improved generic algorithms for hard knapsacks | 30 | 1.53 | 2011 |
Cryptanalysis of the RSA subgroup assumption from TCC 2005 | 11 | 0.63 | 2011 |
Small Private Circuits | 0 | 0.34 | 2011 |
Fully homomorphic encryption over the integers with shorter public keys | 158 | 6.74 | 2011 |
Optimization of Fully Homomorphic Encryption. | 5 | 0.49 | 2011 |
SPAKE: a single-party public-key authenticated key exchange protocol for contact-less applications | 2 | 0.37 | 2010 |
A domain extender for the ideal cipher | 20 | 0.63 | 2010 |
Analysis and improvement of the random delay countermeasure of CHES 2009 | 33 | 1.51 | 2010 |
Efficient indifferentiable hashing into ordinary elliptic curves | 25 | 1.01 | 2010 |
Fault attacks against EMV signatures | 19 | 0.92 | 2010 |
On the broadcast and validity-checking security of PKCS#1 v1.5 encryption | 6 | 0.46 | 2010 |
PSS Is Secure against Random Fault Attacks | 5 | 0.40 | 2009 |
Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures | 9 | 0.80 | 2009 |
A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model | 7 | 0.44 | 2009 |