Posts Tagged ‘Discrete logarithms’:

Research of Conic Curve Cryptosystems and the Construction of CC-CSP

on May 4th, 2012 by - Comments Off

Conic curve cryptology was a new orientation of cryptology in the recent research of the cryptology. Compared with ECC, the computing on conic curve is much easier, and the encoding/decoding procedure becomes simple. Moreover, a group modulo n on conic curve can be formed, on which we can construct cryptogram similar to RSA. As known

(Read More…)

An Implementation of GNFS Algorithms for Discrete Logarithms in GF(p)

The public key cryptosystem are based on the difficulty of computing some mathematical problems.As the first practical public key cryptosystem to be published, the Diffie-Hellman key exchange algorithm,is based on the assumption that discrete logarithms are hard to compute.Discrete logarithms have a long history in number theory.Initially they were used primarily computing in finite fields.The

(Read More…)

© IT Research Paper