Biasse, Jean-François
42  results:
Search for persons X
?
1

A Search-to-Decision Reduction for the Permutation Code Equ..:

, In: 2023 IEEE International Symposium on Information Theory (ISIT),
Biasse, Jean-Francois ; Micheli, Giacomo - p. 602-607 , 2023
 
?
2

LESS-FM: Fine-Tuning Signatures from the Code Equivalence P..:

, In: Post-Quantum Cryptography; Lecture Notes in Computer Science,
 
?
3

A framework for reducing the overhead of the quantum oracle..:

Biasse, Jean-François ; Pring, Benjamin
Journal of Mathematical Cryptology.  15 (2020)  1 - p. 143-156 , 2020
 
?
5

LESS is More: Code-Based Signatures Without Syndromes:

, In: Progress in Cryptology - AFRICACRYPT 2020; Lecture Notes in Computer Science,
 
?
6

On the quantum attacks against schemes relying on the hardn..:

Biasse, Jean-François ; Song, Fang
Journal of Mathematical Cryptology.  13 (2019)  3-4 - p. 151-168 , 2019
 
?
7

A Note on the Security of CSIDH:

, In: Progress in Cryptology – INDOCRYPT 2018; Lecture Notes in Computer Science,
 
?
9

Efficient quantum algorithms for computing class groups and..:

, In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms,
Biasse, Jean-François ; Song, Fang - p. 893-902 , 2016
 
?
10

AN L(1/3) ALGORITHM FOR IDEAL CLASS GROUP AND REGULATOR COM..:

BIASSE, JEAN-FRANÇOIS
Mathematics of Computation.  83 (2014)  288 - p. 2005-2031 , 2014
 
?
11

A polynomial time algorithm for computing the HNF of a modu..:

, In: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation,
 
?
15

Are Cryptosystems Based on Ideal Lattices Quantum-Safe?:

Biasse, Jean-Francois
https://digitalcommons.latech.edu/science-seminars/2018-2019/schedule/25.  , 2019
 
1-15