26 search results - page 4 / 6 » Factorization of Square-Free Integers with High Bits Known |
WEA
2009
Springer
14 years 2 months ago
2009
Springer
We present a cgal-based univariate algebraic kernel, which provides certi ed real-root isolation of univariate polynomials with integer coe cients and standard functionalities such...
HOTNETS
2010
13 years 2 months ago
2010
Conventional WiFi networks perform channel contention in time domain. This is known to be wasteful because the channel is forced to remain idle, while all contending nodes are bac...
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...
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...
DAGSTUHL
2008
13 years 9 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...