Sciweavers

3702 search results - page 216 / 741
» All Pairings Are in a Group
Sort
View
ANTS
2008
Springer
110views Algorithms» more  ANTS 2008»
15 years 8 months ago
Computing Hilbert Class Polynomials
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
Juliana Belding, Reinier Bröker, Andreas Enge...
CP
2006
Springer
15 years 8 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
206
Voted
EUROCRYPT
2004
Springer
16 years 16 hour ago
Traceable Signatures
Abstract. This work presents a new privacy primitive called “Traceable Signatures”, together with an efficient provably secure implementation. To this end, we develop the unde...
Aggelos Kiayias, Yiannis Tsiounis, Moti Yung
ACL
2008
15 years 8 months ago
Generating Research Websites Using Summarisation Techniques
We describe an application that generates web pages for research institutions by summarising terms extracted from individual researchers' publication titles. Our online demo ...
Advaith Siddharthan, Ann A. Copestake
ICISC
2004
99views Cryptology» more  ICISC 2004»
15 years 8 months ago
Fractional Windows Revisited: Improved Signed-Digit Representations for Efficient Exponentiation
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 ...
Bodo Möller