Algorithmic and Mathematical Cryptology

Computing Discrete Logarithms

Autori: Robert Granger, Antoine Joux
Pubblicato in: Computational Cryptography, Numero 1, 2021, Pagina/e 106-139, ISBN 9781108795937
Editore: Cambridge University Press

Security Limitations of Classical-Client Delegated Quantum Computing

Autori: Christian Badertscher, Alexandru Cojocaru, Léo Colisson, Elham Kashefi, Dominik Leichtle, Atul Mantri, Petros Wallden
Pubblicato in: 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, Numero 12492, 2020, Pagina/e 667-696, ISBN 978-3-030-64833-6
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-64834-3_23

A New Public-Key Cryptosystem via Mersenne Numbers

Autori: Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha
Pubblicato in: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part III, Numero 10993, 2018, Pagina/e 459-482, ISBN 978-3-319-96877-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-96878-0_16

Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves

Autori: Anand Kumar Narayanan
Pubblicato in: Arithmetic of Finite Fields - 7th International Workshop, WAIFI 2018, Bergen, Norway, June 14-16, 2018, Revised Selected Papers, Numero 11321, 2018, Pagina/e 74-91, ISBN 978-3-030-05152-5
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-05153-2_4

On Decoding Cohen-Haeupler-Schulman Tree Codes

Autori: Anand Kumar Narayanan, Matthew Weidner
Pubblicato in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Pagina/e 1337-1356, ISBN 978-1-61197-599-4
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.81

Simple Oblivious Transfer Protocols Compatible with Supersingular Isogenies

Autori: Vanessa Vitse
Pubblicato in: Progress in Cryptology – AFRICACRYPT 2019 - 11th International Conference on Cryptology in Africa, Rabat, Morocco, July 9–11, 2019, Proceedings, Numero 11627, 2019, Pagina/e 56-78, ISBN 978-3-030-23695-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-23696-0_4

Nearly Sparse Linear Algebra

Autori: Antoine Joux, Cécile Pierrot
Pubblicato in: Contemporary Developments in Finite Fields and Applications, 2016, Pagina/e 119-144, ISBN 978-981-4719-27-8
Editore: WORLD SCIENTIFIC
DOI: 10.1142/9789814719261_0008

Securing Quantum Computations in the NISQ Era

Autori: Elham Kashefi, Dominik Leichtle, Luka Music, Harold Ollivier
Pubblicato in: Arxiv, 2020
Editore: Arxiv

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

Autori: Eleni AGATHOCLEOUS
Pubblicato in: 2022
Editore: Arxiv

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

Autori: Ivanyos, Gabor; Joux, Antoine; Santha, Miklos
Pubblicato in: 2019
Editore: Arxiv

Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond

Autori: Espitau, Thomas; Kirchner, Paul; Fouque, Pierre-Alain
Pubblicato in: Arxiv, Numero 6, 2019
Editore: Arxiv

On the Hardness of the Finite Field Isomorphism Problem

Autori: Dipayan Das, Antoine Joux
Pubblicato in: Eprint, 2022
Editore: Eprint archive

Fully homomorphic encryption modulo Fermat numbers

Autori: Antoine Joux
Pubblicato in: Eprint, Numero 2019/187, 2019
Editore: IACR eprint

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

Autori: Javad Doliskani, Anand Kumar Narayanan, Éric Schost
Pubblicato in: ArXiv, 2017
Editore: ArXiv preprint server

Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms

Autori: Joux, Antoine; Pierrot, Cecile
Pubblicato in: https://hal.sorbonne-universite.fr/hal-02173688, Numero 1, 2019
Editore: IACR

Drinfeld modules may not be for isogeny based cryptography

Autori: Antoine Joux, Anand Kumar Narayanan
Pubblicato in: 2019
Editore: IACR

Normal and pseudonormal numbers

Autori: Nicolò Cangiotti, Daniele Taufer
Pubblicato in: Arxiv, 2021
Editore: Arxiv

A Small Subgroup Attack on Bitcoin Address Generation

Autori: Massimiliano Sala, Domenica Sogiorno, Daniele Taufer
Pubblicato in: Mathematics, Numero 8 (10), 2020, ISSN 2227-7390
Editore: MDPI
DOI: 10.3390/math8101645

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

Autori: Massimiliano Sala, Daniele Taufer
Pubblicato in: Int. J. Group Theory, 2022, ISSN 2251-7669
Editore: University of Isfahan

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

Autori: Faruk Göloğlu, Antoine Joux
Pubblicato in: Mathematics of Computation, 2018, Pagina/e 1, ISSN 0025-5718
Editore: American Mathematical Society
DOI: 10.1090/mcom/3404

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

Autori: Anand Kumar Narayanan
Pubblicato in: Finite Fields and Their Applications, Numero 54, 2018, Pagina/e 335-365, ISSN 1071-5797
Editore: Academic Press
DOI: 10.1016/j.ffa.2018.08.003

Polynomial Factorization over Finite Fields using Drinfeld Modules

Autori: Anand Kumar Narayanan
Pubblicato in: Newsletter of the London Mathematical Society, 2019, ISSN 2516-3841
Editore: London Mathematical Society

Optimal quantum-programmable projective measurement with linear optics

Autori: Ulysse Chabaud, Eleni Diamanti, Damian Markham, Elham Kashefi, Antoine Joux
Pubblicato in: Physical Review A, Numero 98/6, 2018, ISSN 2469-9926
Editore: American Physical Society
DOI: 10.1103/PhysRevA.98.062318

Certified lattice reduction

Autori: Thomas Espitau, Antoine Joux
Pubblicato in: Advances in Mathematics of Communications, Numero 14/1, 2020, Pagina/e 137-159, ISSN 1930-5338
Editore: American Institute of Mathematical Sciences
DOI: 10.3934/amc.2020011

Subquadratic Time Encodable Codes Beating the Gilbert–Varshamov Bound

Autori: Anand Kumar Narayanan, Matthew Weidner
Pubblicato in: IEEE Transactions on Information Theory, Numero 65/10, 2019, Pagina/e 6010-6021, ISSN 0018-9448
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2019.2930538

Verifying BQP Computations on Noisy Devices with Minimal Overhead

Autori: Dominik Leichtle; Luka Music; Elham Kashefi; Elham Kashefi; Harold Ollivier; Harold Ollivier
Pubblicato in: PRX Quantum, Numero 9, 2021, ISSN 2160-3308
Editore: American Physical Society
DOI: 10.1103/prxquantum.2.040302

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

Autori: Thibauld Feneuil, Antoine Joux, Matthieu Rivain
Pubblicato in: Lecture Notes in Computer Science - Crypto 2020, Numero 13510, 2022, ISSN 1611-3349
Editore: Springer

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

Autori: Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha
Pubblicato in: European Symposium on Algorithms 2022, 2022
Editore: DROPS

Loop-Abort Faults on Supersingular Isogeny Cryptosystems

Autori: Alexandre Gélin, Benjamin Wesolowski
Pubblicato in: 8th International Conference on Post-Quantum Cryptography (PQCrypto 2017), 2017, Pagina/e 93-106
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-59879-6_6

Parametrizations for Families of ECM-Friendly Curves

Autori: Alexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra
Pubblicato in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation - ISSAC '17, 2017, Pagina/e 165-171, ISBN 9781-450350648
Editore: ACM Press
DOI: 10.1145/3087604.3087606

A New Public-Key Cryptosystem via Mersenne Numbers

Autori: Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha
Pubblicato in: Advances in Cryptology - Crypto 2018, 2018
Editore: Springer

A crossbred algorithm for solving Boolean polynomial systems

Autori: Antoine Joux, Vanessa Vitse
Pubblicato in: Number-Theoretic Methods in Cryptology - First International Conference, NuTMiC 2017, 2018, Pagina/e 3-21
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-76620-1_1

Masking the GLP Lattice-Based Signature Scheme at Any Order

Autori: Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Benjamin Grégoire, Mélissa Rossi, Mehdi Tibouchi
Pubblicato in: Advances in Cryptology – EUROCRYPT 2018, 2018, Pagina/e 354-384
Editore: 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

Autori: Thomas Espitau, Pierre-Alain Fouque, Benoît Gérard, Mehdi Tibouchi
Pubblicato in: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17, 2017, Pagina/e 1857-1874, ISBN 9781-450349468
Editore: ACM Press
DOI: 10.1145/3133956.3134028

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

Autori: Gang Tang, Dung Hoang Duong, Antoine Joux, Thomas Plantard, Youming Qiao, Willy Susilo
Pubblicato in: Lecture Notes in Computer Science - Eurocrypt 2022, Numero 13277, 2022, Pagina/e 582-612, ISBN 978-3-031-07082-2
Editore: Springer Cham
DOI: 10.1007/978-3-031-07082-2_21

On a Dual/Hybrid Approach to Small Secret LWE

Autori: Thomas Espitau, Antoine Joux, Natalia Kharchenko
Pubblicato in: Lecture Notes in Computer Science INDOCRYPT 2020, Numero 12578, 2020, Pagina/e 440-462, ISBN 978-3-030-65276-0
Editore: Springer
DOI: 10.1007/978-3-030-65277-7_20

Pubblicazioni

Condividi questa pagina

Scarica