Sciweavers

1296 search results - page 11 / 260
» The Number Field Sieve
Sort
View
FFA
2010
84views more  FFA 2010»
13 years 8 months ago
Additive functions for number systems in function fields
Let Fq be a finite field with q elements and p ∈ Fq[X, Y ]. In this paper we study properties of additive functions with respect to number systems which are defined in the rin...
Manfred G. Madritsch, Jörg M. Thuswaldner
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
14 years 3 months ago
On the Complexity of Computing Units in a Number Field
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...
Vikraman Arvind, Piyush P. Kurur
MOC
1998
65views more  MOC 1998»
13 years 9 months ago
Exceptional units in a family of quartic number fields
Abstract. We determine all exceptional units among the elements of certain groups of units in quartic number fields. These groups arise from a oneparameter family of polynomials w...
Gerhard Niklasch, Nigel P. Smart
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
14 years 1 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
14 years 3 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