ANTS
2004
Springer
14 years 5 months ago
2004
Springer
We present a non-archimedean method to construct, given an integer N ≥ 1, a finite field Fq and an elliptic curve E/Fq such that E(Fq) has order N.
ANTS
2004
Springer
14 years 5 months ago
2004
Springer
Using powerful tools on genus 2 curves like the Kummer variety, we generalize the Montgomery method for scalar multiplication to the jacobian of these curves. Previously this metho...
ANTS
2004
Springer
14 years 5 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
ANTS
2004
Springer
14 years 5 months ago
2004
Springer
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...
ANTS
2004
Springer
14 years 5 months ago
2004
Springer
We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced i...
AH
2004
Springer
14 years 5 months ago
2004
Springer
Current search engines rely on centralized page ranking algorithms which compute page rank values as single (global) values for each Web page. Recent work on topic-sensitive PageRa...
WOSP
2004
ACM
14 years 5 months ago
2004
ACM
Peer-to-peer, or simply P2P, systems have recently emerged as a popular paradigm for building distributed applications. One key aspect of the P2P system design is the mechanism us...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
SPAA
2004
ACM
14 years 5 months ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
SIGECOM
2004
ACM
14 years 5 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...