# IACR Local Search

Possible queries include homomorphic author:david.
Found 887 results
##### Specialized Integer Factorization
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=2173
Don Coppersmith
Eurocrypt 1998
##### 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
Don Coppersmith
Eurocrypt 1996
##### 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
N. A. Carella CUNY N.Y.
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.
##### Guaranteed Correct Sharing of Integer Factorization with Off-Line Shareholders
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=3358
Wenbo Mao
Pkc 1998
##### Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=702
Willi Geiselmann Adi Shamir Rainer Steinwandt Eran Tromer
Ches 2005
##### A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete Logarithms
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=1654
Paul C. van Oorschot
Crypto 1990
##### Approximate Integer Common Divisor Problem relates to Implicit Factorization
Eprint
https://eprint.iacr.org/2009/626
Santanu Sarkar Subhamoy Maitra
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
Fabrice Boudot
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....
##### A Simple and Improved Algorithm for Integer Factorization with Implicit Hints
Eprint
https://eprint.iacr.org/2014/839
Koji Nuida Naoto Itakura Kaoru Kurosawa
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...
##### On Black-Box Ring Extraction and Integer Factorization
Eprint
https://eprint.iacr.org/2008/156
Kristina Altmann Tibor Jager Andy Rupp
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
Gregory V. Bard
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...
##### Divisors in Residue Classes, Constructively
Eprint
https://eprint.iacr.org/2004/339
Don Coppersmith Nick Howgrave-Graham S. V. Nagaraj
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...
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} ...