Algorithmic and Mathematical Cryptology

Computing Discrete Logarithms

Autores: Robert Granger, Antoine Joux
Publicado en: Computational Cryptography, Edición 1, 2021, Página(s) 106-139, ISBN 9781108795937
Editor: Cambridge University Press

Security Limitations of Classical-Client Delegated Quantum Computing

Autores: Christian Badertscher, Alexandru Cojocaru, Léo Colisson, Elham Kashefi, Dominik Leichtle, Atul Mantri, Petros Wallden
Publicado en: Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7–11, 2020, Proceedings, Part II, Edición 12492, 2020, Página(s) 667-696, ISBN 978-3-030-64833-6
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-64834-3_23

A New Public-Key Cryptosystem via Mersenne Numbers

Autores: Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha
Publicado en: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part III, Edición 10993, 2018, Página(s) 459-482, ISBN 978-3-319-96877-3
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-96878-0_16

Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves

Autores: Anand Kumar Narayanan
Publicado en: Arithmetic of Finite Fields - 7th International Workshop, WAIFI 2018, Bergen, Norway, June 14-16, 2018, Revised Selected Papers, Edición 11321, 2018, Página(s) 74-91, ISBN 978-3-030-05152-5
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-05153-2_4

On Decoding Cohen-Haeupler-Schulman Tree Codes

Autores: Anand Kumar Narayanan, Matthew Weidner
Publicado en: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Página(s) 1337-1356, ISBN 978-1-61197-599-4
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.81

Simple Oblivious Transfer Protocols Compatible with Supersingular Isogenies

Autores: Vanessa Vitse
Publicado en: Progress in Cryptology – AFRICACRYPT 2019 - 11th International Conference on Cryptology in Africa, Rabat, Morocco, July 9–11, 2019, Proceedings, Edición 11627, 2019, Página(s) 56-78, ISBN 978-3-030-23695-3
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-23696-0_4

Nearly Sparse Linear Algebra

Autores: Antoine Joux, Cécile Pierrot
Publicado en: Contemporary Developments in Finite Fields and Applications, 2016, Página(s) 119-144, ISBN 978-981-4719-27-8
Editor: WORLD SCIENTIFIC
DOI: 10.1142/9789814719261_0008

Securing Quantum Computations in the NISQ Era

Autores: Elham Kashefi, Dominik Leichtle, Luka Music, Harold Ollivier
Publicado en: Arxiv, 2020
Editor: Arxiv

ON THE SELMER GROUP AND RANK OF A FAMILY OF ELLIPTIC CURVES AND CURVES OF GENUS ONE VIOLATING THE HASSE PRINCIPLE

Autores: Eleni AGATHOCLEOUS
Publicado en: 2022
Editor: Arxiv

Discrete logarithm and Diffie-Hellman problems in identity black-box groups

Autores: Ivanyos, Gabor; Joux, Antoine; Santha, Miklos
Publicado en: 2019
Editor: Arxiv

Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond

Autores: Espitau, Thomas; Kirchner, Paul; Fouque, Pierre-Alain
Publicado en: Arxiv, Edición 6, 2019
Editor: Arxiv

On the Hardness of the Finite Field Isomorphism Problem

Autores: Dipayan Das, Antoine Joux
Publicado en: Eprint, 2022
Editor: Eprint archive

Fully homomorphic encryption modulo Fermat numbers

Autores: Antoine Joux
Publicado en: Eprint, Edición 2019/187, 2019
Editor: IACR eprint

Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields

Autores: Javad Doliskani, Anand Kumar Narayanan, Éric Schost
Publicado en: ArXiv, 2017
Editor: ArXiv preprint server

Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms

Autores: Joux, Antoine; Pierrot, Cecile
Publicado en: https://hal.sorbonne-universite.fr/hal-02173688, Edición 1, 2019
Editor: IACR

Drinfeld modules may not be for isogeny based cryptography

Autores: Antoine Joux, Anand Kumar Narayanan
Publicado en: 2019
Editor: IACR

Normal and pseudonormal numbers

Autores: Nicolò Cangiotti, Daniele Taufer
Publicado en: Arxiv, 2021
Editor: Arxiv

A Small Subgroup Attack on Bitcoin Address Generation

Autores: Massimiliano Sala, Domenica Sogiorno, Daniele Taufer
Publicado en: Mathematics, Edición 8 (10), 2020, ISSN 2227-7390
Editor: MDPI
DOI: 10.3390/math8101645

A survey on the group of points arising from elliptic curves with a Weierstrass model over a ring

Autores: Massimiliano Sala, Daniele Taufer
Publicado en: Int. J. Group Theory, 2022, ISSN 2251-7669
Editor: University of Isfahan

A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms

Autores: Faruk Göloğlu, Antoine Joux
Publicado en: Mathematics of Computation, 2018, Página(s) 1, ISSN 0025-5718
Editor: American Mathematical Society
DOI: 10.1090/mcom/3404

Polynomial factorization over finite fields by computing Euler–Poincaré characteristics of Drinfeld modules

Autores: Anand Kumar Narayanan
Publicado en: Finite Fields and Their Applications, Edición 54, 2018, Página(s) 335-365, ISSN 1071-5797
Editor: Academic Press
DOI: 10.1016/j.ffa.2018.08.003

Polynomial Factorization over Finite Fields using Drinfeld Modules

Autores: Anand Kumar Narayanan
Publicado en: Newsletter of the London Mathematical Society, 2019, ISSN 2516-3841
Editor: London Mathematical Society

Optimal quantum-programmable projective measurement with linear optics

Autores: Ulysse Chabaud, Eleni Diamanti, Damian Markham, Elham Kashefi, Antoine Joux
Publicado en: Physical Review A, Edición 98/6, 2018, ISSN 2469-9926
Editor: American Physical Society
DOI: 10.1103/PhysRevA.98.062318

Certified lattice reduction

Autores: Thomas Espitau, Antoine Joux
Publicado en: Advances in Mathematics of Communications, Edición 14/1, 2020, Página(s) 137-159, ISSN 1930-5338
Editor: American Institute of Mathematical Sciences
DOI: 10.3934/amc.2020011

Subquadratic Time Encodable Codes Beating the Gilbert–Varshamov Bound

Autores: Anand Kumar Narayanan, Matthew Weidner
Publicado en: IEEE Transactions on Information Theory, Edición 65/10, 2019, Página(s) 6010-6021, ISSN 0018-9448
Editor: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2019.2930538

Verifying BQP Computations on Noisy Devices with Minimal Overhead

Autores: Dominik Leichtle; Luka Music; Elham Kashefi; Elham Kashefi; Harold Ollivier; Harold Ollivier
Publicado en: PRX Quantum, Edición 9, 2021, ISSN 2160-3308
Editor: American Physical Society
DOI: 10.1103/prxquantum.2.040302

Syndrome Decoding in the Head: Shorter Signatures from Zero-Knowledge Proofs

Autores: Thibauld Feneuil, Antoine Joux, Matthieu Rivain
Publicado en: Lecture Notes in Computer Science - Crypto 2020, Edición 13510, 2022, ISSN 1611-3349
Editor: Springer

Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming

Autores: Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha
Publicado en: European Symposium on Algorithms 2022, 2022
Editor: DROPS

Loop-Abort Faults on Supersingular Isogeny Cryptosystems

Autores: Alexandre Gélin, Benjamin Wesolowski
Publicado en: 8th International Conference on Post-Quantum Cryptography (PQCrypto 2017), 2017, Página(s) 93-106
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-59879-6_6

Parametrizations for Families of ECM-Friendly Curves

Autores: Alexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra
Publicado en: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation - ISSAC '17, 2017, Página(s) 165-171, ISBN 9781-450350648
Editor: ACM Press
DOI: 10.1145/3087604.3087606

A New Public-Key Cryptosystem via Mersenne Numbers

Autores: Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha
Publicado en: Advances in Cryptology - Crypto 2018, 2018
Editor: Springer

A crossbred algorithm for solving Boolean polynomial systems

Autores: Antoine Joux, Vanessa Vitse
Publicado en: Number-Theoretic Methods in Cryptology - First International Conference, NuTMiC 2017, 2018, Página(s) 3-21
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-76620-1_1

Masking the GLP Lattice-Based Signature Scheme at Any Order

Autores: Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Benjamin Grégoire, Mélissa Rossi, Mehdi Tibouchi
Publicado en: Advances in Cryptology – EUROCRYPT 2018, 2018, Página(s) 354-384
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-78375-8_12

Side-Channel Attacks on BLISS Lattice-Based Signatures - Exploiting Branch Tracing against strongSwan and Electromagnetic Emanations in Microcontrollers

Autores: Thomas Espitau, Pierre-Alain Fouque, Benoît Gérard, Mehdi Tibouchi
Publicado en: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17, 2017, Página(s) 1857-1874, ISBN 9781-450349468
Editor: ACM Press
DOI: 10.1145/3133956.3134028

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

Autores: Gang Tang, Dung Hoang Duong, Antoine Joux, Thomas Plantard, Youming Qiao, Willy Susilo
Publicado en: Lecture Notes in Computer Science - Eurocrypt 2022, Edición 13277, 2022, Página(s) 582-612, ISBN 978-3-031-07082-2
Editor: Springer Cham
DOI: 10.1007/978-3-031-07082-2_21

On a Dual/Hybrid Approach to Small Secret LWE

Autores: Thomas Espitau, Antoine Joux, Natalia Kharchenko
Publicado en: Lecture Notes in Computer Science INDOCRYPT 2020, Edición 12578, 2020, Página(s) 440-462, ISBN 978-3-030-65276-0
Editor: Springer
DOI: 10.1007/978-3-030-65277-7_20

Publicaciones

Compartir esta página

Descargar