# IACR Local Search

`homomorphic author:david`

.
Found 887 results

##### Specialized Integer Factorization

Iacrpub

https://iacr.org/cryptodb/data/paper.php?pubkey=2173

##### Don Coppersmith

Author

https://iacr.org/cryptodb/data/author.php?authorkey=1297

IDA Center for Communcations Research

##### Don Coppersmith, IACR Fellow (2004)

https://iacr.org/fellows/2004/coppersmith.html

Don Coppersmith, IACR Fellow (2004) For numerous foundational and highly influential contributions to the theory and practice of cryptosystem design and analysis.

##### Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known

Iacrpub

https://iacr.org/cryptodb/data/paper.php?pubkey=2171

##### EUROCRYPT '98 Accepted Papers

https://iacr.org/conferences/ec98/accepted.html

EUROCRYPT '98 Accepted papers Specialized integer factorization Don Coppersmith Towards a better understanding of one-wayness: Facing linear permutations Alain P. Hiltgen On the propagation criterion of degree l and order k...

##### 2003 IACR Distinguished Lecture

https://iacr.org/publications/dl/ann2003.html

2003 IACR Distinguished Lecture Don Coppersmith Solving Low Degree Polynomials presented at ASIACRYPT 2003, in Taipei, Taiwan. Abstract Given an integer N, and a polynomial p(x) of degree d in one variable, defined modulo N,...

##### 2003 IACR Distinguished Lecture

https://iacr.org/publications/dl/coppersmith03/coppersmith03.html

2003 IACR Distinguished Lecture Don Coppersmith Solving Low Degree Polynomials presented at ASIACRYPT 2003, in Taipei, Taiwan. Abstract Given an integer N, and a polynomial p(x) of degree d in one variable, defined modulo N,...

##### 2003 IACR Distinguished Lecture

https://iacr.org/publications/dl/coppersmith03/index.html

2003 IACR Distinguished Lecture Don Coppersmith Solving Low Degree Polynomials presented at ASIACRYPT 2003, in Taipei, Taiwan. Abstract Given an integer N, and a polynomial p(x) of degree d in one variable, defined modulo N,...

##### On the Complexity of Integer Factorization

Eprint

https://eprint.iacr.org/2009/123

This note presents a deterministic integer factorization algorithm based on a system of polynomial equations. The main result establishes a new deterministic time complexity bench mark.

*received 10 Feb 2009*

##### Guaranteed Correct Sharing of Integer Factorization with Off-Line Shareholders

Iacrpub

https://iacr.org/cryptodb/data/paper.php?pubkey=3358

##### Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization

Iacrpub

https://iacr.org/cryptodb/data/paper.php?pubkey=702

##### A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete Logarithms

Iacrpub

https://iacr.org/cryptodb/data/paper.php?pubkey=1654

##### Approximate Integer Common Divisor Problem relates to Implicit Factorization

Eprint

https://eprint.iacr.org/2009/626

In this paper, we analyse how to calculate the GCD of $k$ $(\geq 2)$
many large integers, given their approximations. Two versions of the
approximate common divisor problem, presented by Howgrave-Graham in CaLC 2001, are...

*last revised 11 May 2010*

##### On Improving Integer Factorization and Discrete Logarithm Computation using Partial Triangulation

Eprint

https://eprint.iacr.org/2017/758

The number field sieve is the best-known algorithm for factoring integers and solving the discrete logarithm problem in prime fields. In this paper, we present some new improvements to various steps of the number field sieve....

*received 4 Aug 2017*

##### A Simple and Improved Algorithm for Integer Factorization with Implicit Hints

Eprint

https://eprint.iacr.org/2014/839

Given two integers $N_1 = p_1q_1$ and $N_2 = p_2q_2$ with $\alpha$-bit primes $q_1,q_2$, suppose that the $t$ least significant bits of $p_1$ and $p_2$ are equal. May and Ritzenhofen (PKC 2009) developed a factoring algorithm...

*received 14 Oct 2014*

##### On Black-Box Ring Extraction and Integer Factorization

Eprint

https://eprint.iacr.org/2008/156

The black-box extraction problem over rings has (at least) two important interpretations in cryptography: An efficient algorithm for this problem implies (i) the equivalence of computing discrete logarithms and solving the...

*last revised 6 Jul 2008*

##### Achieving a log(n) Speed Up for Boolean Matrix Operations and Calculating the Complexity of the Dense Linear Algebra step of Algebraic Stream Cipher Attacks and of Integer Factorization Methods

Eprint

https://eprint.iacr.org/2006/163

The purpose of this paper is to calculate the running time of dense boolean matrix operations,
as used in stream cipher cryptanalysis and integer factorization. Several variations of Gaussian
Elimination, Strassen's Algorithm...

*received 5 May 2006*

##### Divisors in Residue Classes, Constructively

Eprint

https://eprint.iacr.org/2004/339

Let $r,s,n$ be integers satisfying $0 \leq r < s < n$,
$s \geq n^{\alpha}$, $\alpha > 1/4$, and $\gcd(r,s)=1$. Lenstra showed that the number of integer divisors of $n$ equivalent to
$r \pmod s$ is upper bounded by...

*received 3 Dec 2004*

##### The Fermat factorization method revisited

Eprint

https://eprint.iacr.org/2009/318

We consider the well known Fermat factorization method ({\it FFM}) when it is applied on a balanced RSA modulus $N=p\, q>0$, with primes $p$ and $q$ supposed of equal length. We call the {\it Fermat factorization equation} ...

*last revised 23 Jul 2009*

##### Preliminary Eurocrypt '96 program

https://iacr.org/conferences/ec96/ec96prog.html

Preliminary Eurocrypt '96 program Zaragoza, Spain May 12-16, 1996 Sunday, May 12 18:30-22:00 Registration --- Welcome Cocktail Monday, May 13 08:45-09:30 Registration 09:30-09:45 Introduction to EUROCRYPT `96 09:45-11:15...