TECHNICAL UNIVERSITY OF MUNICH
ABOUT
I am a Marie SkłodowskaCurie Fellow at the Technical University of Munich in the group of Professor Antonia WachterZeh and at Eindhoven University of Technology in the Mathematical Communication Theory group of Professor Alberto Ravagnani. I obtained my Ph.D. in Mathematics at the University of Zurich under the supervision of Professor Joachim Rosenthal. My research interests include cryptography, algebraic coding theory and number theory.
NEWS
 Excited to announce the special issue on codebased cryptography in Designs, Codes and Cryptography!
 Check out our new signature scheme CROSS using restricted errors. This is a round 1 candidate for the additional standardization call by NIST.
 Happy to be the main chair of CBCrypto 2024, an affiliated event with Eurocrypt 2024. See you in May in Zurich!
 Glad to be a group leader at the VTSwiss Coding theory and Cryptography Summer School!
 If you are interested in learning about codebased cryptography, check out our survey! If you have any comments or additions to the survey, write me an email, as we plan to update it regularly.
COAUTHORS

Gianira Alfarano, Marco Baldi,
Jessica Bariffi,
Massimo Battaglioni, Sebastian Bitzer,
Eimear Byrne,
Franco Chiaraluce, Niklas Gassner,
Markus Grassl, Marcus Greferath, Lukas Holzbaur,
AnnaLena Horlemann, Carmelo Interlando,
Patrick Karl,
Karan Khathuria,
Hedonliang Liu,
Georg Maringer,
Giacomo Micheli,
Alessio Pavoni, Edoardo Persichetti, Anmoal Porwal,
Alberto Ravagnani,
Julian Renner, Stefan Ritterhoff, Nicole Rohrer, Joachim Rosenthal,
Paolo Santini,
Thomas Schamberger,
Severin Schraven,
Jonas Schupp,
Simran Tinani, Antonia WachterZeh, Nadja Willenborg
PUBLICATIONS
JOURNAL PAPERS
 Nadja Willenborg, AnnaLena Horlemann, Violetta Weger. On the Number of tLeeErrorCorrecting Codes. Advances in Mathematics of Communications, 2023. arXiv
 Markus Grassl, AnnaLena Horlemann, Violetta Weger. The Subfield Metric and its Application to Quantum Error Correction. Journal of Algebra and its Applications, 2023.
 Giacomo Micheli, Severin Schraven, Simran Tinani, Violetta Weger. Geometric sieve over number fields for higher moments. Research in Number Theory, 2023.
 Eimear Byrne, Violetta Weger. Bounds in the Lee Metric and Optimal Codes. Finite Fields and Their Applications, Volume 87, 102151, 2023.
 Violetta Weger, Karan Khathuria, AnnaLena Horlemann, Massimo Battaglioni, Paolo Santini, Edoardo Persichetti. On the Hardness of the Lee Syndrome Decoding Problem. Advances in Mathematics of Communications, 2022.
 Niklas Gassner, Marcus Greferath, Joachim Rosenthal, Violetta Weger. Bounds for Coding Theory over Rings. Entropy, Volume 24, Issue 10, 2022.
 Eimear Byrne, AnnaLena Horlemann, Karan Khathuria, Violetta Weger. Density of Free Modules over Finite Chain Rings. Linear Algebra and its Applications, Volume 651, 2022
 Giacomo Micheli, Severin Schraven, Violetta Weger. Local to global principle for expected values. Journal of Number Theory, Volume 238, 2022. Video Abstract (and the Bloopers)
 Gianira Alfarano, Karan Khathuria, Violetta Weger. On single server private information retrieval in a coding theory perspective. Applicable Algebra in Engineering, Communication and Computing, 2021.
 Karan Khathuria, Joachim Rosenthal, Violetta Weger. Encryption scheme based on expanded ReedSolomon codes. Advances in Mathematics of Communications, Volume 15, Issue 2, pp 207218, 2021.
 AnnaLena HorlemannTrautmann, Violetta Weger. Information set decoding in the Lee metric with applications to cryptography. Advances in Mathematics of Communications, Volume 15, Nr 4, pp 677699, 2021.
 Carmelo Interlando, Karan Khathuria, Nicole Rohrer, Joachim Rosenthal, Violetta Weger. Generalization of the ballcollision algorithm. Journal of Algebra Combinatorics Discrete Structures and Applications, Volume 7, Issue 2, pp 195207, 2020.
 Karan Khathuria, Giacomo Micheli, Violetta Weger. On the algebraic structure of E_p^(m) and applications to cryptography. Applicable Algebra in Engineering, Communication and Computing, Volume 32, Issue 4, pp 495505, 2021.
 Giacomo Micheli, Violetta Weger. On rectangular unimodular matrices over the algebraic integers. SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, pp 425437, 2019.
 Giacomo Micheli, Violetta Weger. Cryptanalysis of the CLR Cryptosystem. Designs, Codes and Cryptography, Volume 87, Issue 5, pp 1069–1086, 2019.
CONFERENCE PROCEEDINGS
 Sebastian Bitzer, Alberto Ravagnani, Violetta Weger. WeightedHamming Metric for Parallel Channels. ISIT 2024. arXiv
 Marco Baldi, Sebastian Bitzer, Alessio Pavoni, Paolo Santini, Antonia WachterZeh, Violetta Weger. Zero Knowledge Protocols and Signatures from the Restricted Syndrome Decoding Problem. PKC 2024. Eprint
 Stefan Ritterhoff, Georg Maringer, Sebastian Bitzer, Violetta Weger, Patrick Karl, Thomas Schamberger, Jonas Schupp, Antonia WachterZeh. FuLeeca: Leemetric signature scheme. CBCrypto 2023. Lecture Notes in Computer Science, Springer.
 Marco Baldi, Sebastian Bitzer, Alessio Pavoni, Paolo Santini, Antonia WachterZeh, Violetta Weger. Generic Decoding of Restricted Errors. ISIT 2023.
 AnnaLena Horlemann, Violetta Weger, Nadja Willenborg. On the Density of Codes over Finite Chain Rings. ITW 2023.
 Sebastian Bitzer, Julian Renner, Antonia WachterZeh, Violetta Weger. Generic Decoding in the Cover Metric. ITW 2023
 Jessica Bariffi, Karan Khathuria, Violetta Weger. Information Set Decoding for LeeMetric Codes using Restricted Balls. CBCrypto 2022. Lecture Notes in Computer Science, Springer.
 Anmoal Porwal, Lukas Holzbaur, Hedongliang Liu, Julian Renner, Antonia WachterZeh, Violetta Weger. Interleaved Prange: A New Generic Decoder for Interleaved Codes. PQCrypto 2022. Lecture Notes in Computer Science, vol 13512. Springer, Cham.
 Karan Khathuria, Joachim Rosenthal, Violetta Weger. Weight Two Masking of the ReedSolomon Structure in Conjunction with List Decoding. Proceedings of MTNS2018, 2018.
BOOK CHAPTERS
 Violetta Weger, Niklas Gassner, Joachim Rosenthal. A survey on codebased cryptography. 2022 arXiv
PREPRINTS
 Jessica Bariffi, Violetta Weger. Better bounds on the minimal Lee distance. 2023 (Submitted) arXiv
 Marco Baldi, Massimo Battaglioni, Franco Chiaraluce, AnnaLena HorlemannTrautmann, Edoardo Persichetti, Paolo Santini, Violetta Weger. A New Path to Codebased Signatures via Identification Schemes with Restricted Errors. 2020 (Submitted) arXiv
NIST SUBMISSIONS
 CROSS: Codes and Restricted Objects Signature Scheme. Submitters: Marco Baldi, Alessandro Barenghi, Sebastian Bitzer, Patrick Karl, Felice Manganiello, Alessio Pavoni, Gerardo Pelosi, Paolo Santini, Jonas Schupp, Freeman Slaughter, Antonia WachterZeh, Violetta Weger. NIST PQC Call for Additional Digital Signature Schemes, 2023. Round 1 Submission.
 FuLeeca: A Leebased signature scheme. Stefan Ritterhoff, Sebastian Bitzer, Patrick Karl, Georg Maringer, Thomas Schamberger, Jonas Schupp, Georg Sigl, Antonia WachterZeh, Violetta Weger. NIST PQC Call for Additional Digital Signature Schemes, 2023. Round 1 Submission.
THESIS
 Ph.D. Thesis. Information Set Decoding in the Lee Metric and the Local to Global Principle for Densities. 2020.
 Master Thesis. A CodeBased Cryptosystem using GRS codes. 2017.
TALKS
 CROSS: signature scheme using restricted errors. AISEC: 3rd PQC Update, May 13, 2024, Munich, DE. Slides
 Open Problems in the Lee Metric. Effective Geometry and Algebra Seminar, March 29, 2024, Rennes, FR. Slides
 Open Problems in the Lee Metric. Séminaire Mathématiques, Discrètes, Codes et Cryptographie, March 28, 2024, Paris, FR. Slides
 A mathematical journey into codebased cryptography. Selected Topics in Science and Techology, January 24, 2024, Munich, DE. Slides
 Open Problems in the Lee Metric. Sabanci University Math Seminars, November 29, 2023, virtual. Slides
 Open Problems in CodeBased Cryptography. Colloquium on Coding Theory and Cryptography, November 8, 2023. Ghent, BE. Slides
 CROSS: Signature scheme with restricted errors. Deutsche Mathematiker Vereinigung, September 25, 2023. Ilmenau, DE. Slides
 Introduction to codebased signatures. Finite Geometry and Friends, September 20, 2023. Brussels, BE. Slides
 Recent Advances in Codebased Signatures. CAST: Quantentechnologie und Quantencomputerresistente Sicherheit, September 7, 2023. Darmstadt, DE. Slides
 The rise and fall of FuLeeca. 2nd Oxford Postquantum Cryptography Workshop, September 5, 2023. Oxford, GBR. Slides Video
 How to sign using restricted errors. LNT Doktorandenseminar, July 24, 2023. Munich, DE. Slides
 The search for the right support: better bounds for the Lee metric. SIAM AG23, July 13, 2023. Eindhoven, NL. Slides (Fighting the Mic) Video
 How to sign using restricted errors. 29th Nordic Congress of Mathematicians with EMS, July 3, 2023. Aalborg, DK. Slides
 The search for the right support: better bounds for the Lee metric. Fq15, June, 23, 2023. Paris, Fr. Slides
 The search for the right support: better bounds for the Lee metric. COD Seminar, May 16, 2023. Munich, DE. Slides
 Signature Scheme from Restricted Errors. CBCrypto 2023, April 22, 2023. Lyon, FR. Slides
 Recent Advances in Codebased Signatures. Selected Topics in Science and Techology, March 22, 2023. Munich, DE. Slides
 Recent Advances and Challenges in Codebased Signatures. CrossFyre 2022, October 7, 2022, Passau, DE. Slides
 On the Density of Free Codes over Finite Chain Rings. Combinatorics 22, June 3, 2022, Mantova, IT. Slides
 Bounds and optimal codes in the Lee metric. Arbeitsgemeinschaft in Codierungstheorie und Kryptographie, May 11, 2022, St.Gallen, CH. Slides
 Why the cover metric is the weirdest metric ever. COD Seminar, May 3, 2022, Munich, DE. Slides
 Bounds and optimal codes in the Lee metric. PICS Seminar, January 27, 2022, virtual. Slides
 Ringlinear codes. Doctoral Seminar, December 1, 2021, Munich, DE.Slides
 How to sign using a secret. COD Seminar, October 26, 2021, Munich, DE.Slides
 Behaviour of random ringlinear codes. ACCESS, October 5, 2021, virtual. Slides
 On the density of free codes over finite chain rings. SIAM AG21, August 17, 2021, virtual. Slides
 On the hardness of the Lee syndrome decoding problem. CBCrypto 2021, June 22, 2021, virtual.Slides
 The LocaltoGlobal Principle for Densities. UCD Algebra and Number Theory Seminar, April 15, 2021, virtual. Slides
 Information set decoding in the Lee metric. CBCrypto 2020, May 9, 2020, virtual.SlidesVideo
 Classical information theory. Quantum information seminar UZH, March 13, 2020, virtual.Slides
 Generalization of the ballcollision algorithm. COD Seminar, July 18, 2019, Munich, DE.Slides
 Generalization of the ballcollision algorithm. SIAM Conference on Applied Algebraic Geometry, July 9, 2019, Bern, CH.Slides
 Generalization of the ballcollision algorithm. CodeBased Cryptography Workshop, May 19, 2019, Darmstadt, DE.Slides
 What is... the McEliece system? Zurich Graduate Colloquium, November 20, 2018, Zurich, CH. Slides
 On the density of rectangular unimodular matrices over the ring of algebraic integers. Arbeitsgemeinschaft in Codierungstheorie und Kryptographie, June 6, 2018, Neuchatel, CH. Slides
 On the density of rectangular unimodular matrices over the ring of algebraic integers. Number theory and coding theory: Contemporary applications in security, May 31, 2018, Turku, FI. Slides
 Weight Two Masking in the McEliece Public Key System. SIAM Conference on Applied Algebraic Geometry, August 3, 2017, Atlanta, US. Slides
 Weight Two Masking in the McEliece System. Fq13, June 5, 2017, Gaeta, IT. Slides
 A CodeBased Cryptosystem using GRS Codes. Arbeitsgemeinschaft in Codierungstheorie und Kryptographie, December 07, 2016, Zurich, CH. Slides
PROGRAMS
Programs to compute the complexity of ISD algorithms for restricted errors. From the paper Generic Decoding of Restricted Errors
Programs to compute the complexity of ISD algorithms in the Lee metric. From the paper On the Hardness of the Lee Syndrome Decoding Problem.
MAGMA code for an attack on DHDP protocol over the ring E_p^m. From the paper On the algebraic structure of E_p^(m) and applications to cryptography.
CONTACT
Institute for Communications Engineering
TUM School of Computation, Information and Technology
Technical University of Munich
Munich, Germany