12742 search results - page 41 / 2549 » On canonical number systems |
MYCRYPT
2005
Springer
15 years 3 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 ....
SACRYPT
2004
Springer
15 years 3 months ago
2004
Springer
DAGM
2003
Springer
15 years 2 months ago
2003
Springer
SWAT
2010
Springer
15 years 2 months ago
2010
Springer
GLVLSI
2002
IEEE
15 years 2 months ago
2002
IEEE