Search Research Symposium Abstracts

The Polynomial Learning With Errors Problem and the Smearing Condition

Lattice-based cryptography relies in great part on the use of the Learning With Errors (LWE) problem as hardness foundation. Its algebraic variants, Ring-Learning with Errors (RLWE) and Polynomial Learning with Errors (PLWE), gain in efficiency over standard LWE, but their security remains to be thoroughly investigated. In this work, we consider the smearing [Read More...]

Presenter: Liljana Babinkostova, Boise State University
Symposium Year: 2022
Session: Mathematics of Cryptography
Presentation Time: June 18, 2022; 10:15 am

Practical Quantum-Safe Voting from Lattices, Extended

E-voting offers significant potential savings in time and money compared to current voting systems. Unfortunately, many current e-voting schemes are susceptible to quantum attacks. In this paper, we expand upon EVOLVE, an existing lattice-based quantum-secure election scheme introduced in \cite{DBLP:conf/ccs/PinoLNS17}. We are able to make these expansions [Read More...]

Presenter: Ryann Cartor, Clemson University
Authors: Ryann Cartor, Ian Black, Emma McFall, Juliet Whidden, Bryant Xie
Symposium Year: 2022
Session: Mathematics of Cryptography
Presentation Time: June 18, 2022; 10:40 am

Adding level structure to supersingular elliptic curve isogeny graphs

Supersingular elliptic curve isogeny graphs are a promising new direction for post-quantum cryptography. To ensure the security of new isogeny-based cryptographic protocols, we study the structures underlying the hard problems for those protocols. In this paper, we add the information of level structure to supersingular elliptic curves and study these [Read More...]

Presenter: Sarah Arpin, University of Colorado Boulder
Authors: Sarah Arpin
Symposium Year: 2022
Session: Mathematics of Cryptography
Presentation Time: June 18, 2022; 11:05 am

Decoding failure analysis of iterative decoding for MDPC codes

There is a class of public-key cryptography based on linear error-correcting codes. The decoder used during error correction directly affects the security of a code-based cryptosystem because, often, the private key is used in the process of recovering a shared secret from a syndrome. Correlations between error patterns that lead to decoding failures and the [Read More...]

Presenter: Angela Robinson, NIST
Authors: Sarah Arpin , Tyler Billingsley, Daniel Hast, Jun Lau, Angela Robinson
Symposium Year: 2022
Session: Mathematics of Cryptography
Presentation Time: June 18, 2022; 11:30 am