Get started
Author

Thomas Plantard

Selected RNS Bases for Modular Multiplication
2009 · J. C. Bajard, M. Kaihara, et al. · IEEE Symposium on Computer Arithmetic (ARITH) · 63
Efficient Word Size Modular Arithmetic
2021 · Thomas Plantard · IEEE Transactions on Emerging Topics in Computing · 56
Modular Number Systems: Beyond the Mersenne Family
2004 · Jean-Claude Bajard, Laurent Imbert, et al. · Lecture notes in computer science · 55
PDF
Fully Homomorphic Encryption Using Hidden Ideal Lattice
2013 · Thomas Plantard, Willy Susilo, et al. · IEEE Transactions on Information Forensics and Security · 45
Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms
2022 · Gang Tang, Dung Hoang Duong, et al. · Lecture notes in computer science · 42
Efficient RNS Bases for Cryptography
2005 · Jean-Claude Bajard, Nicolas Méloni, et al. · HAL · 35
PDF
RNS bases and conversions
2004 · Jean-Claude Bajard, Thomas Plantard · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 32
Arithmetic Operations in the Polynomial Modular Number System
2005 · J.-C. Bajard, L. Imbert, et al. · IEEE Symposium on Computer Arithmetic (ARITH) · 31
Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
2008 · Christophe Negre, Thomas Plantard · Lecture notes in computer science · 30
Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes
2012 · Zhenfei Zhang, Thomas Plantard, et al. · Lecture notes in computer science · 27
A Digital Signature Scheme Based on CVP ∞
2008 · Thomas Plantard, Willy Susilo, et al. · Springer eBooks · 20
PDF
Device Identification and Personal Data Attestation in Networks
2018 · Clémentine Gritti, Melek Önen, et al. · Research Online (University of Wollongong) · 19
On the CCA-1 Security of Somewhat Homomorphic Encryption over the Integers
2012 · Zhenfei Zhang, Thomas Plantard, et al. · Lecture notes in computer science · 19
Broadcast Attacks against Lattice-Based Cryptosystems
2009 · Thomas Plantard, Willy Susilo · Lecture notes in computer science · 19
Efficient multiplication in GF(p/sup k/) for elliptic curve cryptography
2004 · J.-C. Bajard, L. Imbert, et al. · IEEE Symposium on Computer Arithmetic (ARITH) · 19
RNS Arithmetic Approach in Lattice-Based Cryptography: Accelerating the "Rounding-off" Core Procedure
2015 · Jean-Claude Bajard, Julien Eynard, et al. · IEEE Symposium on Computer Arithmetic (ARITH) · 18
PDF
Efficient Dynamic Provable Data Possession with Public Verifiability and Data Privacy
2015 · Clémentine Gritti, Willy Susilo, et al. · Lecture notes in computer science · 17
Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy
2017 · Clémentine Gritti, Rongmao Chen, et al. · Lecture notes in computer science · 16
PDF
LLL for ideal lattices: re-evaluation of the security of Gentry–Halevi’s FHE scheme
2014 · Thomas Plantard, Willy Susilo, et al. · Designs Codes and Cryptography · 16
Creating a Challenge for Ideal Lattices.
2013 · Thomas Plantard, Michael Schneider · 15
Broadcast encryption with dealership
2015 · Clémentine Gritti, Willy Susilo, et al. · International Journal of Information Security · 13
Lattice Blind Signatures with Forward Security
2020 · Quoc Huy Le (20122287), Steven Duong (19585186), et al. · Research Online (University of Wollongong) · 11
Logarithmic size ring signatures without random oracles
2015 · Clémentine Gritti, Willy Susilo, et al. · IET Information Security · 11
Improvement of Lattice-Based Cryptography Using CRT
2010 · Thomas Plantard, Mike Rose, et al. · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · 11
Efficient regular modular exponentiation using multiplicative half-size splitting
2016 · Christophe Negre, Thomas Plantard · Journal of Cryptographic Engineering · 10
Works count: 79
Citation count: 804
H-index: 17
I10-index: 26
Year
Topic
Type