Zobrazeno 1 - 10 of 38 pro vyhledávání: '"Christophe Negre"'
1
Akademický článek
La plateforme nationale collaborative des repères de crues, bilan de 7 ans d’existence et perspectives
Autor: Anne-Marie Fromental, Anaïs Cazaubon, Mathias Daubas, Romain Lavie, Pierre-Jakez Le Dirach, Christophe Moulin, Christophe Negre, François Peron, Olivier Piotte, Rachel Puechberty, Mathieu Semery, Joris Valembois, Félicien Zuber
Publikováno v: LHB Hydroscience Journal (2024)
RÉSUMÉLa plateforme nationale collaborative des repères de crues, réalisée par le réseau Vigicrues, est destinée à collecter, partager des marques d’inondation de tous types et à en faciliter l’exploitation. Ces marques, qu’elles soien
Externí odkaz: https://doaj.org/article/2e4021afcaca41cab0d6f7d7c1eee8aa
Zobrazit plný text záznamu
2
Integer Functions Suitable for Homomorphic Encryption over Finite Fields
Autor: Ilia Iliashenko, Christophe Negre, Vincent Zucca
Publikováno v: WAHC@CCS
Fully Homomorphic Encryption (FHE) gives the ability to evaluate any function over encrypted data. However, despite numerous improvements during the last decade, the computational overhead caused by homomorphic computations is still very important. A
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a17d3943d75bc02faa587aa74c7493a0
https://doi.org/10.1145/3474366.3486925
Zobrazit plný text záznamu
5
Efficient Fixed Base Exponentiation and Scalar Multiplication based on a Multiplicative Splitting Exponent Recoding
Autor: Christophe Negre, Thomas Plantard, Jean-Marc Robert
Publikováno v: Journal of Cryptographic Engineering
Journal of Cryptographic Engineering, Springer, 2019, 9 (2), pp.115-136. ⟨10.1007/s13389-018-0196-7⟩
International audience; Digital Signature Algorithm (DSA) (resp. ECDSA) involves modular exponentiation (resp. scalar multiplication) of a public and known base by a random one-time exponent. In order to speed-up this operation, well-known methods ta
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac6d47a313037c3e639d379dcd769aca
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01926767
Zobrazit plný text záznamu
6
Efficient Leak Resistant Modular Exponentiation in RNS
Autor: Thomas Plantard, Christophe Negre, Andrea Lesavourey
Publikováno v: ARITH
24th Symposium on Computer Arithmetic
ARITH: Computer Arithmetic
ARITH: Computer Arithmetic, Jul 2017, London, United Kingdom. pp.156-163, ⟨10.1109/ARITH.2017.39⟩
International audience; The leak resistant arithmetic in RNS was introduced in 2004 to randomize RSA modular exponentiation. This randomization is meant to protect implementations on embedded device from side channel analysis. We propose in this pape
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c58ce658b135533d0414d63705ecbba0
https://doi.org/10.1109/arith.2017.39
Zobrazit plný text záznamu
7
Efficient Regular Modular Exponentiation Using Multiplicative Half-Size Splitting
Autor: Thomas Plantard, Christophe Negre
Publikováno v: Journal of Cryptographic Engineering
Journal of Cryptographic Engineering, Springer, 2017, 7 (3), pp.245-253. ⟨10.1007/s13389-016-0134-5⟩
In this paper, we consider efficient RSA modular exponentiations $$x^K \mod N$$ which are regular and constant time. We first review the multiplicative splitting of an integer x modulo N into two half-size integers. We then take advantage of this spl
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af7c4111b1e1fa5d3e596323d501d946
https://hal.archives-ouvertes.fr/hal-01185249/file/regular-expo-with-half-size-mult7.pdf
Zobrazit plný text záznamu
8
Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications
Autor: Christophe Negre, Andrea Lesavourey, Thomas Plantard
Publikováno v: 13th International Joint Conference on e-Business and Telecommunications
ICETE: International Joint Conference on e-Business and Telecommunications
ICETE: International Joint Conference on e-Business and Telecommunications, Jul 2016, Lisbon, Portugal. pp.368-375, ⟨10.5220/0005998503680375⟩
SECRYPT
International audience; Cryptographic operations performed on an embedded device are vulnerable to side channel analysis and particularly to differential and correlation power analysis. The basic protection against such attacks is to randomize the da
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::afcd8ede1ec25cb44bcd526b1dcda67a
https://hal.archives-ouvertes.fr/hal-01330898
Zobrazit plný text záznamu
9
Sequential multiplier with sub-linear gate complexity
Autor: M. Anwar Hasan, Christophe Negre
Publikováno v: Journal of Cryptographic Engineering
Journal of Cryptographic Engineering, Springer, 2012, 2 (2), pp.91-97. ⟨10.1007/s13389-012-0035-1⟩
International audience; In this article, we present a new sequential multiplier for extended binary finite fields. Like its existing counterparts, the proposed multiplier has a linear complexity in flip-flop or temporary storage requirements, but a s
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c45f35f7776c001199074f08c2085171
https://doi.org/10.1007/s13389-012-0035-1
Zobrazit plný text záznamu
10
Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
Autor: M. Anwar Hasan, Christophe Negre
Publikováno v: IEEE Transactions on Computers. 60:602-607
We study Dickson bases for binary field representation. Such a representation seems interesting when no optimal normal basis exists for the field. We express the product of two field elements as Toeplitz or Hankel matrix-vector products. This provide
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::1d5db14d96f0a2951cf487c33ba7c477
https://doi.org/10.1109/tc.2010.132
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje