237 search results - page 16 / 48 » Algorithms for Exponentiation in Finite Fields |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Due to implementation constraints the XOR operation is widely used in order to combine plaintext and key bit-strings in secretkey block ciphers. This choice directly induces the cl...
PC
2002
13 years 7 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
ANTS
1998
Springer
13 years 12 months ago
1998
Springer
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the on...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
CRYPTO
1998
Springer
13 years 11 months ago
1998
Springer
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...