Filtrer vos résultats
- 22
- 20
- 1
- 21
- 15
- 4
- 1
- 1
- 1
- 1
- 43
- 7
- 1
- 1
- 2
- 1
- 3
- 1
- 2
- 2
- 1
- 3
- 3
- 3
- 3
- 1
- 2
- 1
- 3
- 1
- 2
- 1
- 2
- 1
- 3
- 38
- 5
- 43
- 5
- 4
- 4
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 43
- 7
- 6
- 6
- 6
- 5
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
43 résultats
|
|
|
triés par
|
|
|
On Polynomial Modular Number Systems over Z/pZ2020
Pré-publication, Document de travail
hal-02883341v1
|
||
|
|
PMNS for Efficient Arithmetic and Small Memory CostIEEE Transactions on Emerging Topics in Computing, 2022, 10 (3), pp.1263 - 1277. ⟨10.1109/tetc.2022.3187786⟩
Article dans une revue
hal-03768546v1
|
||
|
|
Cryptanalysis of Harari's Identification SchemeLecture Notes in Computer Science, 1995, Cryptography and Coding, 1025, pp.264-269. ⟨10.1007/3-540-60693-9_28⟩
Article dans une revue
hal-00680479v1
|
||
Utilisation de chaines d'additions euclidiennes pour la multiplication scalaire sur des courbes elliptiques munies d'endomorphismes efficaces.Journées Codage et Cryptographie 2017, Apr 2017, La Bresse, France
Communication dans un congrès
hal-01824008v1
|
|||
|
|
On the Non-linearity of Power FunctionsDesigns, Codes and Cryptography, 2005, 37, pp.31-43. ⟨10.1007/s10623-004-3803-9⟩
Article dans une revue
hal-00674664v1
|
||
Cryptographie : principes et mises en oeuvre - 2e édition revue et augmentéeHermès Sciences Publications, pp.462, 2012, Informatique, Jean-Charles Pomerol
Ouvrages
hal-00684475v1
|
|||
Partage d'un secretAu fil des maths, 2020, Le bulletin de l'APMEP, 538, pp.51-58/ISSN 2610-3702
Article dans une revue
hal-02876004v1
|
|||
Public key cryptography and coding theoryI. Woungang and S. Misra and S.C. Misra. Selected Topics in Information and Coding Theory, 7, World Scientific Publications, 2010
Chapitre d'ouvrage
hal-00674253v1
|
|||
|
|
A public key cryptosystem based upon euclidean addition chainsSETA 2010, Sep 2010, Paris, France. pp.284-297, ⟨10.1007/978-3-642-15874-2_24⟩
Communication dans un congrès
hal-00674252v1
|
||
|
|
Compact variable-base ECC scalar multiplication using Euclidean addition chains18th International Conference on Security and Cryptography (SECRYPT 2021), Jul 2021, Online Event, Italy. pp.531-539, ⟨10.5220/0010551705310539⟩
Communication dans un congrès
hal-03210582v1
|
||
|
|
Guest editorial for the special issue for Jacques WolfmannEditors: Yves Aubry and Claude Carlet and Philippe Langevin and Pascal Véron. Springer Verlag, vol. 3 (4), pp.113, 2011, Cryptography and Communications, ⟨10.1007/s12095-011-0056-0⟩
Ouvrages
hal-00682554v1
|
||
New Formal Proposal for Stealth3rd International Workshop on the Theory of Computer Viruses (TCV 2008), May 2008, Nancy, France
Communication dans un congrès
hal-00680324v1
|
|||
Twenty Years of Cryptography and Error-Correcting CodesSCI 2000, Aug 2000, Orlando, United States
Communication dans un congrès
hal-00680470v1
|
|||
|
|
Improved Identification Schemes Based on Error-Correcting CodesApplicable Algebra in Engineering, Communication and Computing, 1997, 8 (1), ⟨10.1007/s002000050053⟩
Article dans une revue
hal-00680477v1
|
||
|
|
Efficient modular operations using the adapted modular number systemJournal of Cryptographic Engineering, 2020, ⟨10.1007/s13389-019-00221-7⟩
Article dans une revue
hal-02486345v1
|
||
Fonction Booléennes équilibrées (II)[Research Report] GRIM-SCSSI. 1998
Rapport
hal-01279308v1
|
|||
|
|
Euclidean addition chains scalar multiplication on curves with efficient endomorphismJournal of Cryptographic Engineering, In press, ⟨10.1007/s13389-018-0190-0⟩
Article dans une revue
hal-01794402v1
|
||
|
|
PMNS for Cryptography : A Guided TourAdvances in Mathematics of Communications, In press, ⟨10.3934/amc.2023033⟩
Article dans une revue
hal-04195613v1
|
||
Cryptographie : Principes et mise en oeuvreHermès Sciences Publications, pp.414, 2005
Ouvrages
hal-00680345v1
|
|||
A Fast Identification SchemeInternational Symposium on Information Theory (ISIT'95), Sep 1995, Whistler, Canada
Communication dans un congrès
hal-00680509v1
|
|||
Cache timing attacks countermeasures and error detection in Euclidean addition chains based scalar multiplication algorithm for elliptic curvesIOLTS 2017, Jul 2017, Thessaloniki, Greece. pp.163-168, ⟨10.1109/IOLTS.2017.8046212⟩
Communication dans un congrès
hal-01618180v1
|
|||
Goppa Codes and Trace OperatorIEEE Transactions on Information Theory, 1998, 44 (1), pp.290-295. ⟨10.1109/18.651048⟩
Article dans une revue
hal-00680472v1
|
|||
|
|
Faster multiplication over ${\mathbb {F}}_2[X]$ using AVX512 instruction set and VPCLMULQDQ instructionJournal of Cryptographic Engineering, 2022, ⟨10.1007/s13389-021-00278-3⟩
Article dans une revue
hal-03520854v1
|
||
Efficient and secure modular operations using the Adapted Modular Number SystemJournées Codage et Cryptographie 2018, Oct 2018, Aussois, France
Communication dans un congrès
hal-01908596v1
|
|||
Goppa Codes defined from a Trace PolynomialThird International Conference on Finite Fields and Applications, Aug 1995, Glasgow, United Kingdom
Communication dans un congrès
hal-00680517v1
|
|||
|
|
True Dimension of Some Quadratic Binary Trace Goppa CodesDesigns, Codes and Cryptography, 2001, 24 (1), pp.81-97. ⟨10.1023/A:1011281431366⟩
Article dans une revue
istex
hal-00680454v1
|
||
|
|
On Polynomial Modular Number Systems over $ \mathbb{Z}/{p}\mathbb{Z} $Advances in Mathematics of Communications, 2024, 18 (3), pp.674-695. ⟨10.3934/amc.2022018⟩
Article dans une revue
hal-03611829v1
|
||
|
|
A zero knowledge identification scheme based on the q-ary SD problemSelected Areas in Cryptography, Aug 2010, Waterloo, Canada. pp.171-186, ⟨10.1007/978-3-642-19574-7_12⟩
Communication dans un congrès
hal-00674249v1
|
||
|
|
Randomization of Arithmetic over Polynomial Modular Number System26th IEEE International Symposium on Computer Arithmetic, Jun 2019, Kyoto, Japan. pp.199-206, ⟨10.1109/ARITH.2019.00048⟩
Communication dans un congrès
hal-02099713v1
|
||
Another Formal Proposal for StealthInternational Journal of Mathematical and Computational Science, 2008, 21, pp.158-164
Article dans une revue
hal-00680317v1
|
- 1
- 2