736 search results - page 33 / 148 » Algorithms for Ordinal Arithmetic |
ISAAC
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
This paper describes Slepian-Wolf codes based on overlapped quasi-arithmetic codes, where overlapping allows lossy compression of the source below its entropy. In the context of s...
ANTS
1998
Springer
13 years 11 months ago
1998
Springer
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
This paper aims at introducing generalized Jacobians as a new candidate for discrete logarithm (DL) based cryptography. The motivation for this work came from the observation that ...
DCC
2000
IEEE
13 years 7 months ago
2000
IEEE
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...