Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Discrete logarithm records (view)

searching for Discrete logarithm 24 found (271 total)

Generic group model (401 words) [view diff] exact match in snippet view article find links to article

consider the encoding of the group. This question was answered for the discrete logarithm problem by Victor Shoup using the generic group model. Other results

Outline of cryptography (1,901 words) [view diff] exact match in snippet view article find links to article

agreement; CRYPTREC recommendation El Gamal – discrete logarithm Elliptic curve cryptography – (discrete logarithm variant) PSEC-KEM – NESSIE selection asymmetric

Pairing-based cryptography (1,150 words) [view diff] exact match in snippet view article find links to article

Limited improved the previous bound for successfully computing a discrete logarithm on a supersingular elliptic curve from 676 bits to 923 bits. In 2016

Fiat–Shamir heuristic (1,068 words) [view diff] exact match in snippet view article find links to article

totient function φ. Here is an interactive proof of knowledge of a discrete logarithm in Z q ∗ {\displaystyle \mathbb {Z} _{q}^{*}} , based on Schnorr signature

Tate pairing (188 words) [view diff] exact match in snippet view article find links to article

Frey, Gerhard (1994), "A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves", Mathematics of Computation

Security level (1,332 words) [view diff] case mismatch in snippet view article find links to article

approximately f / 2: this is because the method to break the Elliptic Curve Discrete Logarithm Problem, the rho method, finishes in 0.886 sqrt(2f) additions. The

Alfred Menezes (816 words) [view diff] exact match in snippet view article find links to article

(2003), 119–134. doi:10.1023/A:1022595222606 "Solving elliptic curve discrete logarithm problems using Weil descent" (with M. Jacobson and A. Stein), Journal

Alfred Menezes (816 words) [view diff] exact match in snippet view article find links to article

(2003), 119–134. doi:10.1023/A:1022595222606 "Solving elliptic curve discrete logarithm problems using Weil descent" (with M. Jacobson and A. Stein), Journal

Paul Zimmermann (mathematician) (505 words) [view diff] exact match in snippet view article

contributed to some of the record computations in integer factorisation and discrete logarithm. Zimmermann co-authored the book Computational Mathematics, published

Anonymous veto network (549 words) [view diff] exact match in snippet view article find links to article

\scriptstyle g} of prime order q {\displaystyle \scriptstyle q} in which the discrete logarithm problem is hard. For example, a Schnorr group can be used. For a group

PlayStation 3 cluster (1,411 words) [view diff] case mismatch in snippet view article find links to article

AK, Montgomery PL (2012). "Solving a 112-bit Prime Elliptic Curve Discrete Logarithm Problem on Game Consoles using Sloppy Reduction". International Journal

Primon gas (1,318 words) [view diff] exact match in snippet view article find links to article

{log}}} is an algorithm for integer factorisation, analogous to the discrete logarithm, and F {\displaystyle F} is the successor function. Thus, we have:

Nigel Smart (cryptographer) (872 words) [view diff] exact match in snippet view article

Hewlett Packard Laboratories Technical Report, 2000. N. Smart, The discrete logarithm problem on elliptic curves of trace one, Journal of Cryptology, Volume

Moti Yung (1,628 words) [view diff] exact match in snippet view article find links to article

Standard detailing the Dual EC DRBG, essentially exploiting the repeated discrete logarithm based "kleptogram" introduced by Young and Yung. In 2010 he was the

Alice and Bob (2,023 words) [view diff] case mismatch in snippet view article find links to article

Pierrick; Heninger, Nadia; Thomé, Emmanuel (2017). "A Kilobit Hidden SNFS Discrete Logarithm Computation". Advances in Cryptology – EUROCRYPT 2017 (PDF). Lecture

Computer algebra (3,021 words) [view diff] exact match in snippet view article find links to article

known as Pollard's lambda algorithm): an algorithm for solving the discrete logarithm problem Polynomial long division: an algorithm for dividing a polynomial

Integer factorization records (2,022 words) [view diff] exact match in snippet view article find links to article

F. Boudot et al, "Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment," June 10, 2020. "LISTSERV - NMBRTHRY Archives

Neural cryptography (2,220 words) [view diff] exact match in snippet view article find links to article

the opportunity to solve complicated problems in a short time, e.g. discrete logarithm problem or factorization. Algorithms that are not based on any of

DRE-i with enhanced privacy (1,747 words) [view diff] exact match in snippet view article find links to article

g_{2}} be two random generators of G q {\displaystyle G_{q}} , whose discrete logarithm relationship is unknown. This can be realized by choosing a non-identity

Delaram Kahrobaei (1,407 words) [view diff] case mismatch in snippet view article find links to article

F. (2024). "A Subexponential Quantum Algorithm for the Semidirect Discrete Logarithm Problem". Post-Quantum Cryptography. Lecture Notes in Computer Science

Dual EC DRBG (6,730 words) [view diff] exact match in snippet view article find links to article

280, and searching the list would be about as hard as solving the discrete logarithm problem. The cost of this method is that the ECRNG is made half as

List of ISO standards 18000–19999 (7,947 words) [view diff] exact match in snippet view article find links to article

ISO/IEC 18370-1:2016 Part 1: General ISO/IEC 18370-2:2016 Part 2: Discrete logarithm based mechanisms ISO/IEC 18372:2004 Information technology – RapidIO

List of ISO standards 14000–15999 (10,419 words) [view diff] exact match in snippet view article find links to article

Integer factorization based mechanisms ISO/IEC 14888-3:2016 Part 3: Discrete logarithm based mechanisms ISO 14889:2013 Ophthalmic optics – Spectacle lenses

List of ISO standards 8000–9999 (9,553 words) [view diff] exact match in snippet view article find links to article

Integer factorization based mechanisms ISO/IEC 9796-3:2006 Part 3: Discrete logarithm based mechanisms ISO/IEC 9797 Information technology – Security techniques