Skip to Main content Skip to Navigation

hal-03691141v1  Journal articles
Fabrice BoudotPierrick GaudryAurore GuillevicNadia HeningerEmmanuel Thomé et al.  The State of the Art in Integer Factoring and Breaking Public-Key Cryptography
IEEE Security and Privacy Magazine, Institute of Electrical and Electronics Engineers, 2022, 20 (2), pp.80-86. ⟨10.1109/MSEC.2022.3141918⟩
hal-02388234v1  Conference papers
Elena AndreevaVirginie LallemandAntoon PurnalReza ReyhanitabarArnab Roy et al.  Forkcipher: A New Primitive for Authenticated Encryption of Very Short Messages
ASIACRYPT 2019 - 25th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2019, Kobe, Japan. pp.153-182, ⟨10.1007/978-3-030-34621-8_6⟩
hal-01593371v1  Journal articles
Marine Minier. Improving impossible-differential attacks against Rijndael-160 and Rijndael-224
Designs, Codes and Cryptography, Springer Verlag, 2017, 82 (1-2), pp.117 - 129. ⟨10.1007/s10623-016-0206-7⟩
hal-01299697v2  Journal articles
Masahiro IshiiJérémie DetreyPierrick GaudryAtsuo InomataKazutoshi Fujikawa. Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2017, 66 (12), pp.2019-2030. ⟨10.1109/TC.2017.2704082⟩
hal-01376934v2  Conference papers
Joshua FriedPierrick GaudryNadia HeningerEmmanuel Thomé. A kilobit hidden SNFS discrete logarithm computation
Advances in Cryptology – EUROCRYPT 2017, Apr 2017, Paris, France. pp.202-231, ⟨10.1007/978-3-319-56620-7_8⟩
hal-01930573v1  Journal articles
Aude Le GluherPierre-Jean Spaenlehauer. A Fast Randomized Geometric Algorithm for Computing Riemann-Roch Spaces
Mathematics of Computation, American Mathematical Society, 2020, 89, pp.2399-2433. ⟨10.1090/mcom/3517⟩
hal-00953684v1  Journal articles
Éric SchostPierre-Jean Spaenlehauer. A Quadratically Convergent Algorithm for Structured Low-Rank Approximation
Foundations of Computational Mathematics, Springer Verlag, 2016, 16 (2), pp.457-492. ⟨10.1007/s10208-015-9256-x⟩
hal-01314651v1  Conference papers
Jean-Charles FaugèrePierre-Jean SpaenlehauerJules Svartz. Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems
International Symposium on Symbolic and Algebraic Computation (ISSAC 2016), Jul 2016, Waterloo, Canada. pp.223-230, ⟨10.1145/2930889.2930927⟩
hal-01520021v1  Conference papers
Changbo ChenSvyatoslav CovanovFarnam MansouriMarc Moreno MazaNing Xie et al.  Parallel Integer Polynomial Multiplication
SYNASC 2016 - 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2016, Timisoara, Romania. pp.72 - 80, ⟨10.1109/SYNASC.2016.024⟩
hal-02066930v1  Conference papers
Véronique CortierPierrick GaudryStephane Glondu. Belenios: a simple private and verifiable electronic voting system
Foundations of Security, Protocols, and Equational Reasoning, 2019, Fredericksburg, Virgina, United States. pp.214-238, ⟨10.1007/978-3-030-19052-1_14⟩
hal-03220739v1  Conference papers
Cyrius NugierDiane Leblanc-AlbarelAgathe BlaiseSimon MassonPaul Huynh et al.  An Upcycling Tokenization Method for Credit Card Numbers
SECRYPT 2021 - 18th International Conference on Security and Cryptography, Jul 2021, Online, France
hal-03408015v1  Book sections
Nigel P SmartEmmanuel Thomé. History of Cryptographic Key Sizes
Joppe Bos; Martijn Stam. Computational Cryptography, 469, Cambridge University Press, 2021, London Mathematical Society Lecture Note Series, 9781108795937
hal-03671013v1  Conference papers
Loïc RouquetteDavid GeraultMarine MinierChristine Solnon. And Rijndael? Automatic Related-key Differential Analysis of Rijndael
AfricaCrypt 2022 - 13th International Conference on Cryptology AfricaCrypt, Jul 2022, Fes, Morocco
hal-01341849v3  Journal articles
Aurore Guillevic. Faster individual discrete logarithms in finite fields of composite extension degree
Mathematics of Computation, American Mathematical Society, 2019, 88 (317), pp.1273-1301. ⟨10.1090/mcom/3376⟩
hal-01320496v2  Conference papers
Aurore GuillevicFrançois MorainEmmanuel Thomé. Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
Selected Areas in Cryptography -- SAC 2016, Aug 2016, St. Johns, Newfoundland, Canada. pp.559-578, ⟨10.1007/978-3-319-69453-5_30⟩
hal-01593382v1  Conference papers
Marine MinierRaphael C.-W. Phan. Tuple Cryptanalysis: Slicing and Fusing Multisets
Paradigms in Cryptology – Mycrypt 2016, Dec 2016, Kuala Lumpur, Malaysia. pp.294-320, ⟨10.1007/978-3-319-61273-7⟩
hal-02945065v1  Journal articles
Hamid BoukerrouPaul HuynhVirginie LallemandBimal MandalMarine Minier. On the Feistel Counterpart of the Boomerang Connectivity Table
IACR Transactions on Symmetric Cryptology, Ruhr Universität Bochum, 2020, 2020 (1), pp.331-362. ⟨10.13154/tosc.v2020.i1.331-362⟩
hal-01293351v1  Book sections
Emmanuel Thomé. A modified block Lanczos algorithm with fewer vectors
Joppe W. Bos; Arjen K. Lenstra. Topics in Computational Number Theory inspired by Peter L. Montgomery, Cambridge University Press, pp.175-188, 2017, 978-1-107-10935-3. ⟨10.1017/9781316271575.008⟩
hal-01774587v2  Conference papers
Claude-Pierre JeannerodJean-Michel MullerPaul Zimmermann. On various ways to split a floating-point number
ARITH 2018 - 25th IEEE Symposium on Computer Arithmetic, Jun 2018, Amherst (MA), United States. pp.53-60, ⟨10.1109/ARITH.2018.8464793⟩