Joachim Rosenthal is Professor of Applied Mathematics in the Department of Mathematics at
the University of Zürich
and Adjunct Professor at the
University of Notre Dame.
He received the Diplom in Mathematics from the University of Basel in 1986 and the Ph.D. in Mathematics from Arizona State University in 1990.
During the academic year 1989/1990 he was a Lecturer at Washington University in St. Louis.
From 1990 until 2006 he has been with the Department of Mathematics at the University of Notre Dame, where he has been last "The Notre Dame Chair in Applied Mathematics" and Concurrent Professor of Electrical Engineering.
In the academic year 1994/1995 he spent a sabbatical year at CWI the Center for Mathematics and Computer Science in Amsterdam, The Netherlands. During the academic year 1999/2000 he was a Guest Professor at the Swiss Federal Institute of Technology in Lausanne, Switzerland, affiliated with the School of Computer & Communication Sciences .
His current research interests are in coding theory and cryptography. In coding theory he is interested in convolutional codes, LDPC codes and more general codes on graphs. In cryptography his main interest lies in the construction of new oneway trapdoor functions.
He is or has been on the editorial board of
Advances in Mathematics of Communications (AMC),
Journal of Algebra and Its Applications (JAA),
Journal of Mathematical Systems, Estimation, and Control,
Linear Algebra and its Applications,
Mathematics of Control, Signals, and Systems (MCSS),
SIAM Journal on Control and Optimization,
Systems and Control Letters,
In August 2002 he served as the Symposium Chair of the International Symposium on Mathematical Theory of Networks and Systems (MTNS).
I am married to Rebekka Rosenthal-Graber and we have 4 children.
|2018||Alessandro Verzasconi||An Investigation on Roos Bias in RC4 Key Scheduling Algorithm|
|2017||Nicole Gubser||Applications of Chinese Remainder Codes in Cryptography|
|2017||Violetta Weger||A Code-Based Cryptosystem using GRS codes|
|2017||Chiara Agnese Salvini||Algorithmic methods to efficiently solve quadratic equations|
|2016||Amos Cattaneo||An Overview of the Discrete Logarithm Problem over Finite Fields|
|2016||Sophie Leuenberger||Error-correcting pairs for the McEliece cryptosystem|
|2016||Christoph Gasche||Minimal unimodular Matrix Decomposition|
|2015||Dominique Negele||About Simple Equations in Endomorphism Semirings of a Finite Chain|
|2015||Martin Holzer||Finite Chain Rings, Finitely Generated Modules over Finite Chain Rings and Projective Hjelmslev Geometries|
|2015||Michael Hartmann||The Ajtai-Dwork Cryptosystem and Other Cryptosystems Based on Lattices|
|2015||Leila Mizrahi||Thoroughly Formalizing an Uncommom Construction of the Real Numbers|
|2015||Benjamin Häni||Geschlossene Zyklen von konjugierten Kegelschnitten in der endlichen projektiven Koordinatenebene der Ordnung 3|
|2015||Edoardo Dotti||Eisenstein Polynomials over Holomorphy Rings|
|2015||Christoph Irniger||General position of lines in projective spaces of low dimensions over a finite field|
|2015||Marko Seric||Computational Considerations in Network Coding on Plücker Embedded Subspace Codes|
|2015||Isabelle Raemy||Superregular Hankel Matrices Over Finite Fields: An Upper Bound of the Matrix Size and a Construction Algorithm|
|2015||Judith Keller||Big Intersections in Projective Space|
|2014||Mustafa Aylidere||Fully Homomorphic Encryption|
|2014||Milan Markovic||Faktorization of Natural Numbers Based on Quaternion Algebra Using Lipschitz Integers|
|2013||Helen Riedtmann||The Approximate Common Divisor Problem: Two Algorithmic Solutions|
|2013||Kevin Brand||NTRU: A lattice-based Cryptosystem and Attacks against it|
|2013||Regula Krapf||A complete proof of incompleteness|
|2013||Rahel Spiess||An overview of Edwards curves over finite fields|
|2013||Amaro Barreal Fernandez||Space-Time Code Constructions for Multiple-Input Multiple-Output Communication Systems|
|2012||Andrea De Giorgi||McEliece Cryptosystems|
|2011||Ian Hersberger||Coppersmith's Algorithm|
|2011||Karin Sommer||Gate Complexity of Boolean Functions|
|2009||Manuel Ribic||Matusumoto-Imai Tame-Transformation-Method Cryptosystem|
|2009||Vita Pasic||Distribution of the number of rational points on elliptic curves over finite fields|
|2009||Sandra Steiner||A multivariate appraoch to list decoding CRT codes|
|2009||Dominic Looser||Some cryptological applications of bit rotations|
|2008||Urs Wagner||Detection and Exploitation of Small Correlations in Stream Ciphers|
|2007||Andres Rüdiger Gentzen||Understanding The XTR-System|
|2007||Michele Casartelli||Semirings, Factoring and Tropical Algebra|
|2007||Marion Wimmer||List decoding of Chinese remainder theorem codes|
|2007||Richard Köppel||Efficient Tate Pairing Computation on Elliptic or Hyperelliptic Curves|
|2006||Helen Stassen||The Semigroup Action Problem for Right Multiplication Groups of Finite Simple Non-Moufang Bol Loops|
|2006||Ariel Amir||LDPC Codes over non-binary Alphabets|