Dr. Shahram Rasoolzadeh
Ruhr University Bochum,
Faculty of Computer Science,
Chair for Symmetric Cryptography,
Universitätsstr. 150,
D-44801 Bochum.
Room: MC 1.41
Telephone: +49(0) 234 32 28126
Office Hours: By arrangement
E-Mail: shahram.rasoolzadeh@rub.de

Curriculum Vitae
- 02/2024 – Present: Post-Doctoral Researcher, Symmetric Cryptography Group, Faculty of Computer Science, Ruhr University Bochum, Bochum, Germany.
- 01/2021 – 01/2024: Post-Doctoral Researcher, Symmetric Cryptography, Digital Security Group, Radboad University, Nijmegen, The Netherlands.
- 11/2016 – 12/2020: PhD Research Assistant, Symmetric Cryptography & Embedded Security Groups, HGI, Ruhr University Bochum, Bochum, Germany.
- 01/2016 – 09/2016: Research Assistant, Simula@UiB, Simula Research Laboratory, Bergen, Norway.
- 09/2013 – 09/2015: M.Sc. in Electrical Engineering – Cryptography, Sharif University of Technology, Tehran, Iran.
- 09/2008 – 06/2013: B.Sc. in Electrical Engineering – Communication Systems, University of Tabriz, Tabriz, Iran.
Research Interests
- Design and Analysis of Symmetric Cryptographic Primitives,
- Boolean Functions and their Application in Symmetric Cryptography.
Teaching
- Symmetric Cryptanalysis (Fall 2024),
- Calculus & Probability Theory (Spring 2023) at Radboud University.
Academic Awards
- Best Paper Award from FSE/ToSC 2024, for the paper “Cryptanalysis of HALFLOOP Block Ciphers: Destroying HALFLOOP-24”, together with Gregor Leander & Lukas Stennes.
- Best Paper Award from ISeCure 2016, the Iranian Society of Cryptology Journal of Information Security, for the paper “Total Break of Zorro using Linear and Differential Attacks”, together with Zahra Ahmadian, Mahmoud Salmasizadeh, & Mohammad Reza Aref.
Publications
2023
Gregor Leander, Shahram Rasoolzadeh, Lukas Stennes:
Cryptanalysis of HALFLOOP Block Ciphers Destroying HALFLOOP-24. IACR Trans. Symmetric Cryptol. 2023(4): 58-82 (2023)
2022
[1]
N.-G. Leander und S. Rasoolzadeh, „Weak Tweak-Keys for the CRAFT Block Cipher“, IACR transactions on symmetric cryptology / International Association for Cryptologic Research, Bd. 2022, Nr. 1, S. 38–63, März 2022, doi: 10.46586/tosc.v2022.i1.38-63.
2021
[1]
N.-G. Leander, T. Moos, A. Moradi, und S. Rasoolzadeh, „The SPEEDY family of block ciphers: engineering an ultra low-latency cipher from gate level for secure processor architectures “, IACR transactions on cryptographic hardware and embedded systems, Bd. 2021, Nr. 4, S. 510–545, Aug. 2021, doi: 10.46586/tches.v2021.i4.510-545.
[2]
S. Rasoolzadeh, A. Rezaei Shahmirzadi, und A. Moradi, „Impeccable circuits III“, in 2021 IEEE International Test Conference – ITC 2021 –, Online, 2021, S. 163–169. doi: 10.1109/itc50571.2021.00024.
[3]
M. Eichlseder u. a., „PRINCEv2: more security for (almost) no overhead“, in Selected areas in cryptography, Online, 2021, Bd. 12804, S. 483–511. doi: 10.1007/978-3-030-81652-0_19.
[4]
S. Rasoolzadeh, A. Rezaei Shahmirzadi, und A. Moradi, „Impeccable circuits III“, 2021.
2020
[1]
A. Aghaie, A. Moradi, S. Rasoolzadeh, A. Rezaei Shahmirzadi, F. Schellenberg, und T. Schneider, „Impeccable circuits“, IEEE transactions on computers / Institute of Electrical and Electronics Engineers, Bd. 69, Nr. 3, S. 361–376, 2020, doi: 10.1109/tc.2019.2948617.
[2]
S. Rasoolzadeh, A. Moradi, und N.-G. Leander, „Hardware-oriented SPN block ciphers: fault injection countermeasures and low-latency designs“, Universitätsbibliothek, Ruhr-Universität Bochum, Bochum, 2020. doi: 10.13154/294-8069.
[3]
A. Rezaei Shahmirzadi, S. Rasoolzadeh, und A. Moradi, „Impeccable circuits II“, in 2020 57th ACM/IEEE Design Automation Conference (DAC 2020), Online, 2020, S. 1160–1165. doi: 10.1109/dac18072.2020.9218615.
[4]
M. Eichlseder, N.-G. Leander, und S. Rasoolzadeh, „Computing expected differential probability of (truncated) differentials and expected linear potential of (multidimensional) linear Hulls in SPN block ciphers“, in Progress in cryptology – INDOCRYPT 2020 , Bangalore, Dez. 2020, Bd. 12578, S. 345–369. doi: 10.1007/978-3-030-65277-7_16.
[5]
M. Eichlseder u. a., „PRINCEv2: more security for (almost) no overhead“, 2020. [Online]. Verfügbar unter: https://casa.rub.de/forschung/publikationen/detail/princev2-more-security-for-almost-no-overhead
2019
[1]
A. Rezaei Shahmirzadi, S. Rasoolzadeh, und A. Moradi, „Impeccable circuits II“, 28. November 2019. https://eprint.iacr.org/2019/1369.pdf
[2]
C. Beierle, N.-G. Leander, A. Moradi, und S. Rasoolzadeh, „CRAFT: Lightweight Tweakable Block Cipher with Efficient Protection Against DFA Attacks“, IACR transactions on symmetric cryptology / International Association for Cryptologic Research, Bd. 2019, Nr. 1, S. 5–45, 2019, doi: 10.13154/tosc.v2019.i1.5-45.
2017
[1]
A. Canteaut, E. Lambooij, S. Neves, S. Rasoolzadeh, Y. Sasaki, und M. Stevens, „Refined probability of differential characteristics including dependency between multiple rounds“, IACR transactions on symmetric cryptology / International Association for Cryptologic Research, Bd. 2017, Nr. 2, S. 203–227, Juni 2017, doi: 10.13154/tosc.v2017.i2.203-227.
[2]
S. Rasoolzadeh, Z. Ahmadian, M. Salmasizadeh, und M. R. Aref, „An improved truncated differential cryptanalysis of klein“, Tatra Mountains mathematical publications, Bd. 67, Nr. 1, S. 135–147, 2017, doi: 10.1515/tmmp-2016-0036.
[3]
S. Rasoolzadeh und H. Raddum, „Improved multi-dimensional meet-in-the-middle cryptanalysis of katan“, Tatra Mountains mathematical publications, Bd. 67, Nr. 1, S. 149–166, 2017, doi: 10.1515/tmmp-2016-0037.
[4]
V. Lallemand und S. Rasoolzadeh, „Differential cryptanalysis of 18-Round PRIDE“, in Progress in cryptology – INDOCRYPT 2017, Chennai, 2017, Bd. 10698, S. 126–146. doi: 10.1007/978-3-319-71667-1_7.
[5]
S. Rasoolzadeh und H. Raddum, „Faster key recovery attack on round-reduced PRINCE“, in Lightweight cryptography for security and privacy, Bd. 10098, A. Bogdanov, Hrsg. Springer, 2017, S. 3–17. doi: 10.1007/978-3-319-55714-4_1.
[6]
V. Lallemand und S. Rasoolzadeh, „Differential cryptanalysis of 18-round PRIDE“, 2017. https://eprint.iacr.org/2017/1017.pdf
2016
[1]
S. Rasoolzadeh und H. Raddum, „Cryptanalysis of PRINCE with minimal data“, in Progress in Cryptology – AFRICACRYPT 2016, Fes, Marocco, 2016, Bd. 9646, S. 109–126. doi: 10.1007/978-3-319-31517-1_6.
[2]
S. Rasoolzadeh und H. Raddum, „Cryptanalysis of 6-round PRINCE using 2 known plaintexts“, Cryptography and communications, 2016, Publiziert, [Online]. Verfügbar unter: https://eprint.iacr.org/2016/132.pdf
2014
[1]
S. Rasoolzadeh, Z. Ahmadian, M. Salmasizadeh, und M. Reza Aref, „Total break of zorro using linear and differential attacks“, The ISC international journal of information security, Bd. 6, Nr. 1, S. 23–24, 2014, [Online]. Verfügbar unter: https://eprint.iacr.org/2014/220.pdf