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

In early September 2014 Bernie J asked me to write up an algorithm for computing logarithms that I had told him about in conversation some years ago. I was learning Python, so I decided it would be a ...

Typical algorithms used to compute logarithms are not quick and have a variable execution time depending on the input value. The technique [Ihsan] is using is both fast and has a constant run time.

New algorithm shakes up cryptography Date: May 15, 2014 Source: CNRS Summary: Researchers have solved one aspect of the discrete logarithm problem. This is considered to be one of the 'holy grails ...

A logarithm can be thought of as the inverse of an exponential, so the above equation has the same meaning as: 2 x = 64. Since 2 x 2 x 2 x 2 x 2 x 2 = 64, 2 6 = 64. This means if we fold a piece ...

This paper presents an efficient hardware algorithm for variable-precision logarithm. The algorithm uses an iterative technique that employs table lookups and polynomial approximations. Compared to ...

Abstract: The discrete logarithm problem (DLP) is to find a solution n such that g n = h in a finite cyclic group G = 〈g〉, where h ∊ G. The DLP is the security foundation of many cryptosystems, such ...

The presented algorithm is robust and finds the nearest neighbor in a logarithmic order. The proposed algorithm reports the nearest neighbor in , where k is a very small constant when compared with ...