default search action
Cédric Tavernier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Claude Carlet
, Abderrahman Daif
A masking method based on orthonormal spaces, protecting several bytes against both SCA and FIA with a reduced cost. J. Cryptogr. Eng. 14(2): 223-240 (2024) - [j8]Claude Carlet, Abderrahman Daif, Sylvain Guilley, Cédric Tavernier:
Quasi-linear masking against SCA and FIA, with cost amortization. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(1): 398-432 (2024) - [i8]Justine Paillet, Pierre-Augustin Berthet, Cédric Tavernier:
Masked Computation the Floor Function and its Application to the FALCON Signature. IACR Cryptol. ePrint Arch. 2024: 709 (2024) - 2023
- [c11]Marcel Fernandez, Grigory Kabatiansky, Sebastià Martín, Cédric Tavernier:
A constructive approach to multimedia codes with complete traceability resistant to δ-noise. ITW 2023: 254-259 - [i7]Claude Carlet, Abderrahman Daif, Sylvain Guilley, Cédric Tavernier:
Quasi-linear masking to protect against both SCA and FIA. IACR Cryptol. ePrint Arch. 2023: 406 (2023) - [i6]Pierre-Augustin Berthet, Cédric Tavernier, Jean-Luc Danger, Laurent Sauvage:
Quasi-linear Masking to Protect Kyber against both SCA and FIA. IACR Cryptol. ePrint Arch. 2023: 1220 (2023) - [i5]Claude Carlet, Abderrahman Daif, Sylvain Guilley, Cédric Tavernier:
A masking method based on orthonormal spaces, protecting several bytes against both SCA and FIA with a reduced cost. IACR Cryptol. ePrint Arch. 2023: 1746 (2023)
2010 – 2019
- 2019
- [j7]Claude Carlet, Abderrahman Daif
Polynomial direct sum masking to protect against both SCA and FIA. J. Cryptogr. Eng. 9(3): 303-312 (2019) - 2018
- [c10]Théophane Nicolas, Ronan Gaugne
Lift the veil of the block samples from the Warcq chariot burial with 3D digital technologies. DigitalHERITAGE/VSMM 2018: 1-8 - [i4]Claude Carlet, Abderrahman Daif, Sylvain Guilley, Cédric Tavernier:
Polynomial direct sum masking to protect against both SCA and FIA. IACR Cryptol. ePrint Arch. 2018: 531 (2018) - 2016
- [c9]Théophane Nicolas, Ronan Gaugne
Internal 3D Printing of Intricate Structures. EuroMed (1) 2016: 432-441 - 2015
- [j6]Théophane Nicolas, Ronan Gaugne
Touching and Interacting with Inaccessible Cultural Heritage. Presence Teleoperators Virtual Environ. 24(3): 265-277 (2015) - [c8]Claude Carlet, Abderrahman Daif, Jean-Luc Danger, Sylvain Guilley, Zakaria Najm, Xuan Thuy Ngo, Thibault Porteboeuf, Cédric Tavernier:
Optimized linear complementary codes implementation for hardware trojan prevention. ECCTD 2015: 1-4 - [c7]Grigory Kabatiansky, Serge G. Vladut, Cédric Tavernier:
On the Doubly Sparse Compressed Sensing Problem. IMACC 2015: 184-189 - [i3]Grigory Kabatiansky, Cédric Tavernier, Serge G. Vladut:
On the Doubly Sparse Compressed Sensing Problem. CoRR abs/1509.07145 (2015) - 2014
- [c6]Théophane Nicolas, Ronan Gaugne
Preservative Approach to Study Encased Archaeological Artefacts. EuroMed 2014: 332-341 - 2011
- [c5]Ilya Dumer
Soft-decision list decoding of Reed-Muller codes with linear complexity. ISIT 2011: 2303-2307 - 2010
- [c4]Alexander Barg, G. Robert Blakley, Grigory Kabatiansky, Cédric Tavernier:
Robust parent-identifying codes. ITW 2010: 1-4
2000 – 2009
- 2009
- [i2]Thomas Roche, Cédric Tavernier:
Multi-Linear cryptanalysis in Power Analysis Attacks MLPA. CoRR abs/0906.0237 (2009) - [i1]Thomas Roche, Cédric Tavernier:
Side-channel attacks based on linear approximations. IACR Cryptol. ePrint Arch. 2009: 269 (2009) - 2008
- [j5]Rafaël Fourquet, Cédric Tavernier:
An improved list decoding algorithm for the second order Reed-Muller codes and its applications. Des. Codes Cryptogr. 49(1-3): 323-340 (2008) - [j4]Ilya Dumer
List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity. IEEE Trans. Inf. Theory 54(10): 4488-4492 (2008) - [j3]Hervé Aïache, François Haettel, Laure Lebrun, Cédric Tavernier:
Improving security and performance of an Ad Hoc network through a multipath routing strategy. J. Comput. Virol. 4(4): 267-278 (2008) - [c3]Hervé Aïache, Cédric Tavernier, Corinne Sieux:
Reed-Solomon codes and multi-path strategies to improve privacy performance over ad hoc networks. ISWPC 2008: 430-435 - 2007
- [j2]Ilya Dumer
List decoding of the first-order binary Reed-Muller codes. Probl. Inf. Transm. 43(3): 225-232 (2007) - [c2]Ilya Dumer
Soft-Decision List Decoding with Linear Complexity for the First-Order Reed-Muller Codes. ISIT 2007: 1346-1349 - 2006
- [c1]Ilya Dumer
List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity. ISIT 2006: 138-142 - 2005
- [j1]Pascale Charpin, Enes Pasalic
On bent and semi-bent quadratic Boolean functions. IEEE Trans. Inf. Theory 51(12): 4286-4298 (2005) - 2004
- [b1]Cédric Tavernier:
Testeurs, problemes de reconstruction univaries et multivaries, et application a la cryptanalyse du DES. (Testing, univariate and multivariate reconstruction problems, and application to the DES cryptanalysis). École Polytechnique, Palaiseau, France, 2004
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: