International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR Local Search

Possible queries include homomorphic author:david.
Found 20000 results
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=1903
Jean-Sébastien Coron
Crypto 2007
Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=2177
Jean-Sébastien Coron
Eurocrypt 2004
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=25271
Jingguo Bi Jean-Sébastien Coron Jean-Charles Faugère Phong Q. Nguyen Guénaël Renault Rina Zeitoun
Pkc 2014
Preface, CRYPTO 2007
https://iacr.org/archive/crypto2007/preface.html
Preface CRYPTO 2007, the 27th Annual International Cryptology Conference, was sponsored by the International Association for Cryptologic Research (IACR) in cooperation with the IEEE Computer Society Technical Committee on...
A Note on the Bivariate Coppersmith Theorem
Journal of Cryptology
http://www.springerlink.com/content/c1633761314l0671/
Abstract In 1997, Coppersmith proved a famous theorem for finding small roots of bivariate polynomials over ℤ, with important applications to cryptography. While it seems to have been overlooked until now, we found the proof...
2012-April-1
A Note on the Bivariate Coppersmith Theorem
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=29482
Jean-Sébastien Coron Alexey Kirichenko Mehdi Tibouchi
Jofc 2013
In 1997, Coppersmith proved a famous theorem for finding small roots of bivariate polynomials over ℤ, with important applications to cryptography.While it seems to have been overlooked until now, we found the proof of the most...
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=1930
Johannes Blömer Alexander May
Eurocrypt 2005
An Algorithm for Finding Small Roots of Multivariate Polynomials over the Integers
Eprint
https://eprint.iacr.org/2007/088
Domingo Gomez Jaime Gutierrez Alvar Ibeas
In this paper we present a new algorithm for finding small roots of a system of multivariate polynomials over the integers based on lattice reduction techniques. Our simpler heuristic method is inspired in algorithms for...
received 8 Mar 2007
Crypto 2007
https://iacr.org/conferences/crypto2007/program-bak.html
CRYPTO 2007 Preliminary Program All events in Campbell Hall (unless otherwise noted) Click here for printable version (not yet ready) Sunday, August 19, 2007 17:00 - 20:00 Registration , Anacapa Formal Lounge - (registration...
Crypto 2007
https://iacr.org/conferences/crypto2007/program.html
CRYPTO 2007 Preliminary Program All events in Campbell Hall (unless otherwise noted) Sponsorship: Student scholarships were funded by Qualcomm. The Crypto Café was sponsored by the D. E. Shaw group. Sponsorship for the rump...
Eurocrypt 2004
https://iacr.org/conferences/eurocrypt2004/accepted.html
Home Call for Papers Accepted Papers Program Proceedings Rump Session Venue Excursion Accommodation Travel Info Registration Sponsors Contact List of Accepted Papers On Generating the Initial Key in the Bounded Storage Model...
Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=2171
Don Coppersmith
Eurocrypt 1996
Eurocrypt 2004 - Accepted papers
https://iacr.org/newsletter/v21n1/ec-accepted.html
Eurocrypt 2004 - Accepted papers See the Eurocrypt 2004 web site for more information. On Generating the Initial Key in the Bounded Storage Model Stefan Dziembowski and Ueli Maurer Finding Small Roots of Bivariate Integer...
CRYPTO 2007: Santa Barbara,California, USA
https://iacr.org/archive/crypto2007/crypto2007.html
Much of the information on this web page was provided courtesy of Michael Ley and the DBLP Project CRYPTO 2007: Santa Barbara, California, USA Alfred Menezes (Ed.): Advances in Cryptology - CRYPTO 2007 27th Annual...
A Variant of Coppersmith's Algorithm with Improved Complexity and Efficient Exhaustive Search
Eprint
https://eprint.iacr.org/2013/483
Jean-Sébastien Coron Jean-Charles Faugère Guénaël Renault Rina Zeitoun
Coppersmith described at Eurocrypt 96 a polynomial-time algorithm for finding small roots of univariate modular equations, based on lattice reduction. In this paper we describe the first improvement of the asymptotic...
received 7 Aug 2013
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
Eprint
https://eprint.iacr.org/2014/437
Jingguo Bi Jean-S\'ebastien Coron Jean-Charles Faug\`ere Phong Q. Nguyen Gu\'ena\"el Renault Rina Zeitoun
In a seminal work at EUROCRYPT '96, Coppersmith showed how to find all small roots of a univariate polynomial congruence in polynomial time: this has found many applications in public-key cryptanalysis and in a few security...
last revised 6 Jun 2014
IACR EUROCRYPT 2004: Interlaken, Switzerland
https://iacr.org/archive/eurocrypt2004/index.html
Much of the information on this web page was provided courtesy of Michael Ley and the DBLP Project EUROCRYPT 2004: Interlaken, Switzerland Christian Cachin , Jan Camenisch (Eds.): Advances in Cryptology - EUROCRYPT 2004,...
IACR EUROCRYPT 2004: Interlaken, Switzerland
https://iacr.org/archive/eurocrypt2004/eurocrypt2004.html
Much of the information on this web page was provided courtesy of Michael Ley and the DBLP Project EUROCRYPT 2004: Interlaken, Switzerland Christian Cachin , Jan Camenisch (Eds.): Advances in Cryptology - EUROCRYPT 2004,...
Finding Roots in GF(p^n) with the Successive Resultant Algorithm
Eprint
https://eprint.iacr.org/2014/506
Christophe Petit
The problem of solving polynomial equations over finite fields has many applications in cryptography and coding theory. In this paper, we consider polynomial equations over a ``large'' finite field with a ``small''...
received 4 Jun 2014
Rounding LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
Eprint
https://eprint.iacr.org/2013/512
Jingguo Bi Phong Q. Nguyen
In a seminal work at EUROCRYPT '96, Coppersmith showed how to find all small roots of a univariate polynomial congruence in polynomial time: this has found many applications in public-key cryptanalysis and in a few security...
received 17 Aug 2013
Next ►