20 search results - page 1 / 4 » Signed Binary Representations Revisited |
CRYPTO
2004
Springer
13 years 9 months ago
2004
Springer
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
ICISC
2004
13 years 5 months ago
2004
Abstract. This paper extends results concerning efficient exponentiation in groups where inversion is easy (e.g. in elliptic curve cryptography). It examines the right-to-left and ...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
A string . . . a2a1a0 over the alphabet {−1, 0, 1} is said to be a minimal signed-binary representation of an integer n if n = k≥0 ak2k and the number of non-zero digits is ...
DCC
2007
IEEE
14 years 3 months ago
2007
IEEE
Applications of signed digit representations of an integer include computer arithmetic, cryptography, and digital signal processing. An integer of length n bits can have several b...
ICASSP
2007
IEEE
13 years 10 months ago
2007
IEEE
Zerotree based coders have shown a good ability to be successfully adapted to 3D image coding. This paper focuses on the adaptation of EZW for the compression of hyperspectral ima...