Zobrazeno 1 - 10
of 126
pro vyhledávání: '"Jean Charles Faugère"'
Publikováno v:
Transactions on Cryptographic Hardware and Embedded Systems, Vol 2019, Iss 3 (2019)
In 2017, NIST shook the cryptographic world by starting a process for standardizing post-quantum cryptography. Sixty-four submissions have been considered for the first round of the on-going NIST Post-Quantum Cryptography (PQC) process. Multivariate
Externí odkaz:
https://doaj.org/article/15b55c47a4c54b6da6389d65060c29c3
Publikováno v:
Designs, Codes and Cryptography. 89:1335-1364
In this article, we present algebraic attacks against the Extension Field Cancellation ( $$\texttt {EFC}$$ ) scheme, a multivariate public-key encryption scheme which was published at PQCRYPTO’2016. First, we present a successful Grobner basis mess
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83076da165859f215ab6ddd95cd17d5d
https://doi.org/10.1007/s10623-021-00873-9
https://doi.org/10.1007/s10623-021-00873-9
Publikováno v:
Journal of Symbolic Computation
Journal of Symbolic Computation, Elsevier, 2022, 109, pp.1-30. ⟨10.1016/j.jsc.2021.07.002⟩
Journal of Symbolic Computation, 2022, 109, pp.1-30. ⟨10.1016/j.jsc.2021.07.002⟩
Journal of Symbolic Computation, Elsevier, 2022, 109, pp.1-30. ⟨10.1016/j.jsc.2021.07.002⟩
Journal of Symbolic Computation, 2022, 109, pp.1-30. ⟨10.1016/j.jsc.2021.07.002⟩
International audience; Sparse polynomial interpolation, sparse linear system solving or modular rational reconstruction are fundamental problems in Computer Algebra. They come down to computing linear recurrence relations of a sequence with the Berl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74711b14880703e71647a81e2da4b30b
http://arxiv.org/abs/2107.02582
http://arxiv.org/abs/2107.02582
Autor:
Jean-Charles Faugère, Philip Sibson, Jake Kennard, Richard Collins, Gaetano De Martino, Charles Shaw, Francesco Raffaelli, Robert Denman, Ludovic Perret, Chris Erven
Publikováno v:
Advanced Optical Technologies. 9:287-295
The “quantum threat” to our current, convenient cryptographic algorithms is getting closer, with demonstrable progress by commercial quantum computing efforts. It is now more important than ever that we combine all of our tools into a new quantum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9407f3718dd95c46941043724fbbb78
https://doi.org/10.1515/aot-2020-0021
https://doi.org/10.1515/aot-2020-0021
Autor:
Alexandre Wallet, Jean-Charles Faugère
Publikováno v:
Designs, Codes and Cryptography
Designs, Codes and Cryptography, 2018, 86, pp.2279-2314. ⟨10.1007/s10623-017-0449-y⟩
Designs, Codes and Cryptography, Springer Verlag, In press, ⟨10.1007/s10623-017-0449-y⟩
Designs, Codes and Cryptography, 2018, 86, pp.2279-2314. ⟨10.1007/s10623-017-0449-y⟩
Designs, Codes and Cryptography, Springer Verlag, In press, ⟨10.1007/s10623-017-0449-y⟩
International audience; Computing discrete logarithms is generically a difficult problem. For divisor class groups of curves defined over extension fields, a variant of the Index-Calculus called Decomposition attack is used, and it can be faster than
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6d6a94de340e28d3360509b2c2593b7
https://doi.org/10.1007/s10623-017-0449-y
https://doi.org/10.1007/s10623-017-0449-y
Autor:
Jean-Charles Faugère, Christian Eder
Publikováno v:
Journal of Symbolic Computation. 80:719-784
This paper is a survey on the area of signature-based Grobner basis algorithms that was initiated by Faugere's F5 algorithm in 2002. We explain the general ideas behind the usage of signatures. We show how to classify the various known variants by 3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f70fb71288f4a3f190d2b62939c993e2
https://doi.org/10.1016/j.jsc.2016.07.031
https://doi.org/10.1016/j.jsc.2016.07.031
Autor:
Jean-Charles Faugère, Chenqi Mou
Publikováno v:
Journal of Symbolic Computation
Journal of Symbolic Computation, Elsevier, 2017, 80 (3), pp.538-569. ⟨10.1016/j.jsc.2016.07.025⟩
Journal of Symbolic Computation, 2017, 80 (3), pp.538-569. ⟨10.1016/j.jsc.2016.07.025⟩
Journal of Symbolic Computation, Elsevier, 2017, 80 (3), pp.538-569. ⟨10.1016/j.jsc.2016.07.025⟩
Journal of Symbolic Computation, 2017, 80 (3), pp.538-569. ⟨10.1016/j.jsc.2016.07.025⟩
Given a zero-dimensional ideal I in K[x1,...,xn] of degree D, the transformation of the ordering of its Groebner basis from DRL to LEX is a key step in polynomial system solving and turns out to be the bottleneck of the whole solving process. Thus it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::614e0fac4527712e3917ee8091d2005c
https://doi.org/10.1016/j.jsc.2016.07.025
https://doi.org/10.1016/j.jsc.2016.07.025
Publikováno v:
ISSAC 2019-44th International Symposium on Symbolic and Algebraic Computation
ISSAC 2019-44th International Symposium on Symbolic and Algebraic Computation, Jul 2019, Beijing, China. pp.42-49, ⟨10.1145/3326229.3326248⟩
ISSAC
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation
ISSAC 2019-44th International Symposium on Symbolic and Algebraic Computation, Jul 2019, Beijing, China. pp.42-49, ⟨10.1145/3326229.3326248⟩
ISSAC
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation
International audience; Gröbner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ebe10a6d47fd67d73a8e141fa06f3d81
https://hal.inria.fr/hal-02002689
https://hal.inria.fr/hal-02002689
Publikováno v:
Journal of Symbolic Computation
Journal of Symbolic Computation, 2016, 76, pp.107-141. ⟨10.1016/j.jsc.2015.12.001⟩
Journal of Symbolic Computation, Elsevier, 2016, 76, pp.107-141. ⟨10.1016/j.jsc.2015.12.001⟩
Journal of Symbolic Computation, 2016, 76, pp.107-141. ⟨10.1016/j.jsc.2015.12.001⟩
Journal of Symbolic Computation, Elsevier, 2016, 76, pp.107-141. ⟨10.1016/j.jsc.2015.12.001⟩
International audience; Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights $W=(w_{1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5fb4157ede00052acbd45e2bd6638d1
https://doi.org/10.1016/j.jsc.2015.12.001
https://doi.org/10.1016/j.jsc.2015.12.001
Publikováno v:
ISSAC 2018-43rd International Symposium on Symbolic and Algebraic Computation
ISSAC 2018-43rd International Symposium on Symbolic and Algebraic Computation, Jul 2018, New York, United States. ⟨10.1145/3208976.3209018⟩
ISSAC
ISSAC 2018-43rd International Symposium on Symbolic and Algebraic Computation, Jul 2018, New York, United States. ⟨10.1145/3208976.3209018⟩
ISSAC
International audience; One of the biggest open problems in computational algebra is the design of efficient algorithms for Gröbner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05373f660ef16935d485afb967bf683a
https://hal.inria.fr/hal-01787423
https://hal.inria.fr/hal-01787423