Efficient Multiplication in GF(pk) for Elliptic Curve Cryptography. - Jean-Claude Bajard; Laurent Imbert; Christophe Nègre; Thomas Plantard (IEEE Symposium on Computer Arithmetic, 2003)

Modular Number Systems: Beyond the Mersenne Family. - Jean-Claude Bajard; Laurent Imbert; Thomas Plantard (Selected Areas in Cryptography, 2004)

Arithmetic Operations in the Polynomial Modular Number System. - Jean-Claude Bajard; Laurent Imbert; Thomas Plantard (IEEE Symposium on Computer Arithmetic, 2005)

Arithmétique modulaire pour la cryptographie. - Thomas Plantard (2005)

Subquadratic Binary Field Multiplier in Double Polynomial System. - Pascal Giorgi; Christophe Nègre; Thomas Plantard (SECRYPT, 2007)

Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation. - Christophe Nègre; Thomas Plantard (ACISP, 2008)

A Digital Signature Scheme Based on CVPinfinity. - Thomas Plantard; Willy Susilo; Khin Than Win (Public Key Cryptography, 2008)

Efficient lattice-based signature scheme. - Thomas Plantard; Willy Susilo; Khin Than Win; Qiong Huang 001 (Int. J. Appl. Cryptogr., 2008)

Broadcast Attacks against Lattice-Based Cryptosystems. - Thomas Plantard; Willy Susilo (ACNS, 2009)

Selected RNS Bases for Modular Multiplication. - Jean-Claude Bajard; Marcelo E. Kaihara; Thomas Plantard (IEEE Symposium on Computer Arithmetic, 2009)

Improvement of Lattice-Based Cryptography Using CRT. - Thomas Plantard; Mike Rose; Willy Susilo (QuantumComm, 2009)

Recursive Lattice Reduction. - Thomas Plantard; Willy Susilo (SCN, 2010)

Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation. - Jean-Claude Bajard; Christophe Nègre; Thomas Plantard (IEEE Trans. Computers, 2010)

Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes. - Zhenfei Zhang; Thomas Plantard; Willy Susilo (ICISC, 2011)

Improving BDD Cryptosystems in General Lattices. - Michael Rose; Thomas Plantard; Willy Susilo (ISPEC, 2011)

On the CCA-1 Security of Somewhat Homomorphic Encryption over the Integers. - Zhenfei Zhang; Thomas Plantard; Willy Susilo (ISPEC, 2012)

Lattice Reduction for Modular Knapsack. - Thomas Plantard; Willy Susilo; Zhenfei Zhang (Selected Areas in Cryptography, 2012)

Adaptive Precision Floating Point LLL. - Thomas Plantard; Willy Susilo; Zhenfei Zhang (ACISP, 2013)

Creating a Challenge for Ideal Lattices. - Thomas Plantard; Michael Schneider 002 (IACR Cryptol. ePrint Arch., 2013)

Fully Homomorphic Encryption Using Hidden Ideal Lattice. - Thomas Plantard; Willy Susilo; Zhenfei Zhang (IEEE Trans. Inf. Forensics Secur., 2013)

Babaï round-off CVP method in RNS: Application to lattice based cryptographic protocols. - Jean-Claude Bajard; Julien Eynard; Nabil Merkiche; Thomas Plantard (ISIC, 2014)

Empowering Personal Health Records with Cloud Computing: How to encrypt with forthcoming fine-grained policies efficiently. - Clémentine Gritti; Willy Susilo; Thomas Plantard; Kaitai Liang; Duncan S. Wong (J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl., 2014)

Efficient Dynamic Provable Data Possession with Public Verifiability and Data Privacy. - Clémentine Gritti; Willy Susilo; Thomas Plantard (ACISP, 2015)

RNS Arithmetic Approach in Lattice-Based Cryptography: Accelerating the "Rounding-off" Core Procedure. - Jean-Claude Bajard; Julien Eynard; Nabil Merkiche; Thomas Plantard (ARITH, 2015)

Efficient Modular Exponentiation Based on Multiple Multiplications by a Common Operand. - Christophe Nègre; Thomas Plantard; Jean-Marc Robert 003 (ARITH, 2015)

Efficient File Sharing in Electronic Health Records. - Clémentine Gritti; Willy Susilo; Thomas Plantard (ISPEC, 2015)

LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme. - Thomas Plantard; Willy Susilo; Zhenfei Zhang (Des. Codes Cryptogr., 2015)

Privacy-preserving encryption scheme using DNA parentage test. - Clémentine Gritti; Willy Susilo; Thomas Plantard; Khin Than Win (Theor. Comput. Sci., 2015)

Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications. - Andrea Lesavourey; Christophe Nègre; Thomas Plantard (SECRYPT, 2016)

Enhanced Digital Signature Using RNS Digit Exponent Representation. - Thomas Plantard; Jean-Marc Robert 003 (WAIFI, 2016)

Logarithmic size ring signatures without random oracles. - Clémentine Gritti; Willy Susilo; Thomas Plantard (IET Inf. Secur., 2016)

Broadcast encryption with dealership. - Clémentine Gritti; Willy Susilo; Thomas Plantard; Kaitai Liang; Duncan S. Wong (Int. J. Inf. Sec., 2016)

Certificate-Based Encryption with Keyword Search: Enabling Secure Authorization in Electronic Health Record. - Clémentine Gritti; Willy Susilo; Thomas Plantard (J. Internet Serv. Inf. Secur., 2016)

Efficient Leak Resistant Modular Exponentiation in RNS. - Andrea Lesavourey; Christophe Nègre; Thomas Plantard (ARITH, 2017)

Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy. - Clémentine Gritti; Rongmao Chen; Willy Susilo; Thomas Plantard (ISPEC, 2017)

Efficient regular modular exponentiation using multiplicative half-size splitting. - Christophe Nègre; Thomas Plantard (J. Cryptogr. Eng., 2017)

Device Identification and Personal Data Attestation in Networks. - Clémentine Gritti; Melek Önen; Refik Molva; Willy Susilo; Thomas Plantard (J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl., 2018)

Improving the Security of the DRS Scheme with Uniformly Chosen Random Noise. - Arnaud Sipasseuth; Thomas Plantard; Willy Susilo (ACISP, 2019)

Using Freivalds' Algorithm to Accelerate Lattice-Based Signature Verifications. - Arnaud Sipasseuth; Thomas Plantard; Willy Susilo (ISPEC, 2019)

Efficient Fixed-base exponentiation and scalar multiplication based on a multiplicative splitting exponent recoding. - Jean-Marc Robert 003; Christophe Nègre; Thomas Plantard (J. Cryptogr. Eng., 2019)

Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices. - Arnaud Sipasseuth; Thomas Plantard; Willy Susilo (J. Math. Cryptol., 2019)

Lattice Blind Signatures with Forward Security. - Huy Quoc Le; Dung Hoang Duong; Willy Susilo; Ha Thanh Nguyen Tran; Viet Cuong Trinh; Josef Pieprzyk; Thomas Plantard (ACISP, 2020)

A Noise Study of the PSW Signature Family: Patching DRS with Uniform Distribution †. - Arnaud Sipasseuth; Thomas Plantard; Willy Susilo (Inf., 2020)

Short Principal Ideal Problem in multicubic fields. - Andrea Lesavourey; Thomas Plantard; Willy Susilo (J. Math. Cryptol., 2020)

Generating Residue Number System Bases. - Jean-Claude Bajard; Kazuhide Fukushima; Shinsaku Kiyomoto; Thomas Plantard; Arnaud Sipasseuth; Willy Susilo (ARITH, 2021)

On the Short Principal Ideal Problem over some real Kummer fields. - Andrea Lesavourey; Thomas Plantard; Willy Susilo (IACR Cryptol. ePrint Arch., 2021)

Efficient Word Size Modular Arithmetic. - Thomas Plantard (IEEE Trans. Emerg. Top. Comput., 2021)

Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms. - Gang Tang; Dung Hoang Duong; Antoine Joux; Thomas Plantard; Youming Qiao; Willy Susilo (IACR Cryptol. ePrint Arch., 2022)

Generating Very Large RNS Bases. - Jean-Claude Bajard; Kazuhide Fukushima; Thomas Plantard; Arnaud Sipasseuth (IEEE Trans. Emerg. Top. Comput., 2022)

Tight Bound on NewHope Failure Probability. - Thomas Plantard; Arnaud Sipasseuth; Willy Susilo; Vincent Zucca (IEEE Trans. Emerg. Top. Comput., 2022)

Fast verification and public key storage optimization for unstructured lattice-based signatures. - Jean-Claude Bajard; Kazuhide Fukushima; Thomas Plantard; Arnaud Sipasseuth (J. Cryptogr. Eng., 2023)

On Digital Signatures Based on Group Actions: QROM Security and Ring Signatures. - Markus Bläser; Zhili Chen; Dung Hoang Duong; Antoine Joux; Tuong Ngoc Nguyen; Thomas Plantard; Youming Qiao; Willy Susilo; Gang Tang (PQCrypto (1), 2024)

On Polynomial Modular Number Systems over $ mathbb{Z}/{p} mathbb{Z} $. - Jean-Claude Bajard; Jérémy Marrez; Thomas Plantard; Pascal Véron (Adv. Math. Commun., 2024)

Diagonally dominant matrices for cryptography. - Andrea Lesavourey; Kazuhide Fukushima; Thomas Plantard; Arnaud Sipasseuth (IACR Commun. Cryptol., 2025)