8 search results - page 1 / 2 » Durfee Polynomials |
COMBINATORICS
1998
13 years 4 months ago
1998
Let F(n) be a family of partitions of n and let F(n d) denote the set of partitions in F(n) with Durfee square of size d. We de ne the Durfee polynomial of F(n) to be the polynomi...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
At Asiacrypt ’99, Sun, Yang and Laih proposed three RSA variants with short secret exponent that resisted all known attacks, including the recent Boneh-Durfee attack from Eurocry...
PKC
2010
Springer
13 years 8 months ago
2010
Springer
We present an elementary method to construct optimized lattices that are used for finding small roots of polynomial equations. Former methods first construct some large lattice i...
ACISP
2010
Springer
13 years 6 months ago
2010
Springer
We introduce a "generalized small inverse problem (GSIP)" and present an algorithm for solving this problem. GSIP is formulated as finding small solutions of f(x0, x1, . ...
PKC
2005
Springer
13 years 10 months ago
2005
Springer
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...