Browsing Computer Science and Automation (CSA) by Subject "Computational Number Theory"

Now showing items 1-2 of 2

Galois field Computations : Implementation of a Library and a study of the Discrete Logarithm Problem

Das, Abhijit

Computation over finite fields (also called Galois fields) is an active area of research in number theory and algebra, and finds many applications in cryptography, error control coding, and combinatorial design. In this ...
On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem

Vivek, Srinivas V (2013-05-21)

There has been a rapid increase interest in computational number theory ever since the invention of public-key cryptography. Various attempts to solve the underlying hard problems behind public-key cryptosystems has led ...