Filtrer vos résultats
- 78
- 7
- 43
- 24
- 7
- 4
- 2
- 2
- 1
- 1
- 1
- 2
- 82
- 11
- 1
- 1
- 2
- 6
- 3
- 5
- 3
- 4
- 5
- 3
- 3
- 4
- 4
- 3
- 5
- 1
- 2
- 2
- 6
- 4
- 3
- 3
- 2
- 3
- 2
- 5
- 1
- 76
- 9
- 66
- 52
- 31
- 16
- 15
- 9
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 85
- 18
- 12
- 10
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
85 résultats
|
Breaking the encryption scheme of the Moscow Internet voting systemFinancial Cryptography and Data Security, 2020, Kota Kinabalu, Malaysia. pp.32-49, ⟨10.1007/978-3-030-51280-4_3⟩
Communication dans un congrès
hal-02266264v2
|
||
|
A toolbox for verifiable tally-hiding e-voting systemsESORICS 2022 - 27th European Symposium on Research in Computer Security, Sep 2022, Copenhague, Denmark. pp.631-652, ⟨10.1007/978-3-031-17146-8_31⟩
Communication dans un congrès
hal-03367930v2
|
||
|
An $L (1/3 + \varepsilon)$ Algorithm for the Discrete Logarithm Problem for Low Degree CurvesEurocrypt 2007, May 2007, Barcelona, Spain. pp.379-393
Communication dans un congrès
inria-00135324v1
|
||
|
The Twist-AUgmented technique for key exchange9th International Conference on Theory and Practice of Public Key Cryptology - PKC 2006, Apr 2006, New York, USA, pp.410-426
Communication dans un congrès
inria-00103433v1
|
||
|
Improved Complexity Bounds for Counting Points on Hyperelliptic CurvesFoundations of Computational Mathematics, 2019, 19 (3), pp.591-621. ⟨10.1007/s10208-018-9392-1⟩
Article dans une revue
hal-01613530v2
|
||
|
Integer factorization and discrete logarithm problems2014
Pré-publication, Document de travail
hal-01215553v1
|
||
|
Some ZK security proofs for Belenios2017
Pré-publication, Document de travail
hal-01576379v1
|
||
|
Factorization of a 768-bit RSA modulusAdvances in Cryptology – CRYPTO 2010, Aug 2010, Santa Barbara, United States. pp.333-350, ⟨10.1007/978-3-642-14623-7_18⟩
Communication dans un congrès
inria-00444693v2
|
||
|
Modular equations for hyperelliptic curvesMathematics of Computation, 2005, 74, pp.429-454
Article dans une revue
inria-00000627v1
|
||
|
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fieldsCRYPTO 2020 - 40th Annual International Cryptology Conference, Aug 2020, Santa Barbara / Virtual, United States. pp.32-61, ⟨10.1007/978-3-030-56880-1_2⟩
Communication dans un congrès
hal-02871839v1
|
||
RSA : la fin des clés de 768 bitsTechniques de l'Ingénieur, 2011, IN131, ⟨10.51257/a-v1-in131⟩
Article dans une revue
hal-00641592v1
|
|||
|
Verifiability Analysis of CHVote2018
Pré-publication, Document de travail
hal-03001923v1
|
||
|
A kilobit hidden SNFS discrete logarithm computationAdvances in Cryptology – EUROCRYPT 2017, Apr 2017, Paris, France. pp.202-231, ⟨10.1007/978-3-319-56620-7_8⟩
Communication dans un congrès
hal-01376934v2
|
||
|
Factorisation of RSA-220 with CADO-NFS2016
Pré-publication, Document de travail
hal-01315738v1
|
||
|
Belenios: a simple private and verifiable electronic voting systemJoshua D. Guttman; Carl E. Landwehr; José Meseguer; Dusko Pavlovic. Foundations of Security, Protocols, and Equational Reasoning - Essays Dedicated to Catherine A. Meadows, 11565, Springer, pp.214-238, 2019, LNCS, ⟨10.1007/978-3-030-19052-1_14⟩
Chapitre d'ouvrage
hal-02066930v1
|
||
|
Polynomial Systems Solving by Fast Linear Algebra2013
Pré-publication, Document de travail
hal-00816724v2
|
||
|
Themis: an On-Site Voting System with Systematic Cast-as-intended Verification and Partial AccountabilityCCS 2022 - The ACM Conference on Computer and Communications Security, Nov 2022, Los Angeles, United States. ⟨10.1145/3548606.3560563⟩
Communication dans un congrès
hal-03763294v2
|
||
|
Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operatorSIAM Journal on Computing, 2007, 36 (6), pp.1777-1806. ⟨10.1137/S0097539704443793⟩
Article dans une revue
inria-00103401v3
|
||
|
Fast genus 2 arithmetic based on Theta functionsJournal of Mathematical Cryptology, 2007, 1 (3), pp.243-265. ⟨10.1515/JMC.2007.012⟩
Article dans une revue
inria-00000625v2
|
||
|
Evaluation properties of symmetric polynomialsInternational Journal of Algebra and Computation, 2006, 16 (3), pp.505 - 523. ⟨10.1142/S0218196706003128⟩
Article dans une revue
inria-00000629v1
|
||
|
An extension of Satoh's algorithm and its implementationJournal of the Ramanujan Mathematical Society, 2000, 15, pp.281-318
Article dans une revue
inria-00512791v1
|
||
|
Finding secure curves with the Satoh-FGH algorithm and an early-abort strategyEurocrypt, 2001, Innsbruck, Austria. pp.14-29, ⟨10.1007/3-540-44987-6_2⟩
Communication dans un congrès
inria-00514426v1
|
||
|
The Tower Number Field SieveASIACRYPT 2015, International Association of Cryptologic Research, Nov 2015, Auckland, New Zealand. pp.31-58
Communication dans un congrès
hal-01155635v1
|
||
|
Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECMIEEE Transactions on Computers, 2017, 66 (12), pp.2019-2030. ⟨10.1109/TC.2017.2704082⟩
Article dans une revue
hal-01299697v2
|
||
|
Using Symmetries in the Index Calculus for Elliptic Curves Discrete LogarithmJournal of Cryptology, 2013, pp.1-40. ⟨10.1007/s00145-013-9158-5⟩
Article dans une revue
hal-00700555v3
|
||
|
Counting points on hyperelliptic curves over finite fieldsANTS-IV, 2000, Leiden, Netherlands. pp.313-332, ⟨10.1007/10722028_18⟩
Communication dans un congrès
inria-00512403v1
|
||
|
Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problemJournal of Symbolic Computation, 2009, 44 (12), pp.1690-1702. ⟨10.1016/j.jsc.2008.08.005⟩
Article dans une revue
inria-00337631v1
|
||
|
A low-memory parallel version of Matsuo, Chao and Tsujii's algorithmANTS-VI, 2004, Burlington, United States. pp.208-222, ⟨10.1007/978-3-540-24847-7_15⟩
Communication dans un congrès
inria-00514089v1
|
||
|
On the invariants of the quotients of the Jacobian of a curve of genus 2Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 14, Nov 2001, Melbourne, Australia. pp.373-386, ⟨10.1007/3-540-45624-4_39⟩
Communication dans un congrès
inria-00514434v1
|
||
|
An extension of Kedlaya's algorithm to superelliptic curvesAsiacrypt, 2001, Gold Coast, Australia. pp.480-494, ⟨10.1007/3-540-45682-1_28⟩
Communication dans un congrès
inria-00514826v1
|