Sciweavers

4403 search results - page 7 / 881
» Galois Theory of Algorithms
Sort
View
FMCAD
2008
Springer
13 years 9 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
Jesse D. Bingham
DAM
2008
92views more  DAM 2008»
13 years 7 months ago
Applications to cryptography of twisting commutative algebraic groups
We give an overview on twisting commutative algebraic groups and applications to discrete log based cryptography. We explain how discrete log based cryptography over extension fie...
Alice Silverberg
JSC
2000
60views more  JSC 2000»
13 years 7 months ago
Generic Extensions and Generic Polynomials
This paper presents a generalization of a theorem of Saltman on the existence of generic extensions with group A G over an infinite field K, where A is abelian, using less restri...
Arne Ledet
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
13 years 11 months ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama
EURODAC
1994
IEEE
163views VHDL» more  EURODAC 1994»
13 years 11 months ago
VHDL and cyclic corrector codes
Cyclic corrector codes, or "block codes", are often used in telecommunications systems. To facilitate the design of coding/decoding circuits using this type of code, we ...
France Mendez