Sciweavers

62 search results - page 2 / 13
» Computable Ordered Abelian Groups and Fields
Sort
View
ANTS
2008
Springer
115views Algorithms» more  ANTS 2008»
13 years 7 months ago
Computing Hilbert Modular Forms over Fields with Nontrivial Class Group
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degr...
Lassina Dembélé, Steve Donnelly
DCC
2003
IEEE
14 years 4 months ago
The Largest Cap in AG(4, 4) and Its Uniqueness
We show that 40 is the maximum number of points of a cap in AG(4, 4). Up to semi-linear transformations there is only one such 40-cap. Its group of automorphisms is a semidirect p...
Yves Edel, Jürgen Bierbrauer
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
13 years 10 months ago
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
Ronald Cramer, Serge Fehr, Martijn Stam
EUROCRYPT
2006
Springer
13 years 8 months ago
Security Analysis of the Strong Diffie-Hellman Problem
Let g be an element of prime order p in an abelian group and Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, we can compute the secret in O(log p
Jung Hee Cheon
IJAC
2010
231views more  IJAC 2010»
13 years 2 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa