Efficient probabilistic algorithm for solving quadratic equations over finite fields

1987 ◽  
Vol 23 (17) ◽  
pp. 869 ◽  
Author(s):  
T. Itoh
1999 ◽  
Vol 2 ◽  
pp. 118-138 ◽  
Author(s):  
Steven D. Galbraith

AbstractLet E1 and E2 be ordinary elliptic curves over a finite field Fp such that #E1(Fp) = #E2(Fp). Tate's isogeny theorem states that there is an isogeny from E1 to E2 which is defined over Fp. The goal of this paper is to describe a probabilistic algorithm for constructing such an isogeny.The algorithm proposed in this paper has exponential complexity in the worst case. Nevertheless, it is efficient in certain situations (that is, when the class number of the endomorphism ring is small). The significance of these results to elliptic curve cryptography is discussed.


2018 ◽  
Vol 7 (4.10) ◽  
pp. 112
Author(s):  
A. Uma Maheswari ◽  
Prabha Durairaj

This paper presents a probabilistic algorithm to factor polynomials over finite fields using elliptic curves. The success of the algorithm depends on the initial choice of elliptic curve parameters. The algorithm is illustrated through numerical examples. 


Author(s):  
Rudolf Lidl ◽  
Harald Niederreiter
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document