The MMO problem

DOI10.1145/2608628.2608643zbMath1325.68279arXiv1401.7532OpenAlexW2964034622MaRDI QIDQ3452393

Jaime Gutierrez, Domingo Gómez-Pérez, L. M. G. M. Tolhuizen, Ronald Rietman, Oscar Garcia-Morchon

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.7532

zbMATH Keywords

polynomialslatticesclosest vector problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Polynomials over finite fields (11T06)

Related Items

Close values of shifted modular inversions and the decisional modular inversion hidden number problem

Uses Software

• SageMath
• Jordan

Cites Work

• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic
• Unnamed Item
• Unnamed Item

This page was built for publication: The MMO problem