| 摘要 |
PROBLEM TO BE SOLVED: To generate a key (p) being safe as the key of an elliptic curve cipher at high speed. SOLUTION: This key generating method confines y2≡x3+x (mod p), p≡1 (mod 4) and generates an odd random number U and an even random number V which have bits half of the size W of (p) (a step 12) and it generates U, V repeatingly until U2+V2 becomes a prime number (steps 13, 14) and when it becomes a prime number, it generates two candidates of the prime method of 4U2+(2V±1)2 (a step 15) and when this is a prime number, the method outputs it as (p) and when not a prime number, it returns to the generating of U and V.
|
