Cryptology ePrint Archive: Report 2006/427

Available versions in chronological order

20061119:195038 (posted 19-Nov-2006 19:50:38 UTC): How to construct pairing-friendly curves for the embedding degree $k=2n$, $n$ is an odd prime; Aya Comuta and Mitsuru Kawazoe and Tetsuya Takahashi
20070122:024832 (posted 22-Jan-2007 02:48:32 UTC): How to construct pairing-friendly curves for the embedding degree $k=2n$, $n$ is an odd prime; Aya Comuta and Mitsuru Kawazoe and Tetsuya Takahashi
20070501:040038 (posted 01-May-2007 04:00:38 UTC): How to construct pairing-friendly curves for the embedding degree $k=2n$, $n$ is an odd prime; Aya Comuta and Mitsuru Kawazoe and Tetsuya Takahashi
20070507:000008 (posted 07-May-2007 00:00:08 UTC): How to construct pairing-friendly curves for the embedding degree $k=2n$, $n$ is an odd prime; Aya Comuta and Mitsuru Kawazoe and Tetsuya Takahashi
20070701:074731 (posted 01-Jul-2007 07:47:31 UTC): Pairing-friendly elliptic curves with small security loss by Cheon’s algorithm; Aya Comuta and Mitsuru Kawazoe and Tetsuya Takahashi
20070701:075111 (posted 01-Jul-2007 07:51:11 UTC): Pairing-friendly elliptic curves with small security loss by Cheon's algorithm; Aya Comuta and Mitsuru Kawazoe and Tetsuya Takahashi
20070701:220041 (posted 01-Jul-2007 22:00:41 UTC): Pairing-friendly elliptic curves with small security loss by Cheon's algorithm; Aya Comuta and Mitsuru Kawazoe and Tetsuya Takahashi