Thomas Plantard

Computer Science · Physical Sciences

16h-index690citations76works1.32yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptography and Data Security(49), Cryptography and Residue Arithmetic(46), Coding theory and cryptography(38), Cryptographic Implementations and Security(16), Chaos-based Image/Signal Encryption(8)

Publications76 total

Diagonally dominant matrices for cryptography
IACR Communications in Cryptology·2025Open Access
Improved computation of polynomial roots over number fields when using complex embeddings
Journal of Computational Algebra·2024· 1 citedOpen Access
On Digital Signatures Based on Group Actions: QROM Security and Ring Signatures
Lecture notes in computer science·2024· 3 cited
Fast verification and public key storage optimization for unstructured lattice-based signatures
Journal of Cryptographic Engineering·2023· 3 citedOpen Access
Generating Very Large RNS Bases
2022
Covering Radius and First Minima Bound on Diagonally Dominant Lattices in the l ∞ -norm
HAL (Le Centre pour la Communication Scientifique Directe)·2022Open Access
Generating Very Large RNS Bases
IEEE Transactions on Emerging Topics in Computing·2022· 1 citedOpen Access
On Polynomial Modular Number Systems over $ \mathbb{Z}/{p}\mathbb{Z} $
Advances in Mathematics of Communications·2022· 4 citedOpen Access
Computing roots of polynomials over number fields using complex embeddings
HAL (Le Centre pour la Communication Scientifique Directe)·2022Open Access
Tight Bound on NewHope Failure Probability
IEEE Transactions on Emerging Topics in Computing·2022· 1 cited
Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms
Lecture notes in computer science·2022· 33 citedOpen Access
ON THE SHORT PRINCIPAL IDEAL PROBLEM OVER SOME REAL KUMMER FIELDS
SPIRE - Sciences Po Institutional REpository·2021· 1 cited
Generating Residue Number System Bases
2021· 3 citedOpen Access
Efficient Word Size Modular Arithmetic
2021· 6 cited
Efficient Word Size Modular Arithmetic
IEEE Transactions on Emerging Topics in Computing·2021· 38 cited
A Noise Study of the PSW Signature Family: Patching DRS with Uniform Distribution †
Information·2020· 1 citedOpen Access
Lattice Blind Signatures with Forward Security
Research Online (University of Wollongong)·2020· 7 citedOpen Access
Short Principal Ideal Problem in multicubic fields
Journal of Mathematical Cryptology·2020· 6 citedOpen Access
Lattice Blind Signatures with Forward Security
Lecture notes in computer science·2020Open Access
Enhancing Goldreich, Goldwasser and Halevi’s scheme with intersecting lattices
Journal of Mathematical Cryptology·2019· 5 citedOpen Access
page 1 of 4Next →

Frequent Co-authors

Willy Susilo(27), Jean-Claude Bajard(15), Christophe Négre(8), Clémentine Gritti(8), Zhenfei Zhang(6), Laurent Imbert(5), Arnaud Sipasseuth(5), Dung Hoang Duong(3), Andrea Lesavourey(3), Gang Tang(2), Antoine Joux(2), Youming Qiao(2), Nicolas Méloni(2), Julien Eynard(2), Nabil Merkiche(2), Kaitai Liang(2), Duncan S. Wong(2), Khin Than Win(2), Kazuhide Fukushima(2), Marcelo E. Kaihara(1)