Thomas Plantard

• Actually, I deal with lattice theory for cryptography.
  Last papers on this themathic:
  • Recurcive Lattice Reduction : paper.pdf and Practical Result On Darmstad Challenge
  • Broadcast Attacks against Lattice-based Cryptosystems: paper.pdf.

• During my Ph.D., I worked on modular arithmetic and number system.
  Last papers on those themathics:
  • Selected RNS Bases for Modular Multiplication: paper.pdf.
  • Efficient modular arithmetic in Adapted Modular Number System using Lagrange representation: paper.pdf.

• Z. Zhang, PhD Student in Computer Science.
  • Fully Homomorphic Encryption.
• V. E. Tourloupis, Master of Computer Science - Research.
  • Optimising the Compact Knapsack Cryptographic Scheme using Lattice-Based Cryptography.

• M. Rose, Master of Computer Science - Research - 2011.
  • Lattice-Based Cryptography: A Practical Implementation. (thesis.pdf)
    
    

• On the CCA-1 Security of Somewhat Homomorphic Encryption over the Integers,
  Z. Zhang, T. Plantard and W. Susilo,
  Accepeted on January 11, 2012 to be published in Lecture Notes in Computer Science. Lecture Notes in Computer Science. Proceedings of Information Security Practice and Experience. 8th International Conference, ISPEC 2012, Hangzhou, China, April 9-12, 2012. (paper.pdf)
  
  
• Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes,
  Z. Zhang, T. Plantard and W. Susilo,
  Accepeted on October 31, 2011 to be published in Lecture Notes in Computer Science. Revised Selected Papers of Information Security and Cryptology - ICISC 2011. 14th International Conference, Seoul, Korea, November 30 - December 2, 2011. (paper.pdf)
  
  
• Improving BDD Cryptosystems in General Lattices,
  M. Rose, T. Plantard and W. Susilo,
  Lecture Notes in Computer Science, Volume 6672, 2011. Proceedings of Information Security Practice and Experience. 7th International Conference, ISPEC 2011, Guangzhou, China, May 30 - June 1, 2011, pages 152-167. (paper.pdf)
  
  
• Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation,
  J.-C. Bajard, C. Negre and T. Plantard,
  IEEE Transactions on Computers, Volume 59, Numero 12, December 2010, pages 1585-1597. (paper.pdf)
  
  
• Recursive Lattice Reduction,
  T. Plantard and W. Susilo,
  Lecture Notes in Computer Science, Volume 6280, 2010. Proceedings of Security and Cryptography for Networks. 7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010, pages 329-344. (paper.pdf,talk.pdf)
  
  
• Improvement of Lattice-based Cryptography using CRT,
  T. Plantard, M. Rose and W. Susilo,
  Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, Volume 36, 2010. Revised Selected Papers of Quantum Communication and Quantum Networking. First International Conference, QuantumComm 2009, Naples, Italy, October 26-30, 2009, pages 275-182. (paper.pdf)
  
  
• Selected RNS Bases for Modular Multiplication,
  J.-C. Bajard, M. Kaihara and T. Plantard,
  ARITH 19. 19th IEEE Symposium on Computer Arithmetic. Portland, Oregon, USA, June 8-10, 2009, pages 25-32. (paper.pdf)
  
  
• Broadcast Attacks against Lattice-based Cryptosystems,
  T. Plantard and W. Susilo,
  Lecture Notes in Computer Science, Volume 5536, 2009. Proceedings of Applied Cryptography and Network Security. 7th International Conference, ACNS 2009, Paris-Rocquencourt, France, June 2-5, 2009, pages 456-472. (paper.pdf,talk.pdf)
  
  
• Efficient Lattice-based Signature Scheme,
  T. Plantard, W. Susilo, K. T. Win and Q. Huang
  International Journal of Applied Cryptography (IJACT), Volume 1, Issue 2, 2008, pp 120-132. (paper.pdf)
  
  
• Efficient modular arithmetic in Adapted Modular Number System using Lagrange representation,
  C. Negre and T. Plantard
  Lecture Notes in Computer Science, Volume 5107, 2008. Proceedings of Information Security and Privacy. 13th Australasian Conference, ACISP 2008, Wollongong, Australia, July 7-9, 2008, pages 463-477. (paper.pdf,talk.pdf)
  
  
• A Digital Signature Scheme based on $CVP_\infty$,
  T. Plantard, W. Susilo and K. T. Win
  Lecture Notes in Computer Science, Volume 4939, 2008. Proceedings of Public Key Cryptography -PKC 2008. 11th International Workshop on Practice and Theory in Public-Key Cryptography, Barcelona, Spain, March 9-12, 2008, pages 288-307. (paper.pdf,talk.pdf)
  
  
• Subquadratic Binary Field Multiplier in Double Polynomial System,
  P. Giorgi, C. Negre and T. Plantard,
  SECRYPT 2007. The International Conference on Security and Cryptography. Barcelona, Spain, July 28-31, 2007, pages 229-236. (paper.pdf)
  
  
• Study of modular inversion in RNS,
  J.-C. Bajard, N. Meloni and T. Plantard,
  Advanced Signal Processing Algorithms, Architectures, and Implementations XV. Proceedings of SPIE, Volume 5910. San Diego, California, USA, July 31-August 4, 2005. (paper.pdf)
  
  
• Efficient RNS Bases for Cryptography,
  J.-C. Bajard, N. Meloni and T. Plantard,
  World Congress: Scientific Computation, Applied Mathematics and Simulation, IMACS'05. Paris, France, July 11-15, 2005. (paper.pdf)
  
  
• Arithmetic Operations in the Polynomial Modular Number System,
  J.-C. Bajard, L. Imbert and T. Plantard,
  ARITH 17, 17th IEEE Symposium on Computer Arithmetic. Cape Cod, Massachusetts, USA, June 27-29, 2005, pages 206-213. (paper.pdf,talk.pdf)
  
  
• Modular Number Systems: Beyond the Mersenne Family,
  J.-C. Bajard, L. Imbert and T. Plantard,
  Lecture Notes in Computer Science, Volume 3357, 2005. Revised Selected Papers of Selected Areas in Cryptography. 11th International Workshop, SAC 2004, Waterloo, Canada, August 9-10, 2004, pages 159-169. (paper.pdf,talk.pdf)
  
  
• RNS bases and conversions,
  J.-C. Bajard and T. Plantard,
  Advanced Signal Processing Algorithms, Architectures, and Implementations XIV. Proceedings of SPIE, Volume 5559. Denver, Colorado, USA, August 2-6, 2004, pages 60-69. (paper.pdf,talk.pdf)
  
  
• Improving euclidian division and modular reduction for some classes of divisors,
  J.-C. Bajard, L. Imbert and T. Plantard,
  Conference Record of the Thirty-Seventh Asilomar Conference on Signals, Systems and Computers, Pacific Grove, California, USA, November 9-12, 2003, pages 2218-2221. (paper.pdf)
  
  
• Efficient Multiplication in GF(p^k) for Elliptic Curve Cryptography,
  J.-C. Bajard, L. Imbert, C. Negre and T. Plantard,
  ARITH 16, 16th IEEE Symposium on Computer Arithmetic. Santiago de Compostela, Spain, June 15-18, 2003, pages 181-187. (paper.pdf)
  
  

• Title : "Arithmetique modulaire pour la cryptographie" (Modular arithmetic for cryptography)
  Thematic : Modular arithmetic, cryptography, number system, lattice theory.
  
• Directors : Jean-Claude Bajard, Laurent Imbert
  Grants : ACI Crypto OPAC (oct 2002 - oct 2005)
  Laboratory: LIRMM
  
• Defence: December 15, 2005. Montpellier, France.
  Pdf: phd.pdf, talk.pdf.
  
  

• Evidence-based medicine: a new paradigm for accurate radiotherapy treatment planning in the fight against cancer,
  S. Guatelli, T. Plantard and D. Cutajar
  URC Small Grants Scheme (2012)
• Optimal Lattice Reduction Tools for Protecting Future Cryptosystems,
  W. Susilo and T. Plantard
  National Computational Infrastructure Merit Allocation Scheme (2010)
• Post-quantum Cryptography: Protecting Counter-Terrorism Against Future Capabilities of Quantum Computers,
  W. Susilo and T. Plantard
  Department of the Prime Minister and Cabinet (2009-2011)
• Fuzzy-based cryptography and its applications,
  W. Susilo, Y. Mu, J. Seberry, W. Li, K. T. Win, Z. Zhou, T. Xia, T. Plantard, Q. Wu and L. McAven
  Research Infrastructure Block Grant (2007)
• Implementation of efficient new signature schemes,
  T. Plantard
  RDF Apllication - TITR (2007)