Machine learning for modular multiplication

Kristin Lauter, Cathy Yuanchen Li, Krystal Maughan, Rachel Newton, Megha Srivastava
2/29/2024
cs.LGcs.CR

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Motivated by cryptographic applications, we investigate two machine learning approaches to modular multiplication: namely circular regression and a sequence-to-sequence transformer model. The limited success of both methods demonstrated in our results gives evidence for the hardness of tasks involving modular multiplication upon which cryptosystems are based.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lauter2024machine,
  title  = {Machine learning for modular multiplication},
  author = {Kristin Lauter and Cathy Yuanchen Li and Krystal Maughan and Rachel Newton and Megha Srivastava},
  year   = {2024},
  eprint = {2402.19254},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.19254v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.19254.svg)](https://codeofpaper.com/paper/2402.19254)

Discussion