When.com Web Search

Search results

1. Results From The WOW.Com Content Network

2. Discrete logarithm - Wikipedia

   en.wikipedia.org/wiki/Discrete_logarithm

   Analogously, in any group G, powers b k can be defined for all integers k, and the discrete logarithm log b a is an integer k such that b k = a. In arithmetic modulo an integer m , the more commonly used term is index : One can write k = ind b a (mod m ) (read "the index of a to the base b modulo m ") for b k ≡ a (mod m ) if b is a primitive ...

3. Function field sieve - Wikipedia

   en.wikipedia.org/wiki/Function_field_sieve

   The discrete logarithm problem in a finite field consists of solving the equation = for ,, a prime number and an integer. The function f : F p n → F p n , a ↦ a x {\displaystyle f:\mathbb {F} _{p^{n}}\to \mathbb {F} _{p^{n}},a\mapsto a^{x}} for a fixed x ∈ N {\displaystyle x\in \mathbb {N} } is a one-way function used in cryptography .

4. Logarithm - Wikipedia

   en.wikipedia.org/wiki/Logarithm

   Binary logarithms are also used in computer science, where the binary system is ubiquitous; in music theory, where a pitch ratio of two (the octave) is ubiquitous and the number of cents between any two pitches is a scaled version of the binary logarithm, or log 2 times 1200, of the pitch ratio (that is, 100 cents per semitone in conventional ...

5. Hidden subgroup problem - Wikipedia

   en.wikipedia.org/wiki/Hidden_subgroup_problem

   The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. The framework captures problems such as factoring, discrete logarithm, graph isomorphism, and the shortest vector problem.

6. Computational Diffie–Hellman assumption - Wikipedia

   en.wikipedia.org/wiki/Computational_Diffie...

   Computing the discrete logarithm is the only known method for solving the CDH problem. But there is no proof that it is, in fact, the only method. It is an open problem to determine whether the discrete log assumption is equivalent to the CDH assumption, though in certain special cases this can be shown to be the case. [3] [4]

7. Pollard's kangaroo algorithm - Wikipedia

   en.wikipedia.org/wiki/Pollard's_kangaroo_algorithm

   In computational number theory and computational algebra, Pollard's kangaroo algorithm (also Pollard's lambda algorithm, see Naming below) is an algorithm for solving the discrete logarithm problem. The algorithm was introduced in 1978 by the number theorist John M. Pollard , in the same paper as his better-known Pollard's rho algorithm for ...