Efficient elliptic curve exponentiation
スポンサーリンク
概要
- 論文の詳細を見る
Information and communications security : first international conference, ICIS '97, Beijing, China, November 11-14, 1997 : proceedings / Yongfei Han, Tatsuaki Okamoto, Sihan Qing, (eds.).Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosystems( [16]). This is why elliptic curve cryptosystems have begun to attract notice. There are mainly two types in elliptic curve cryptosystems, elliptic curves E over IF_<2r> and E over IFp. Some current systems based on ElGamal or RSA may often use modulo arithmetic over IF_p. Therefore it is convenient to construct fast elliptic curve cryptosystems over IF_p. In this paper, we investigate how to implement elliptic curve cryptosystems on E/IF_p.
- Springerの論文
- 1997-00-00
Springer | 論文
- Comparisons of germination traits of alpine plants between fellfield and snowbed habitats
- Photoreceptor Images of Normal Eyes and of Eyes with Macular Dystrophy Obtained In Vivo with an Adaptive Optics Fundus Camera
- Effect of Electrical Stimulation on IGF-1 Transcription by L-Type Calcium Channels in Cultured Retinal Muller Cells
- In Vivo Measurements of Cone Photoreceptor Spacing in Myopic Eyes from Images Obtained by an Adaptive Optics Fundus Camera
- Optical Quality of the Eye Degraded by Time-Varying Wavefront Aberrations with Tear Film Dynamics