default search action
Baptiste Lambin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j5]Alex Biryukov
, Baptiste Lambin, Aleksei Udovenko
Cryptanalysis of ARX-based White-box Implementations. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(3): 97-135 (2023) - [c5]Baptiste Lambin
Pitfalls and Shortcomings for Decompositions and Alignment. EUROCRYPT (4) 2023: 318-347 - [d1]Baptiste Lambin
Supplementary code to "Pitfalls and Shortcomings for Decompositions and Alignment". Zenodo, 2023 - [i9]Baptiste Lambin, Gregor Leander, Patrick Neumann:
Pitfalls and Shortcomings for Decompositions and Alignment (Full Version). IACR Cryptol. ePrint Arch. 2023: 240 (2023) - 2022
- [j4]Patrick Derbez
Fast MILP Models for Division Property. IACR Trans. Symmetric Cryptol. 2022(2): 289-321 (2022) - [i8]Patrick Derbez
Fast MILP Models for Division Property. IACR Cryptol. ePrint Arch. 2022: 753 (2022) - 2021
- [c4]Phil Hebborn, Baptiste Lambin, Gregor Leander
Strong and Tight Security Guarantees Against Integral Distinguishers. ASIACRYPT (1) 2021: 362-391 - [i7]Phil Hebborn, Baptiste Lambin, Gregor Leander, Yosuke Todo:
Strong and Tight Security Guarantees against Integral Distinguishers. IACR Cryptol. ePrint Arch. 2021: 1502 (2021) - 2020
- [j3]Baptiste Lambin
Linearly equivalent S-boxes and the division property. Des. Codes Cryptogr. 88(10): 2207-2231 (2020) - [c3]Phil Hebborn, Baptiste Lambin, Gregor Leander
Lower Bounds on the Degree of Block Ciphers. ASIACRYPT (1) 2020: 537-566 - [c2]Dusan Bozilov, Maria Eichlseder
PRINCEv2 - More Security for (Almost) No Overhead. SAC 2020: 483-511 - [i6]Phil Hebborn, Baptiste Lambin, Gregor Leander, Yosuke Todo:
Lower Bounds on the Degree of Block Ciphers. IACR Cryptol. ePrint Arch. 2020: 1051 (2020) - [i5]Dusan Bozilov, Maria Eichlseder, Miroslav Knezevic, Baptiste Lambin, Gregor Leander, Thorben Moos, Ventzislav Nikov, Shahram Rasoolzadeh, Yosuke Todo, Friedrich Wiemer:
PRINCEv2 - More Security for (Almost) No Overhead. IACR Cryptol. ePrint Arch. 2020: 1269 (2020)
2010 – 2019
- 2019
- [b1]Baptiste Lambin:
Optimization of core components of block ciphers. (Optimisation des principaux composants des chiffrements par bloc). University of Rennes 1, France, 2019 - [j2]Patrick Derbez
Efficient Search for Optimal Diffusion Layers of Generalized Feistel Networks. IACR Trans. Symmetric Cryptol. 2019(2): 218-240 (2019) - [i4]Patrick Derbez
Variants of the AES Key Schedule for Better Truncated Differential Bounds. IACR Cryptol. ePrint Arch. 2019: 95 (2019) - [i3]Patrick Derbez
On Recovering Affine Encodings in White-Box Implementations. IACR Cryptol. ePrint Arch. 2019: 96 (2019) - [i2]Patrick Derbez
Linearly equivalent S-boxes and the Division Property. IACR Cryptol. ePrint Arch. 2019: 97 (2019) - [i1]Patrick Derbez
Efficient Search for Optimal Diffusion Layers of Generalized Feistel Networks. IACR Cryptol. ePrint Arch. 2019: 537 (2019) - 2018
- [j1]Patrick Derbez
On Recovering Affine Encodings in White-Box Implementations. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(3): 121-149 (2018) - [c1]Patrick Derbez, Pierre-Alain Fouque, Jérémy Jean, Baptiste Lambin:
Variants of the AES Key Schedule for Better Truncated Differential Bounds. SAC 2018: 27-49
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-11-05 20:57 CET 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: