default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Peyrin
- > Home > Persons > Thomas Peyrin
Publications
- 2022
[j18]Sayandeep Saha, Mustafa Khairallah
, Thomas Peyrin:
Exploring Integrity of AEADs with Faults: Definitions and Constructions. IACR Trans. Symmetric Cryptol. 2022(4): 291-324 (2022)- [i66]Sayandeep Saha, Mustafa Khairallah, Thomas Peyrin:
Exploring Integrity of AEADs with Faults: Definitions and Constructions. IACR Cryptol. ePrint Arch. 2022: 1055 (2022) - 2021
- [c72]Anubhab Baksi, Shivam Bhasin, Jakub Breier, Mustafa Khairallah, Thomas Peyrin, Sumanta Sarkar, Siang Meng Sim:
DEFAULT: Cipher Level Resistance Against Differential Fault Attack. ASIACRYPT (2) 2021: 124-156 - [c71]Anupam Chattopadhyay, Mustafa Khairallah, Gaëtan Leurent, Zakaria Najm, Thomas Peyrin, Vesselin Velichkov:
On the Cost of ASIC Hardware Crackers: A SHA-1 Case Study. CT-RSA 2021: 657-681 - [i61]Anubhab Baksi, Shivam Bhasin, Jakub Breier, Mustafa Khairallah, Thomas Peyrin, Sumanta Sarkar, Siang Meng Sim:
DEFAULT: Cipher Level Resistance Against Differential Fault Attack. IACR Cryptol. ePrint Arch. 2021: 712 (2021) - 2020
- [j12]Tetsu Iwata, Mustafa Khairallah, Kazuhiko Minematsu, Thomas Peyrin:
Duel of the Titans: The Romulus and Remus Families of Lightweight AEAD Algorithms. IACR Trans. Symmetric Cryptol. 2020(1): 43-120 (2020) - [i54]Mustafa Khairallah, Thomas Peyrin, Anupam Chattopadhyay:
Preliminary Hardware Benchmarking of a Group of Round 2 NIST Lightweight AEAD Candidates. IACR Cryptol. ePrint Arch. 2020: 1459 (2020) - 2019
- [c66]Mustafa Khairallah, Xiaolu Hou, Zakaria Najm, Jakub Breier, Shivam Bhasin, Thomas Peyrin:
SoK: On DFA Vulnerabilities of Substitution-Permutation Networks. AsiaCCS 2019: 403-414 - [i53]Mustafa Khairallah, Xiaolu Hou, Zakaria Najm, Jakub Breier, Shivam Bhasin, Thomas Peyrin:
SoK : On DFA Vulnerabilities of Substitution-Permutation Networks. IACR Cryptol. ePrint Arch. 2019: 387 (2019) - [i50]Tetsu Iwata, Mustafa Khairallah, Kazuhiko Minematsu, Thomas Peyrin:
Duel of the Titans: The Romulus and Remus Families of Lightweight AEAD Algorithms. IACR Cryptol. ePrint Arch. 2019: 992 (2019) - 2018
- [c63]Anubhab Baksi, Shivam Bhasin, Jakub Breier, Mustafa Khairallah, Thomas Peyrin:
Protecting block ciphers against differential fault attacks without re-keying. HOST 2018: 191-194 - [c62]Mustafa Khairallah, Zakaria Najm, Anupam Chattopadhyay, Thomas Peyrin:
Crack me if you can: hardware acceleration bridging the gap between practical and theoretical cryptanalysis?: a Survey. SAMOS 2018: 167-172 - [i49]Anubhab Baksi, Shivam Bhasin, Jakub Breier, Mustafa Khairallah, Thomas Peyrin:
Protecting Block Ciphers against Differential Fault Attacks without Re-keying (Extended Version). IACR Cryptol. ePrint Arch. 2018: 85 (2018) - 2017
- [c58]Mustafa Khairallah, Anupam Chattopadhyay, Thomas Peyrin:
Looting the LUTs: FPGA Optimization of AES and AES-like Ciphers for Authenticated Encryption. INDOCRYPT 2017: 282-301 - [i42]Mustafa Khairallah, Anupam Chattopadhyay, Thomas Peyrin:
Looting the LUTs : FPGA Optimization of AES and AES-like Ciphers for Authenticated Encryption. IACR Cryptol. ePrint Arch. 2017: 1019 (2017)
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-16 19:26 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:
