Follow
Thomas Plantard
Thomas Plantard
PayPal
Verified email at paypal.com - Homepage
Title
Cited by
Cited by
Year
Selected RNS bases for modular multiplication
JC Bajard, M Kaihara, T Plantard
2009 19th IEEE Symposium on Computer Arithmetic, 25-32, 2009
802009
Modular number systems: Beyond the Mersenne family
JC Bajard, L Imbert, T Plantard
International Workshop on Selected Areas in Cryptography, 159-169, 2004
542004
Fully homomorphic encryption using hidden ideal lattice
T Plantard, W Susilo, Z Zhang
IEEE transactions on information forensics and security 8 (12), 2127-2137, 2013
522013
Efficient RNS bases for cryptography
JC Bajard, N Meloni, T Plantard
IMACS'05: World Congress: Scientific ComputationApplied Mathematics and …, 2005
482005
Efficient multiplication in GF (p/sup k/) for elliptic curve cryptography
JC Bajard, L Imbert, C Negre, T Plantard
Proceedings 2003 16th IEEE Symposium on Computer Arithmetic, 181-187, 2003
412003
RNS bases and conversions
JC Bajard, T Plantard
Advanced Signal Processing Algorithms, Architectures, and Implementations …, 2004
322004
Creating a challenge for ideal lattices
T Plantard, M Schneider
Cryptology ePrint Archive, 2013
292013
Reaction attack on outsourced computing with fully homomorphic encryption schemes
Z Zhang, T Plantard, W Susilo
International Conference on Information Security and Cryptology, 419-436, 2011
292011
Arithmetic operations in the polynomial modular number system
JC Bajard, L Imbert, T Plantard
17th IEEE Symposium on Computer Arithmetic (ARITH'05), 206-213, 2005
292005
A digital signature scheme based on CVP∞
T Plantard, W Susilo, KT Win
International Workshop on Public Key Cryptography, 288-307, 2008
272008
Efficient dynamic provable data possession with public verifiability and data privacy
C Gritti, W Susilo, T Plantard
Australasian Conference on Information Security and Privacy, 395-412, 2015
232015
On the CCA-1 security of somewhat homomorphic encryption over the integers
Z Zhang, T Plantard, W Susilo
International Conference on Information Security Practice and Experience …, 2012
232012
Efficient modular arithmetic in adapted modular number system using Lagrange representation
C Negre, T Plantard
Australasian Conference on Information Security and Privacy, 463-477, 2008
212008
RNS arithmetic approach in lattice-based cryptography: Accelerating the" rounding-off" core procedure
JC Bajard, J Eynard, N Merkiche, T Plantard
2015 IEEE 22nd Symposium on Computer Arithmetic, 113-120, 2015
192015
Arithmétique modulaire pour la cryptographie
T Plantard
Université Montpellier II-Sciences et Techniques du Languedoc, 2005
192005
Device Identification and Personal Data Attestation in Networks.
C Gritti, M Önen, R Molva, W Susilo, T Plantard
J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 9 (4), 1-25, 2018
182018
Broadcast attacks against lattice-based cryptosystems
T Plantard, W Susilo
International Conference on Applied Cryptography and Network Security, 456-472, 2009
182009
DRS: Diagonal dominant Reduction for lattice-based Signature
T Plantard, A Sipasseuth, C Dumondelle, W Susilo
PQC Standardization Conference, Round 1, 2018
152018
LLL for ideal lattices: re-evaluation of the security of Gentry–Halevi’s FHE scheme
T Plantard, W Susilo, Z Zhang
Designs, Codes and Cryptography 76 (2), 325-344, 2015
132015
Improving BDD cryptosystems in general lattices
M Rose, T Plantard, W Susilo
International Conference on Information Security Practice and Experience …, 2011
122011
The system can't perform the operation now. Try again later.
Articles 1–20