Sciweavers

1400 search results - page 9 / 280
» On multiplication in finite fields
Sort
View
CORR
2006
Springer
84views Education» more  CORR 2006»
13 years 7 months ago
A simple generalization of El-Gamal cryptosystem to non-abelian groups
In this paper we propose the group of unitriangular matrices over a finite field as a non-abelian group and composition of inner, diagonal and central automorphisms as a group of a...
Ayan Mahalanobis
CHES
2000
Springer
167views Cryptology» more  CHES 2000»
13 years 11 months ago
A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
Gerardo Orlando, Christof Paar
SYMMETRY
2010
72views more  SYMMETRY 2010»
13 years 2 months ago
Symmetric Matrix Fields in the Finite Element Method
: The theory of elasticity is used to predict the response of a material body subject to applied forces. In the linear theory, where the displacement is small, the stress tensor wh...
Gerard Awanou
JC
2008
84views more  JC 2008»
13 years 7 months ago
On the linear complexity of Sidel'nikov sequences over nonprime fields
We introduce a generalization of Sidel'nikov sequences for arbitrary finite fields. We show that several classes of Sidel'nikov sequences over arbitrary finite fields ex...
Nina Brandstätter, Wilfried Meidl
MOC
2002
121views more  MOC 2002»
13 years 7 months ago
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite fields. Its expected running time for i...
Andreas Enge