Rina Zeitoun

According to our database1, Rina Zeitoun authored at least 19 papers between 2013 and 2025.

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

2025
Efficient High-Order Masking of FrodoKEM's CDT-Based Gaussian Sampler.
IACR Cryptol. ePrint Arch., 2025

2024
Improved High-Order Masked Generation of Masking Vector and Rejection Sampling in Dilithium.
IACR Cryptol. ePrint Arch., 2024

2023
Improved Gadgets for the High-Order Masking of Dilithium.
IACR Cryptol. ePrint Arch., 2023

2022
High-order masking of NTRU.
IACR Cryptol. ePrint Arch., 2022

2021
High-order Polynomial Comparison and Masking Lattice-based Encryption.
IACR Cryptol. ePrint Arch., 2021

High-order Table-based Conversion Algorithms and Masking Lattice-based Encryption.
IACR Cryptol. ePrint Arch., 2021

2020
Side-Channel Masking with Pseudo-Random Generator.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2018
Improved High-Order Conversion From Boolean to Arithmetic Masking.
IACR Cryptol. ePrint Arch., 2018

Improved Factorization of N=p^rq^s.
Proceedings of the Topics in Cryptology - CT-RSA 2018, 2018

2017
High Order Masking of Look-up Tables with Common Shares.
IACR Cryptol. ePrint Arch., 2017

2016
Improved Factorization of N=p<sup>rq<sup>s</sup></sup>.
IACR Cryptol. ePrint Arch., 2016

Factoring N=p^rq^s for Large r and s.
Proceedings of the Topics in Cryptology - CT-RSA 2016 - The Cryptographers' Track at the RSA Conference 2016, San Francisco, CA, USA, February 29, 2016

Faster Evaluation of SBoxes via Common Shares.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2016, 2016

Horizontal Side-Channel Attacks and Countermeasures on the ISW Masking Scheme.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2016, 2016

2015
Algebraic methods for security analysis of cryptographic algorithms implementations. (Méthodes algébriques pour l'analyse de sécurité des implantations d'algorithmes cryptographiques).
PhD thesis, 2015

Factoring N=p<sup>r</sup> q<sup>s</sup> for Large r and s.
IACR Cryptol. ePrint Arch., 2015

2014
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

2013
A Variant of Coppersmith's Algorithm with Improved Complexity and Efficient Exhaustive Search.
IACR Cryptol. ePrint Arch., 2013

Combined Attack on CRT-RSA - Why Public Verification Must Not Be Public?
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013


  Loading...