default search action
Shahram Rasoolzadeh
Person information
- affiliation: Radboud University Nijmegen, The Netherlands
- affiliation (former): Ruhr University Bochum, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Shahram Rasoolzadeh:
Addendum to Classification of All t-Resilient Boolean Functions with t + 4 Variables Classification of Quadratic and Cubic t-Resilient Boolean Functions with t + 5 Variables. IACR Trans. Symmetric Cryptol. 2024(3): 298-301 (2024) - [i22]Parisa Amiri-Eliasi, Yanis Belkheyar, Joan Daemen, Santosh Ghosh, Daniël Kuijsters, Alireza Mehrdad, Silvia Mella, Shahram Rasoolzadeh, Gilles Van Assche:
Koala: A Low-Latency Pseudorandom Function. IACR Cryptol. ePrint Arch. 2024: 1249 (2024) - [i21]Christina Boura, Shahram Rasoolzadeh, Dhiman Saha, Yosuke Todo:
Multiple-Tweak Differential Attack Against SCARF. IACR Cryptol. ePrint Arch. 2024: 1408 (2024) - 2023
- [j10]Yanis Belkheyar, Joan Daemen, Christoph Dobraunig, Santosh Ghosh, Shahram Rasoolzadeh:
BipBip: A Low-Latency Tweakable Block Cipher with Small Dimensions. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(1): 326-368 (2023) - [j9]Shahram Rasoolzadeh:
Classification of All t-Resilient Boolean Functions with t + 4 Variables. IACR Trans. Symmetric Cryptol. 2023(3): 213-226 (2023) - [j8]Gregor Leander, Shahram Rasoolzadeh, Lukas Stennes:
Cryptanalysis of HALFLOOP Block Ciphers Destroying HALFLOOP-24. IACR Trans. Symmetric Cryptol. 2023(4): 58-82 (2023) - [i20]Shahram Rasoolzadeh:
Classification of All t-Resilient Boolean Functions with t+4 Variables. IACR Cryptol. ePrint Arch. 2023: 638 (2023) - [i19]Yanis Belkheyar, Joan Daemen, Christoph Dobraunig, Santosh Ghosh, Shahram Rasoolzadeh:
Introducing two Low-Latency Cipher Families: Sonic and SuperSonic. IACR Cryptol. ePrint Arch. 2023: 878 (2023) - [i18]Gregor Leander, Shahram Rasoolzadeh, Lukas Stennes:
Cryptanalysis of HALFLOOP Block Ciphers: Destroying HALFLOOP-24. IACR Cryptol. ePrint Arch. 2023: 1314 (2023) - 2022
- [j7]Gregor Leander, Shahram Rasoolzadeh:
Weak Tweak-Keys for the CRAFT Block Cipher. IACR Trans. Symmetric Cryptol. 2022(1): 38-63 (2022) - [j6]Shahram Rasoolzadeh:
Low-Latency Boolean Functions and Bijective S-boxes. IACR Trans. Symmetric Cryptol. 2022(3): 403-447 (2022) - 2021
- [b1]Shahram Rasoolzadeh:
Hardware-oriented SPN block ciphers: fault injection countermeasures and low-latency designs. Ruhr University Bochum, Germany, 2021 - [j5]Gregor Leander, Thorben Moos, Amir Moradi, Shahram Rasoolzadeh:
The SPEEDY Family of Block Ciphers Engineering an Ultra Low-Latency Cipher from Gate Level for Secure Processor Architectures. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(4): 510-545 (2021) - [c7]Shahram Rasoolzadeh, Aein Rezaei Shahmirzadi, Amir Moradi:
Impeccable Circuits III. ITC 2021: 163-169 - [i17]Gregor Leander, Shahram Rasoolzadeh:
Two Sides of The Same Coin: Weak-Keys and More Efficient Variants of CRAFT. IACR Cryptol. ePrint Arch. 2021: 238 (2021) - [i16]Gregor Leander, Thorben Moos, Amir Moradi, Shahram Rasoolzadeh:
The SPEEDY Family of Block Ciphers - Engineering an Ultra Low-Latency Cipher from Gate Level for Secure Processor Architectures. IACR Cryptol. ePrint Arch. 2021: 960 (2021) - [i15]Shahram Rasoolzadeh, Aein Rezaei Shahmirzadi, Amir Moradi:
Impeccable Circuits III. IACR Cryptol. ePrint Arch. 2021: 1568 (2021) - 2020
- [j4]Anita Aghaie, Amir Moradi, Shahram Rasoolzadeh, Aein Rezaei Shahmirzadi, Falk Schellenberg, Tobias Schneider:
Impeccable Circuits. IEEE Trans. Computers 69(3): 361-376 (2020) - [c6]Aein Rezaei Shahmirzadi, Shahram Rasoolzadeh, Amir Moradi:
Impeccable Circuits II. DAC 2020: 1-6 - [c5]Maria Eichlseder, Gregor Leander, Shahram Rasoolzadeh:
Computing Expected Differential Probability of (Truncated) Differentials and Expected Linear Potential of (Multidimensional) Linear Hulls in SPN Block Ciphers. INDOCRYPT 2020: 345-369 - [c4]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. SAC 2020: 483-511 - [i14]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) - [i13]Maria Eichlseder, Gregor Leander, Shahram Rasoolzadeh:
Computing Expected Differential Probability of (Truncated) Differentials and Expected Linear Potential of (Multidimensional) Linear Hulls in SPN Block Ciphers. IACR Cryptol. ePrint Arch. 2020: 1356 (2020)
2010 – 2019
- 2019
- [j3]Christof Beierle, Gregor Leander, Amir Moradi, Shahram Rasoolzadeh:
CRAFT: Lightweight Tweakable Block Cipher with Efficient Protection Against DFA Attacks. IACR Trans. Symmetric Cryptol. 2019(1): 5-45 (2019) - [i12]Christof Beierle, Gregor Leander, Amir Moradi, Shahram Rasoolzadeh:
CRAFT: Lightweight Tweakable Block Cipher with Efficient Protection Against DFA Attacks. IACR Cryptol. ePrint Arch. 2019: 210 (2019) - [i11]Aein Rezaei Shahmirzadi, Shahram Rasoolzadeh, Amir Moradi:
Impeccable Circuits II. IACR Cryptol. ePrint Arch. 2019: 1369 (2019) - 2018
- [i10]Anita Aghaie, Amir Moradi, Shahram Rasoolzadeh, Falk Schellenberg, Tobias Schneider:
Impeccable Circuits. IACR Cryptol. ePrint Arch. 2018: 203 (2018) - 2017
- [j2]Anne Canteaut, Eran Lambooij, Samuel Neves, Shahram Rasoolzadeh, Yu Sasaki, Marc Stevens:
Refined Probability of Differential Characteristics Including Dependency Between Multiple Rounds. IACR Trans. Symmetric Cryptol. 2017(2): 203-227 (2017) - [c3]Virginie Lallemand, Shahram Rasoolzadeh:
Differential Cryptanalysis of 18-Round PRIDE. INDOCRYPT 2017: 126-146 - [i9]Anne Canteaut, Eran Lambooij, Samuel Neves, Shahram Rasoolzadeh, Yu Sasaki, Marc Stevens:
Refined Probability of Differential Characteristics Including Dependency Between Multiple Rounds. IACR Cryptol. ePrint Arch. 2017: 478 (2017) - [i8]Virginie Lallemand, Shahram Rasoolzadeh:
Differential Cryptanalysis of 18-Round PRIDE. IACR Cryptol. ePrint Arch. 2017: 1017 (2017) - 2016
- [c2]Shahram Rasoolzadeh, Håvard Raddum:
Cryptanalysis of PRINCE with Minimal Data. AFRICACRYPT 2016: 109-126 - [c1]Shahram Rasoolzadeh, Håvard Raddum:
Faster Key Recovery Attack on Round-Reduced PRINCE. LightSec 2016: 3-17 - [i7]Shahram Rasoolzadeh, Håvard Raddum:
Multidimensional Meet in the Middle Cryptanalysis of KATAN. IACR Cryptol. ePrint Arch. 2016: 77 (2016) - [i6]Shahram Rasoolzadeh, Håvard Raddum:
Cryptanalysis of PRINCE with Minimal Data. IACR Cryptol. ePrint Arch. 2016: 80 (2016) - [i5]Shahram Rasoolzadeh, Håvard Raddum:
Cryptanalysis of 6-round PRINCE using 2 Known Plaintexts. IACR Cryptol. ePrint Arch. 2016: 132 (2016) - [i4]Shahram Rasoolzadeh, Håvard Raddum:
Faster Key Recovery Attack on Round-Reduced PRINCE. IACR Cryptol. ePrint Arch. 2016: 828 (2016) - 2015
- [i3]Zahra Ahmadian, Shahram Rasoolzadeh, Mahmoud Salmasizadeh, Mohammad Reza Aref:
Automated Dynamic Cube Attack on Block Ciphers: Cryptanalysis of SIMON and KATAN. IACR Cryptol. ePrint Arch. 2015: 40 (2015) - 2014
- [j1]Shahram Rasoolzadeh, Zahra Ahmadian, Mahmoud Salmasizadeh, Mohammad Reza Aref:
Total break of Zorro using linear and differential attacks. ISC Int. J. Inf. Secur. 6(1): 23-34 (2014) - [i2]Shahram Rasoolzadeh, Zahra Ahmadian, Mahmoud Salmasizadeh, Mohammad Reza Aref:
Total Break of Zorro using Linear and Differential Attacks. IACR Cryptol. ePrint Arch. 2014: 220 (2014) - [i1]Shahram Rasoolzadeh, Zahra Ahmadian, Mahmoud Salmasizadeh, Mohammad Reza Aref:
An Improved Truncated Di fferential Cryptanalysis of KLEIN. IACR Cryptol. ePrint Arch. 2014: 485 (2014)
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-10-07 02:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint