62 search results - page 4 / 13 » Computable Ordered Abelian Groups and Fields |
RTA
2005
Springer
13 years 11 months ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
JCT
2011
13 years 1 months ago
2011
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
AAECC
2004
Springer
13 years 6 months ago
2004
Springer
Abstract. This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefficients in a perfect field when those ideals are generate...
EUROCRYPT
2003
Springer
13 years 11 months ago
2003
Springer
A variant of Schnorr’s signature scheme called RDSA has been proposed by I. Biehl, J. Buchmann, S. Hamdy and A. Meyer in order to be used in finite abelian groups of unknown ord...
ANTS
2006
Springer
13 years 10 months ago
2006
Springer
We show that the locally free class group of an order in a semisimple algebra over a number field is isomorphic to a certain ray class group. This description is then used to prese...