Filtrer vos résultats
- 26
- 3
- 17
- 7
- 3
- 1
- 1
- 29
- 16
- 1
- 1
- 5
- 2
- 5
- 1
- 1
- 4
- 1
- 3
- 4
- 1
- 1
- 28
- 1
- 19
- 19
- 14
- 13
- 6
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 29
- 6
- 6
- 5
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
29 résultats
|
|
|
triés par
|
|
|
Computing Individual Discrete Logarithms Faster in GF$(p^n)$ with the NFS-DL AlgorithmAsiacrypt 2015, Steven Galbraith, Nov 2015, Auckland, New Zealand. pp 149-173, ⟨10.1007/978-3-662-48797-6_7⟩
Communication dans un congrès
hal-01157378v3
|
||
|
|
Improvements to the number field sieve for non-prime finite fields2022
Pré-publication, Document de travail
hal-01052449v5
|
||
|
|
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite FieldsEUROCRYPT 2015, Proceedings, Part {I}, Apr 2015, Sofia, Bulgaria. pp.129-155, ⟨10.1007/978-3-662-46800-5_6⟩
Communication dans un congrès
hal-01112879v2
|
||
|
|
A survey of elliptic curves for proof systemsDesigns, Codes and Cryptography, 2022, Special Issue: Mathematics of Zero-Knowledge, 91 (11), pp.3333-3378. ⟨10.1007/s10623-022-01135-y⟩
Article dans une revue
hal-03667798v2
|
||
|
|
Optimized and secure pairing-friendly elliptic curves suitable for one layer proof compositionCANS 2020 - 19th International Conference on Cryptology and Network Security, Dec 2020, Vienna / Virtual, Austria. pp.259-279, ⟨10.1007/978-3-030-65411-5_13⟩
Communication dans un congrès
hal-02962800v1
|
||
|
|
Solving discrete logarithms on a 170-bit MNT curve by pairing reductionSelected Areas in Cryptography -- SAC 2016, Aug 2016, St. Johns, Newfoundland, Canada. pp.559-578, ⟨10.1007/978-3-319-69453-5_30⟩
Communication dans un congrès
hal-01320496v2
|
||
|
|
The State of the Art in Integer Factoring and Breaking Public-Key CryptographyIEEE Security and Privacy Magazine, 2022, 20 (2), pp.80-86. ⟨10.1109/MSEC.2022.3141918⟩
Article dans une revue
hal-03691141v1
|
||
|
|
An Algebraic Point of View on the Generation of Pairing-Friendly Curves2023
Pré-publication, Document de travail
hal-04205681v1
|
||
|
|
Faster individual discrete logarithms in finite fields of composite extension degreeMathematics of Computation, 2019, 88 (317), pp.1273-1301. ⟨10.1090/mcom/3376⟩
Article dans une revue
hal-01341849v3
|
||
|
|
Improved Broadcast Encryption Scheme with Constant-Size CiphertextPairing 2012 - 5th International Conference Pairing-Based Cryptography, May 2012, Cologne, Germany. pp.196-202, ⟨10.1007/978-3-642-36334-4_12⟩
Communication dans un congrès
hal-01111663v1
|
||
|
|
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experimentAdvances in Cryptology – CRYPTO 2020, Aug 2020, Santa Barbara CA, United States. pp.62-91, ⟨10.1007/978-3-030-56880-1_3⟩
Communication dans un congrès
hal-02863525v2
|
||
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly ConstructionsPairing-Based Cryptography - Pairing 2012, May 2012, Cologne, Germany. pp.234-253, ⟨10.1007/978-3-642-36334-4_16⟩
Communication dans un congrès
istex
hal-00871327v1
|
|||
|
|
Co-factor clearing and subgroup membership testing on pairing-friendly curvesAFRICACRYPT 2022 - 13th International Conference on Cryptology, Jul 2022, Fes, Morocco. pp.518--536, ⟨10.1007/978-3-031-17433-9_22⟩
Communication dans un congrès
hal-03608264v3
|
||
|
|
Discrete LogarithmsNadia El Mrabet; Marc Joye. Guide to pairing-based cryptography, CRC Press - Taylor and Francis Group, pp.42, 2016, 9781498729505
Chapitre d'ouvrage
hal-01420485v2
|
||
Efficient multiplication in finite field extensions of degree 5AFRICACRYPT 2011 - 4th International Conference on Cryptology, Jul 2011, Dakar, Senegal. pp.188-205, ⟨10.1007/978-3-642-21969-6_12⟩
Communication dans un congrès
istex
inria-00609920v1
|
|||
|
|
Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplicationAlgebraic Geometry for Coding Theory and Cryptography, Feb 2016, Los Angeles, United States. pp.63-94, ⟨10.1007/978-3-319-63931-4_3⟩
Communication dans un congrès
hal-01421031v3
|
||
|
|
Computing discrete logarithms in $GF(p^6)$Selected Areas in Cryptography – SAC 2017, Aug 2017, Ottawa, Canada. pp.85-105, ⟨10.1007/978-3-319-72565-9_5⟩
Communication dans un congrès
hal-01624662v1
|
||
|
|
A New Family of Pairing-Friendly elliptic curvesInternational Workshop on the Arithmetic of Finite Fields - WAIFI, Lilya Budaghyan and Tor Helleseth, Jun 2018, Bergen, Norway. pp.43-57, ⟨10.1007/978-3-030-05153-2_2⟩
Communication dans un congrès
hal-01875361v1
|
||
|
|
On the Alpha Value of Polynomials in the Tower Number Field Sieve AlgorithmMathematical Cryptology, 2021, 1 (1), pp.1-39
Article dans une revue
hal-02263098v2
|
||
|
|
Arithmetic of pairings on algebraic curves for cryptographyCryptography and Security [cs.CR]. Ecole Normale Supérieure de Paris - ENS Paris, 2013. English. ⟨NNT : 2013ENSU0001⟩
Thèse
tel-00921940v1
|
||
|
|
Families of SNARK-friendly 2-chains of elliptic curvesAdvances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Colin Boyd, May 2022, Trondheim / Hybrid, Norway. pp.367-396, ⟨10.1007/978-3-031-07085-3_13⟩
Communication dans un congrès
hal-03371573v2
|
||
|
|
Breaking DLP in $GF(p^5)$ using 3-dimensional sieving2017
Pré-publication, Document de travail
hal-01568373v1
|
||
|
|
Nouveaux records de factorisation et de calcul de logarithme discretTechniques de l'Ingénieur, 2020, pp.17
Article dans une revue
hal-03045666v1
|
||
|
|
Four-Dimensional GLV via the Weil RestrictionAdvances in Cryptology - ASIACRYPT 2013 - 19th International Conference on the Theory and Application of Cryptology and Information Security, Satya Lokam, Dec 2013, Bengalore, India. pp.79-96, ⟨10.1007/978-3-642-42033-7_5⟩
Communication dans un congrès
hal-00864966v2
|
||
|
|
Algorithms for Outsourcing Pairing ComputationCARDIS 2014 - 13th Smart Card Research and Advanced Application Conference, Conservatoire National des Arts et Métiers (CNAM), Nov 2014, Paris, France. ⟨10.1007/978-3-319-16763-3_12⟩
Communication dans un congrès
hal-01084550v1
|
||
|
|
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computationDesigns, Codes and Cryptography, 2020, 88 (6), pp.1047-1081. ⟨10.1007/s10623-020-00727-w⟩
Article dans une revue
hal-02305051v2
|
||
|
|
Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic CurvesACNS - 11th International Conference on Applied Cryptography and Network Security - 2013, Jun 2013, Banff, Canada. pp.357-372, ⟨10.1007/978-3-642-38980-1_22⟩
Communication dans un congrès
hal-00812960v1
|
||
|
|
A short-list of pairing-friendly curves resistant to Special TNFS at the 128-bit security levelPKC 2020 - IACR International Conference on Practice and Theory of Public-Key Cryptography, Jun 2020, Edinburgh, United Kingdom. pp.535-564, ⟨10.1007/978-3-030-45388-6_19⟩
Communication dans un congrès
hal-02396352v2
|
||
|
|
Automated fragment formula annotation for electron ionisation, high resolution mass spectrometry: application to atmospheric measurements of halocarbonsJournal of Cheminformatics, 2021, 13 (78), pp.1-27. ⟨10.1186/s13321-021-00544-w⟩
Article dans une revue
hal-03176025v2
|