Sciweavers

4403 search results - page 9 / 881
» Galois Theory of Algorithms
Sort
View
MOC
2010
13 years 2 months ago
Proving modularity for a given elliptic curve over an imaginary quadratic field
We present an algorithm to determine if the L-series associated to an automorphic representation and the one associated to an elliptic curve over an imaginary quadratic field agree...
Luis Dieulefait, Lucio Guerberoff, Ariel Pacetti
SEFM
2007
IEEE
14 years 1 months ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook
ISSAC
2007
Springer
99views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Computing monodromy via parallel homotopy continuation
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
Anton Leykin, Frank Sottile
CHES
2005
Springer
156views Cryptology» more  CHES 2005»
14 years 29 days ago
A Very Compact S-Box for AES
A key step in the Advanced Encryption Standard (AES) algorithm is the “S-box.” Many implementations of AES have been proposed, for various goals, that effect the S-box in vari...
David Canright
ASAP
2005
IEEE
93views Hardware» more  ASAP 2005»
13 years 9 months ago
Instruction Set Extensions for Reed-Solomon Encoding and Decoding
Reed-Solomon codes are an important class of error correcting codes used in many applications related to communications and digital storage. The fundamental operations in Reed-Sol...
Suman Mamidi, Daniel Iancu, Andrei Iancu, Michael ...