![]() |
![]() |
素数計算を利用する
p x q = n --> (p=素数、q=素数、n=正数)
For strong encryption, a minimum length of 1028-bit key is recommended.
DLS: Discrete Logarithm Systems
y = gx (mod p) --> (p=素数、g=正数 [0
ECC: Elliptic Curve Cryptosystem
小判形計算を利用する
y2 = x3 + ax + b (mod p)
For strong encryption, a minimum length of 160-bit key is recommended.
Various other encryption algorithms are always coming out.
Each encryption method has it's own special qualitites, how do you determine which of these new methods will become the safest? At the same time, which one of these new methods will be the first to crack is another consideration which we cannot overlook!
Key to the Security Mystery Top