Search

Your search keyword '"Plantard, Thomas"' showing total 183 results
Start Over Author "Plantard, Thomas"
183 results on '"Plantard, Thomas"'

1. On Digital Signatures Based on Group Actions: QROM Security and Ring Signatures

Author

Bläser, Markus, Chen, Zhili, Duong, Dung Hoang, Joux, Antoine, Nguyen, Tuong, Plantard, Thomas, Qiao, Youming, Susilo, Willy, Tang, Gang, Hartmanis, Juris, Founding Editor, van Leeuwen, Jan, Series Editor, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Kobsa, Alfred, Series Editor, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Nierstrasz, Oscar, Series Editor, Pandu Rangan, C., Editorial Board Member, Sudan, Madhu, Series Editor, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Weikum, Gerhard, Series Editor, Vardi, Moshe Y, Series Editor, Goos, Gerhard, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Saarinen, Markku-Juhani, editor, and Smith-Tone, Daniel, editor

Published
2024
Full Text
View/download PDF

5. Lattice Blind Signatures with Forward Security

Author

Le, Huy Quoc, Duong, Dung Hoang, Susilo, Willy, Tran, Ha Thanh Nguyen, Trinh, Viet Cuong, Pieprzyk, Josef, and Plantard, Thomas

Subjects
Computer Science - Cryptography and Security
Abstract

Blind signatures play an important role in both electronic cash and electronic voting systems. Blind signatures should be secure against various attacks (such as signature forgeries). The work puts a special attention to secret key exposure attacks, which totally break digital signatures. Signatures that resist secret key exposure attacks are called forward secure in the sense that disclosure of a current secret key does not compromise past secret keys. This means that forward-secure signatures must include a mechanism for secret-key evolution over time periods. This paper gives a construction of the first blind signature that is forward secure. The construction is based on the SIS assumption in the lattice setting. The core techniques applied are the binary tree data structure for the time periods and the trapdoor delegation for the key-evolution mechanism., Comment: ACISP 2020

Published
2020

6. On Polynomial Modular Number Systems over $\mathbb{Z}/p\mathbb{Z}$

Author

Bajard, Jean Claude, Marrez, Jérémy, Plantard, Thomas, and Véron, Pascal

Subjects
Computer Science - Data Structures and Algorithms, Mathematics - Number Theory
Abstract

Since their introduction in 2004, Polynomial Modular Number Systems (PMNS) have become a very interesting tool for implementing cryptosystems relying on modular arithmetic in a secure and efficient way. However, while their implementation is simple, their parameterization is not trivial and relies on a suitable choice of the polynomial on which the PMNS operates. The initial proposals were based on particular binomials and trinomials. But these polynomials do not always provide systems with interesting characteristics such as small digits, fast reduction, etc. In this work, we study a larger family of polynomials that can be exploited to design a safe and efficient PMNS. To do so, we first state a complete existence theorem for PMNS which provides bounds on the size of the digits for a generic polynomial, significantly improving previous bounds. Then, we present classes of suitable polynomials which provide numerous PMNS for safe and efficient arithmetic.

Published
2020
Full Text
View/download PDF

7. Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms

Author

Tang, Gang, Duong, Dung Hoang, Joux, Antoine, Plantard, Thomas, Qiao, Youming, Susilo, Willy, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Dunkelman, Orr, editor, and Dziembowski, Stefan, editor

Published
2022
Full Text
View/download PDF

8. Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy

Author

Gritti, Clementine, Chen, Rongmao, Susilo, Willy, and Plantard, Thomas

Subjects
Computer Science - Cryptography and Security
Abstract

Cloud storage services have become accessible and used by everyone. Nevertheless, stored data are dependable on the behavior of the cloud servers, and losses and damages often occur. One solution is to regularly audit the cloud servers in order to check the integrity of the stored data. The Dynamic Provable Data Possession scheme with Public Verifiability and Data Privacy presented in ACISP'15 is a straightforward design of such solution. However, this scheme is threatened by several attacks. In this paper, we carefully recall the definition of this scheme as well as explain how its security is dramatically menaced. Moreover, we proposed two new constructions for Dynamic Provable Data Possession scheme with Public Verifiability and Data Privacy based on the scheme presented in ACISP'15, one using Index Hash Tables and one based on Merkle Hash Trees. We show that the two schemes are secure and privacy-preserving in the random oracle model., Comment: ISPEC 2017

Published
2017

10. Short Principal Ideal Problem in multicubic fields

Author

Lesavourey Andrea, Plantard Thomas, and Susilo Willy

Subjects
public-key cryptography, post-quantum cryptography, number fields, ideal lattice, cryptanalysis, unit group, cubic field, Mathematics, QA1-939
Abstract

One family of candidates to build a post-quantum cryptosystem upon relies on euclidean lattices. In order to make such cryptosystems more efficient, one can consider special lattices with an additional algebraic structure such as ideal lattices. Ideal lattices can be seen as ideals in a number field. However recent progress in both quantum and classical computing showed that such cryptosystems can be cryptanalysed efficiently over some number fields. It is therefore important to study the security of such cryptosystems for other number fields in order to have a better understanding of the complexity of the underlying mathematical problems. We study in this paper the case of multicubic fields.

Published
2020
Full Text
View/download PDF

11. Using Freivalds’ Algorithm to Accelerate Lattice-Based Signature Verifications

Author

Sipasseuth, Arnaud, Plantard, Thomas, Susilo, Willy, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Heng, Swee-Huay, editor, and Lopez, Javier, editor

Published
2019
Full Text
View/download PDF

12. Improving the Security of the DRS Scheme with Uniformly Chosen Random Noise

Author

Sipasseuth, Arnaud, Plantard, Thomas, Susilo, Willy, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Pandu Rangan, C., Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Jang-Jaccard, Julian, editor, and Guo, Fuchun, editor

Published
2019
Full Text
View/download PDF

13. On Polynomial Modular Number Systems over $ \mathbb{Z}/{p}\mathbb{Z} $.

Author

Bajard, Jean-Claude, Marrez, Jérémy, Plantard, Thomas, and Véron, Pascal

Abstract

Since their introduction in 2004, Polynomial Modular Number Systems (PMNS) have become a very interesting tool for implementing cryptosystems relying on modular arithmetic in a secure and efficient way. However, while their implementation is simple, their parameterization is not trivial and relies on a suitable choice of the polynomial on which the PMNS operates. The initial proposals were based on particular binomials and trinomials. But these polynomials do not always provide systems with interesting characteristics such as small digits, fast reduction, etc.In this work, we study a larger family of polynomials that can be exploited to design a safe and efficient PMNS. To do so, we first state a complete existence theorem for PMNS which provides bounds on the size of the digits for a generic polynomial, significantly improving previous bounds. Then, we present classes of suitable polynomials which provide numerous PMNS for safe and efficient arithmetic. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

14. Enhancing Goldreich, Goldwasser and Halevi’s scheme with intersecting lattices

Author

Sipasseuth Arnaud, Plantard Thomas, and Susilo Willy

Subjects
lattice-based cryptosystem, lattice intersections, lattice reduction, ggh, 94b75, 94a60, 11h99, Mathematics, QA1-939
Abstract

We present a technique to enhance the security of the Goldreich, Goldwasser and Halevi (GGH) scheme. The security of GGH has practically been broken by lattice reduction techniques. Those attacks are successful due to the structure of the basis used in the secret key. In this work, we aim to present a new technique to alleviate this problem by modifying the public key which hides the structure of the corresponding private key. We intersect the initial lattice with a random one while keeping the initial lattice as our secret key and use the corresponding result of the intersection as the public key. We show sufficient evidence that this technique will make GGH implementations secure against the aforementioned attacks.

Published
2019
Full Text
View/download PDF

17. Enhanced Digital Signature Using RNS Digit Exponent Representation

Author

Plantard, Thomas, Robert, Jean-Marc, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Duquesne, Sylvain, editor, and Petkova-Nikova, Svetla, editor

Published
2016
Full Text
View/download PDF

18. Efficient Dynamic Provable Data Possession with Public Verifiability and Data Privacy

Author

Gritti, Clémentine, Susilo, Willy, Plantard, Thomas, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Foo, Ernest, editor, and Stebila, Douglas, editor

Published
2015
Full Text
View/download PDF

19. Efficient File Sharing in Electronic Health Records

Author

Gritti, Clémentine, Susilo, Willy, Plantard, Thomas, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Lopez, Javier, editor, and Wu, Yongdong, editor

Published
2015
Full Text
View/download PDF

24. Adaptive Precision Floating Point LLL

Author

Plantard, Thomas, Susilo, Willy, Zhang, Zhenfei, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Boyd, Colin, editor, and Simpson, Leonie, editor

Published
2013
Full Text
View/download PDF

25. Lattice Reduction for Modular Knapsack

Author

Plantard, Thomas, Susilo, Willy, Zhang, Zhenfei, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Knudsen, Lars R., editor, and Wu, Huapeng, editor

Published
2013
Full Text
View/download PDF

26. Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes

Author

Zhang, Zhenfei, Plantard, Thomas, Susilo, Willy, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Kim, Howon, editor

Published
2012
Full Text
View/download PDF

27. On the CCA-1 Security of Somewhat Homomorphic Encryption over the Integers

Author

Zhang, Zhenfei, Plantard, Thomas, Susilo, Willy, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ryan, Mark D., editor, Smyth, Ben, editor, and Wang, Guilin, editor

Published
2012
Full Text
View/download PDF

28. Improving BDD Cryptosystems in General Lattices

Author

Rose, Michael, Plantard, Thomas, Susilo, Willy, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Bao, Feng, editor, and Weng, Jian, editor

Published
2011
Full Text
View/download PDF

29. Improvement of Lattice-Based Cryptography Using CRT

Author

Plantard, Thomas, Rose, Mike, Susilo, Willy, Akan, Ozgur, Series editor, Bellavista, Paolo, Series editor, Cao, Jiannong, Series editor, Dressler, Falko, Series editor, Ferrari, Domenico, Series editor, Gerla, Mario, Series editor, Kobayashi, Hisashi, Series editor, Palazzo, Sergio, Series editor, Sahni, Sartaj, Series editor, Shen, Xuemin (Sherman), Series editor, Stan, Mircea, Series editor, Xiaohua, Jia, Series editor, Zomaya, Albert, Series editor, Coulson, Geoffrey, Series editor, Sergienko, Alexander, editor, Pascazio, Saverio, editor, and Villoresi, Paolo, editor

Published
2010
Full Text
View/download PDF

30. Recursive Lattice Reduction

Author

Plantard, Thomas, Susilo, Willy, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Garay, Juan A., editor, and De Prisco, Roberto, editor

Published
2010
Full Text
View/download PDF

31. Broadcast Attacks against Lattice-Based Cryptosystems

Author

Plantard, Thomas, Susilo, Willy, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Abdalla, Michel, editor, Pointcheval, David, editor, Fouque, Pierre-Alain, editor, and Vergnaud, Damien, editor

Published
2009
Full Text
View/download PDF

32. Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation

Author

Negre, Christophe, Plantard, Thomas, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Mu, Yi, editor, Susilo, Willy, editor, and Seberry, Jennifer, editor

Published
2008
Full Text
View/download PDF

33. A Digital Signature Scheme Based on CVP ∞

Author

Plantard, Thomas, Susilo, Willy, Win, Khin Than, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Cramer, Ronald, editor

Published
2008
Full Text
View/download PDF

34. Computing roots of polynomials over number fields using complex embeddings

Author

Lesavourey, Andrea, Plantard, Thomas, Susilo, Willy, Centre National de la Recherche Scientifique (CNRS), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Université de Rennes (UR), Institute of Cybersecurity and Cryptology (IC²), University of Wollongong [Australia], Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and Université de Rennes (UNIV-RENNES)

Subjects
ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]
Abstract

We explore a generic method to compute roots of polynomials over number fields through complex embeddings. We show how to use a structure of a relative extension to decode in a subfield. Additionally we describe several heuristic options to improve practical efficiency. We provide experimental data from our implementation, and compare our methods to the one implemented in \textsc{Pari/Gp}.

Published
2022

36. Modular Number Systems: Beyond the Mersenne Family

Author

Bajard, Jean-Claude, Imbert, Laurent, Plantard, Thomas, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Handschuh, Helena, editor, and Hasan, M. Anwar, editor

Published
2005
Full Text
View/download PDF

39. Borne sur le rayon de recouvrement et premier minima sur les réseaux à base diagonale dominante en norme infinie

Author

Lesavourey, Andrea, Fukushima, Kazuhide, Plantard, Thomas, Sipasseuth, Arnaud, Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), and KDDI R&D Laboratories Inc. [Saitama]

Subjects
[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-AO]Computer Science [cs]/Computer Arithmetic, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]
Abstract

Diagonally dominant matrices have been a prolific object for mathematical studies for over a century; to this day, it is still an active topic of research. In this paper, we study the lattices generated by diagonal dominant matrices. First, we provide a novel upper bound on their shortest vectors in the maximum norm, as well as a novel bound on the covering radius. Furthermore, we provide a new lattice vector reduction algorithm that gives a better proven worst-case reduction in maximum norm than Babai's Round-Off algorithm within a polynomial amount of operations. Those results expand the understanding of this particular mathematical object, and have some potential applications in modular arithmetic, cryptography and cryptanalysis.

Published
2022

43. ON THE SHORT PRINCIPAL IDEAL PROBLEM OVER SOME REAL KUMMER FIELDS

Author

Lesavourey, Andrea, Plantard, Thomas, Susilo, Willy, Université de Rennes (UR), Centre National de la Recherche Scientifique (CNRS), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Applied Cryptography and Implementation Security (CAPSULE), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), University of Wollongong [Australia], Université de Rennes (UNIV-RENNES), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), and Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique)

Subjects
Kummer fields, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Post-quantum cryptography, Ideal lattices, Short Principal Ideal Problem, Log-units
Abstract

Several cryptosystems using structured lattices have been believed to be quantum resistant. Their security can be linked to the hardness of solving the Shortest Vector Problem over module or ideal lattices. During the past few years it has been shown that the related problem of finding a short generator of a principal ideal can be solved in quantum polynomial time over cyclotomic fields, and classical polynomial time over a range of multiquadratic and multicubic fields. Hence, it is important to study as many as possible other number fields, to improve our knowledge of the aformentioned problems. In this paper we generalise the work done over multiquadratic and multicubic fields to a larger range of real Kummer extensions of prime exponent p. Moreover, we extend the analysis by studying the Log-unit lattice over these number fields, in comparison to already studied fields.

Published
2021

48. Device identification and personal data attestation in networks

Author

Gritti, Clémentine, Önen, Melek, Molva, Refik, Plantard, Thomas, Susilo, Willy, Gritti, Clémentine, Önen, Melek, Molva, Refik, Plantard, Thomas, and Susilo, Willy

Subjects
Internet of Things, Identity-Based Cryptography, Aggregate Signature
Published
2019

50. Generating Residue Number System Bases

Author

Bajard, Jean-Claude, primary, Fukushima, Kazuhide, additional, Kiyomoto, Shinsaku, additional, Plantard, Thomas, additional, Sipasseuth, Arnaud, additional, and Susilo, Willy, additional

Published
2021
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results