This paper treats elliptic curves over finite fields of characteristic three of composite degree, and shows some of such elliptic curves are also attacked by a.
Abstract. The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm ...
The International Association for Cryptologic Research (IACR) is a non-profit scientific organization whose purpose is to further research in cryptology and ...
This paper treats elliptic curves over finite fields of characteristic three of composite degree, and shows some of such elliptic curves are also attacked by a.
Weil descent of elliptic curves over finite fields of characteristic three. Author Heading. ARITA S. Publication Date. 2000. Publication Date (W3CDTF). 2000.
Weil Descent of Elliptic Curves Over Finite Fields of Characteristic Three by Seigo Arita published in Lecture Notes in Computer Science.
This page is devoted to the new technique of Weil descent as described in the papers. Weil descent is a technique in the area of elliptic curve cryptography.
We describe a fast hash algorithm that maps arbitrary mes- sages onto points of an elliptic curve defined over a finite field of charac- teristic 3. Our new ...
One approach to attacking the discrete logarithm problem for elliptic curves over finite fields is through Weil descent. Let E have base field K and let k be a ...
Missing: Three. | Show results with:Three.
In this paper we look in detail at the curves which arise in the method of Galbraith and Smart for producing curves in the. Weil restriction of an elliptic ...