H. Lenstra. Finding isomorphisms between nite elds. Mathematics of Computation, 56:329-347, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Constructing Isogenies Between Elliptic Curves Over Finite Fields - Galbraith (1999) (6 citations) (Correct)
....curve is ever considered at a time) The issue arises when constructing elliptic curves on which to base a cryptosystem; since there are many di erent ways to write down elliptic curves, it is important to know whether some of these representations are stronger or weaker than others. Lenstra [18] has studied a similar problem for nite elds F p n . The result is that there is a polynomial time algorithm to convert between any two di erent bases for F p n as a vector space over F p . This is an important result as it means that all representations used for nite elds in cryptosystems ....
H.W. Lenstra Jr., Finding isomorphisms between nite elds, Math. Comp., 56, No. 193 (1991) 329 347
Semirings and Semigroup Actions in Public-Key Cryptography - Monico (2002) (Correct)
No context found.
H. Lenstra. Finding isomorphisms between nite elds. Mathematics of Computation, 56:329-347, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC