Sciweavers

21 search results - page 2 / 5
» Costas array generator polynomials in finite fields
Sort
View
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
14 years 5 months ago
Pseudorandom generators for low degree polynomials
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
Andrej Bogdanov
ISSAC
2009
Springer
163views Mathematics» more  ISSAC 2009»
13 years 11 months ago
Fast arithmetics in artin-schreier towers over finite fields
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
Luca De Feo, Éric Schost
WSC
2000
13 years 6 months ago
A new class of linear feedback shift register generators
An efficient implementation of linear feedback shift register sequences with a given characteristic polynomial is obtained by a new method. It involves a polynomial linear congrue...
Pierre L'Ecuyer, François Panneton
IJNSEC
2010
105views more  IJNSEC 2010»
12 years 11 months ago
A Note on the Constructions of Orthomorphic Permutations
Orthomorphic permutations have important applications in the design of block ciphers. A practical algorithm is derived to generate all orthomorphic permutations over Fm 2 , and it...
Jianqin Zhou
ICCS
2004
Springer
13 years 10 months ago
Intrinsic Evolution of Analog Circuits on a Programmable Analog Multiplexer Array
This work discusses an Evolvable Hardware (EHW) platform for the intrinsic evolution of analog electronic circuits. The EHW analog platform, named PAMA-NG (Programmable Analog Mult...
José Franco Machado do Amaral, Jorge Lu&iac...