1083 search results - page 8 / 217 » On the Number of Optimal Base 2 Representations of Integers |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of [11], as well as new pro...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. Motivated by multiplication algorithms based on redundant number representations, we study representations of an integer n as a sum n = k εkUk, where the digits εk are ...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
In this paper, a novel data hiding technique is proposed, as an improvement over the Fibonacci LSB data-hiding technique proposed by Battisti et al. [1] based on decomposition of ...
MYCRYPT
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....
ARITH
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— A hardware algorithm for integer division is proposed. It is based on the digit-recurrence, non-restoring division algorithm. Fast computation is achieved by the use of...