22 search results - page 3 / 5 » On Factoring Arbitrary Integers with Known Bits |
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
ASIACRYPT
2011
Springer
12 years 7 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
ANTS
1994
Springer
13 years 11 months ago
1994
Springer
In this paper we give some computational results on the multiplicative orders of optimal normal basis generators in F2n over F2 for n 1200 whenever the complete factorization of 2...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
ESORICS
2004
Springer
14 years 1 months ago
2004
Springer
Parameters of a program’s runtime environment such as the machine architecture and operating system largely determine whether a vulnerability can be exploited. For example, the m...