Skip to content
BY 4.0 license Open Access Published by De Gruyter November 17, 2020

Editor’s Preface for the Second Annual MathCrypt Proceedings Volume

  • Jung Hee Cheon , Kristin Lauter and Yongsoo Song

In 2017, we decided to start the annual series of MathCrypt Workshops in order to encourage more mathematicians and computational number theorists to propose and work on hard problems in cryptography. This is the second volume of papers from our second annual MathCrypt conference hosted at Crypto 2019, on August 19, 2019 in Santa Barbara.

We were motivated to launch this series of workshops to attract more mathematicians to work on hard problems in cryptography. There is a gap in the publishing culture between mathematics and computer science which we hope to bridge with this effort. Mathematicians primarily recognize publications in journals, whereas cryptographers almost always publish their results quickly in proceedings volumes of conferences which are the most prestigious venues for the research area. Many mathematicians are not accustomed to the model of submitting a paper by the conference deadline, presenting the work at the conference, and publishing in the proceedings volume. We wanted to provide a regular annual venue for mathematicians to contribute to the cryptographic research community at this accelerated pace, and the Journal of Mathematical Cryptology was an ideal place and a willing partner to create this opportunity.

We are at a point in time where it is increasingly important for mathematicians to be involved in cryptography research, as we set out to determine the next generation of cryptographic systems based on hard math problems which can withstand attacks from a quantum computer once it is built. In 2017, NIST launched a 5-year international competition to determine post-quantum cryptosystems (PQC).

MathCrypt can play a complimentary role by encouraging mathematicians to work on and publish attacks on new proposals, including both preliminary results and also even results which represent the failure of a certain approach to effectively attack a new system. This creates the culture of sharing information on approaches which have been tried and their measure of success. Currently there is such a high bar for publishing papers with new attacks. Attacking the underlying hard math problems in cryptography is an extremely challenging endeavor, and so the incentives are not aligned to encourage new researchers and young researchers to work and commit themselves to this direction. The opportunity to publish intermediate results in venues like MathCrypt should help to de-risk this endeavor and encourage more mathematician to pursue these research directions.

The MathCrypt proceedings volumes are also intended as a place to publish proposals for new cryptographic systems based on new ideas for hard math problems. The post quantum era provides both an opportunity and a challenge to mathematicians to create new systems based on new ideas. When an idea for a hard math problem is first proposed, it can be hard to evaluate the long-term potential in the span of a few weeks during a short review cycle. Thus more established venues may be reluctant to accept such papers in their highly competitive process since they could be viewed as a risk if they are found to be weak proposals within a relatively short time span. MathCrypt provides a forum and community for discussion and publication of new proposals.

Significant funding opportunities exist, for example in the US with the National Science Foundation (NSF) SaTC cybersecurity program, and proposals for new systems and mathematical cryptography research directions may be good candidates for support from federal grants. In fact, a Program Officer from NSF spoke at the first MathCrypt workshop in August 2018 and encouraged participants to apply to the NSF SaTC program for potential support for their research.

The founders of MathCrypt, Jung Hee Cheon and Kristin Lauter, were joined by Yongsoo Song to form the Organizing Committee. The one-day workshop included 11 talks, representing the accepted papers. The program and full list of accepted papers are below. The Program Chairs are grateful to the program committee who worked hard to evaluate the submitted papers and did an outstanding job of selecting many papers worthy of presentation and publication. We hope MathCrypt will continue to be a successful conference and a prestigious venue for presentation of important mathematical results in cryptography which are published together in volumes of the Journal of Mathematical Cryptology.

On behalf of the Editors,

  Jung Hee Cheon (Seoul National University)

  Kristin Lauter (Microsoft Research)

  Yongsoo Song (Microsoft Research)

Accepted Papers & Program

Isogeny-based Cryptography

Chair: Kristin Lauter

  1. Trade-off between classical and quantum circuit size of the attack against CSIDH

    Jean-Francois Biasse (University of South Florida); Xavier Bonnetain (INRIA Paris); Benjamin Pring (University of South Florida); Andre Schrottenloher (INRIA Paris); William Youmans (University of South Florida)

  2. Towards isogeny-based password-authenticated key establishment

    Oleg Taraskin (Waves Platform); Vladimir Soukharev (Infosec Global); David Jao (University of Waterloo Department of Combinatorics and Optimization, Evolution Q); Jason LeGrow (University of Waterloo Department of Combinatorics and Optimization, Institute for Quantum Computing)

  3. Algebraic approaches for solving isogeny problems of prime power degrees

    Yasushi Takahashi (Fujitsu Laboratories Ltd.); Momonari Kudo (Kobe City College of Technology); Yasuhiko Ikematsu, Masaya Yasuda (Kyushu University); Kazuhiro Yokoyama (Rikkyo University)

    Lattice Cryptography

    Chair: Yongsoo Song

  4. Discretisation and product distributions in Ring-LWE

    Sean Murphy, Rachel Player (Royal Holloway, University of London)

  5. Approximate Voronoi cells for lattices, revisited

    Thijs Laarhoven (Eindhoven University of Technology)

  6. (In)security of Ring-LWE under partial key exposure

    Dana Dachman-Soled, Huijing Gong, Mukul Kulkarni, Aria Shahverdi (University of Maryland, College Park)

  7. Towards a ring analogue of the leftover hash lemma

    Dana Dachman-Soled, Huijing Gong, Mukul Kulkarni, Aria Shahverdi (University of Maryland, College Park)

    Other Topics

    Chair: Jung Hee Cheon

  8. The eleventh power residue symbol

    Marc Joye (OneSpan); Oleksandra Lapiha, Ky Nguyen (ENS)

  9. Factoring with hints

    Francesco Sica (Nazarbayev University)

  10. One bit is all it takes: A devastating timing attack on BLISS’s non-constant time sign flips

    Mehdi Tibouchi, Alexandre Wallet (NTT Corporation)

  11. A framework for reducing the overhead of the quantum oracle for use with Grover’s algorithm with applications to cryptanalysis of SIKE

    Benjamin I. Pring, Jean-Francois Biasse (University of South Florida)

Program Committee

  • Reza Azarderakhsh

  • Jean-François Biasse

  • Lily Chen

  • Ilaria Chillotti

  • Jintai Ding

  • Luca De Feo

  • Nicolas Gama

  • David Jao

  • Shi Bai

  • Hao Chen

  • Chen-Mou Cheng

  • Anamaria Costache

  • Yarkin Doroz

  • Pierre-Alain Fouque

  • David Hyeon

  • Miran Kim

  • David Kohel

  • Hyangsook Lee

  • San Ling

  • Alfred Menezes

  • Christophe Petit

  • Thomas Prest

  • Rainer Steinwandt

  • Frederik Vercauteren

  • Changmin Lee

  • Dongdai Lin

  • Chloe Martindale

  • Michele Mosca

  • Rachel Player

  • Fang Song

  • Mehdi Tibouchi

  • Aaram Yun

Published Online: 2020-11-17

© 2020 J. Hee Cheon et al., published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 International License.

Downloaded on 29.2.2024 from https://www.degruyter.com/document/doi/10.1515/jmc-2020-0170/html
Scroll to top button