1. »
  2. Symmetric Cryptography
  3. »
  4. Personen
  5. »
  6. Dr. Christof Beierle

Dr. Christof Beierle

Symmetric cryptography

Staff

Address:
Ruhr-University Bochum
Faculty of Computer Science
Symmetric cryptography
Universitätsstr. 150
D-44801 Bochum

Room: Wasserstr.

Telephone: +49 (0)234 32 28214

Office Hours: By arrangement

E-Mail: christof.beierle@ruhr-uni-bochum.de

Research Interests

  •  De­sign and Ana­ly­sis of Sym­me­tric Cryptographic Pri­mi­ti­ves
  • Boolean functions

Teaching

  • Symmetric Cryptanalysis (videos) Winter 2020/21
  • Cryptography (tutor for isits AG, distance learning program) Summer 2020, Winter 2020/21, Summer 2021, Winter 2021/22
  • Dis­cre­te Ma­the­ma­tics II (ex­er­cises) Sum­mer 2015, Sum­mer 2016
  • Symmetric Cryptanalysis (exercises) Winter 2015/16, Winter 2016/17
  • Number Theory (exercises) Summer 2017
  • Seminar Symmetric Cryptography (supervised talks) Winter 2015/16, Summer 2016, Winter 2016/17, Summer 2017, Summer 2019, Summer 2021, Winter 2021/22, Summer 2022
  • Seminar Number Theory (supervised talks) Winter 2017/18

Awards and Recognition

  • SKINNY is selected as an ISO standard (ISO/IEC 18033-7:2022) for tweakable block ciphers
  • Best paper award for the article ”Improved differential-linear attacks with applications to ARX ciphers” (CRYPTO 2020, with Gregor Leander and Yosuke Todo)

Program Commitees/Editorial Boards

  • 2019-2022: Member of the editorial board of IACR Transactions on Symmetric Cryptology (ToSC)
  • 2021: Program committee member of the 12th International Workshop on Coding and Cryptography (WCC 2022)
  • 2022: Program commitee member of the 7th International Workshop on Boolean Functions and their Applications (BFA) 2022

Other

Journal Publications

[j01] G. N. Alfarano, C. Beierle, T. Isobe, S. Kölbl, and G. Leander. ShiftRows alternatives for AES-like ciphers and optimal cell permutations for Midori and Skinny. IACR Trans. Symmetric Cryptol., 2018(2):20–47, 2018.

[j02] C. Beierle, A. Canteaut, and G. Leander. Nonlinear approximations in cryptanalysis revisited. IACR Trans. Symmetric Cryptol., 2018(4):80–101, 2018.

[j03] C. Beierle, G. Leander, A. Moradi, and S. Rasoolzadeh. CRAFT: lightweight tweakable block cipher with efficient protection against DFA attacks. IACR Trans. Symmetric Cryptol., 2019(1):5–45, 2019.

[j04] C. Beierle, J. Jean, S. Kölbl, G. Leander, A. Moradi, T. Peyrin, Y. Sasaki, P. Sasdrich, and S. Sim. SKINNY-AEAD and SKINNY-Hash. IACR Trans. Symmetric Cryptol., 2020(S1):88–131, 2020.

[j05] C. Beierle, A. Biryukov, L. C. dos Santos, J. Großschädl, L. Perrin, A. Udovenko, V. Velichkov, and Q. Wang. Lightweight AEAD and hashing using the Sparkle permutation family. IACR Trans. Symmetric Cryptol., 2020(S1):208–261, 2020.

[j06] C. Beierle, A. Biryukov, and A. Udovenko. On degree-d zero-zum sets of full rank. Cryptogr. Commun., 12(4):685–710, 2020.

[j07] C. Beierle and G. Leander. 4-uniform permutations with null nonlinearity. Cryptogr. Commun., 12(6):1133–1141, 2020.

[j08] C. Beierle, M. Brinkmann, and G. Leander. Linearly self-equivalent APN permutations in small dimension. IEEE Trans. Inf. Theory, 67(7): 4863–4875, 2021.

[j09] C. Beierle and G. Leander. New instances of quadratic APN functions. IEEE Trans. Inf. Theory, 68(1): 670–678, 2022.

[j10] C. Beierle, G. Leander, and L. Perrin. Trims and extensions of quadratic APN functions. Des. Codes Cryptogr., 90(4): 1009–1036, 2022.

[j11] C. Beierle, C. Carlet, G. Leander, and L. Perrin. A further study of quadratic APN permutations in dimension nine. Finite Fields Their Appl., 81: 102049, 2022.

Publications in Peer-Reviewed Conference Proceedings (LNCS)

[c01] C. Beierle, P. Jovanovic, M. M. Lauridsen, G. Leander, and C. Rechberger. Analyzing permutations for AES-like ciphers: Understanding ShiftRows. In K. Nyberg, editor, CT-RSA 2015, volume 9048 of LNCS, pages 37–58. Springer, Heidelberg, 2015.

[c02] C. Beierle, T. Kranz, and G. Leander. Lightweight multiplication in GF(2 n ) with applications to MDS matrices. In M. Robshaw and J. Katz, editors, Advances in Cryptology – CRYPTO 2016, Part I, volume 9814 of LNCS, pages 625–653. Springer, Heidelberg, 2016.

[c03] C. Beierle, J. Jean, S. Kölbl, G. Leander, A. Moradi, T. Peyrin, Y. Sasaki, P. Sasdrich, and S. Sim. The SKINNY family of block ciphers and its low-latency variant MANTIS. In M. Robshaw and J. Katz, editors, Advances in Cryptology – CRYPTO 2016, Part II, volume 9815 of LNCS, pages 123–153. Springer, Heidelberg, 2016.

[c04] C. Beierle. Pen and paper arguments for SIMON and SIMON-like designs. In V. Zikas and R. De Prisco, editors, Security and Cryptography for Networks – 10th International Conference, SCN 2016, volume 9841 of LNCS, pages 431–446. Springer, Heidelberg, 2016.

[c05] C. Beierle, A. Canteaut, G. Leander, and Y. Rotella. Proving resistance against invariant attacks: How to choose the round constants. In J. Katz and H. Shacham, editors, Advances in Cryptology – CRYPTO 2017, Part II, volume 10402 of LNCS, pages 647–678. Springer, Heidelberg, 2017.

[c06] C. Beierle, A. Biryukov, L. C. dos Santos, J. Großschädl, L. Perrin, A. Udovenko, V. Velichkov, and Q. Wang. Alzette: a 64-bit ARX-box. In D. Micciancio and T. Ristenpart, editors, Advances in Cryptology – CRYPTO 2020, Part III, volume 12172 of LNCS, pages 419–448. Springer, Cham, 2020.

[c07] C. Beierle, G. Leander, and Y. Todo. Improved differential-linear attacks with applications to ARX ciphers. In D. Micciancio and T. Ristenpart, editors, Advances in Cryptology – CRYPTO 2020, Part III, volume 12172 of LNCS, pages 329–358. Springer, Cham, 2020.

[c08] C. Beierle, P. Derbez, G. Leander, G. Leurent, H. Raddum, Y. Rotella, D. Rupprecht, and L. Stennes. Cryptanalysis of the GPRS encryption algorithms GEA-1 and GEA-2. In A. Canteaut and F. Standaert, editors, Advances in Cryptology – EUROCRYPT 2021, Proceedings, volume 12697 of LNCS, pages 155–183. Springer, Cham, 2021.