Given a large prime number p, a large intgeger a, and a number g such that every number b coprime to p is congruent to a power of g mod p (i.e. g is a primite root mod p), then g a mod p = s is very ...
The inverse problems generally are ill-posed in Hadamard sense. These words lead us to think that there exist inverse problems that are well-posed and which are possible to be solved analytically [1].
Copyright © 2014 Silvia Reyes Mora et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use ...
The elliptic curve discrete logarithm problem (ECDLP) lies at the heart of modern public-key cryptography. It concerns the challenge of determining an unknown scalar multiplier given two points on an ...
Shankin algoritmin ja raa'an voiman menetelmän toteutus diskreetin logaritmin ongelman ratkaisuun kokonaisluvuille modulo p. Tämä projekti on osa kandidaatin ...
We define three hard problems in the theory of elliptic divisibility sequences (EDS Association, EDS Residue and EDS Discrete Log), each of which is solvable in sub-exponential time if and only if the ...
Abstract: The difficulty in solving the discrete logarithm problem (DLP) is very important to the cryptography since it is widely used in signature schemes, message encryption, authentication, and so ...
Abstract: The present study investigates the difficulty of solving the mathematical problem, namely DLP (Discrete Logarithm Problem) for ephemeral keys. DLP is the basis for many public key ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback