Get all the updates for this publication
Conferences
Revisiting Approximate Polynomial Common Divisor Problem and Noisy Multipolynomial ReconstructionPublished in Springer
2019
Volume: 11898 LNCS
Pages: 398 - 411
In this paper, we present a polynomial lattice method to solve the approximate polynomial common divisor problem. This problem is the polynomial version of the well known approximate integer common divisor problem introduced by Howgrave-Graham (Calc 2001). Our idea can be applied directly to solve the noisy multipolynomial reconstruction problem in the field of error-correcting codes. Compared to the method proposed by Devet, Goldberg and Heninger in USENIX 2012, our approach is faster. © 2019, Springer Nature Switzerland AG.
Topics: Polynomial (61)%61% related to the paper, Greatest common divisor (60)%60% related to the paper, Field (mathematics) (52)%52% related to the paper and Integer (52)%52% related to the paper
View more info for "Revisiting Approximate Polynomial Common Divisor Problem and Noisy Multipolynomial Reconstruction"
Content may be subject to copyright.
Related Papers (3)
ConferencesLower bounds and optimal protocols for three-party secure computation2016 | Institute of Electrical and Electronics Engineers Inc.
About the journal
| Journal | Data powered by TypesetLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Publisher | Data powered by TypesetSpringer |
| ISSN | 03029743 |
| Open Access | No |
Authors (1)
Santanu Sarkar- Revisiting (nested) Roos bias in RC4 key scheduling algorithm
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017
- Revisiting Approximate Polynomial Common Divisor Problem and Noisy Multipolynomial Reconstruction
- Theoretical understanding of some conditional and joint biases in RC4 stream cipher
Concepts (6)
Cryptography- APPROXIMATE POLYNOMIALS
- ERROR CORRECTING CODE
- POLYNOMIAL LATTICE
- RECONSTRUCTION PROBLEMS
- Polynomials
