73 search results - page 10 / 15 » Permutations, hyperplanes and polynomials over finite fields |
DCC
1999
IEEE
13 years 7 months ago
1999
IEEE
An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve...
IJNSEC
2010
13 years 2 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
WAIFI
2010
Springer
14 years 16 days ago
2010
Springer
A cryptographic pairing evaluates as an element of a finite extension field, and the evaluation itself involves a considerable amount of extension field arithmetic. It is recogn...
TC
2008
13 years 7 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
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...