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 ...

Researchers have solved one aspect of the discrete logarithm problem. This is considered to be one of the 'holy grails' of algorithmic number theory, on which the security of many cryptographic ...

This repository contains an algorithm for solving the discrete logarithm. It is efficient if the multiplicative order is a smooth number, making it an alternative to the Pohlig-Hellman algorithm. The ...

Abstract: According to different sizes of wireless sensor network (WSN), we propose a novel backoff algorithm of self-adaptive optimal contention window (SA-LL). The algorithm uses the number of nodes ...

First attempt to provide an algorithm using less memory than the "baby step giant step" algorithm for generic discrete logarithm. This algorithm uses only (small) constant memory. Proposed patch ...

Logarithms and square root are non-elementary operations frequently used in digital signal processing. In this work, implementation and design of an IP-Core to compute square root and multibase ...

ABSTRACT: Numerous cryptographic algorithms (ElGamal, Rabin, RSA, NTRU etc) require multiple computations of modulo multiplicative inverses. This paper describes and validates a new algorithm, called ...

ABSTRACT: In this paper is demonstrated a method for reduction of integer factorization problem to an analysis of a sequence of modular elliptic equations. As a result, the paper provides a ...