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...
Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Sp...
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 ...
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 ...
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...
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...
Emmanuel Christophe, Pierre Duhamel, Corinne Mailh...