Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2765016
Jump to:navigation, search

zbMath1001.11059MaRDI QIDQ2765016

Edlyn Teske

Publication date: 4 July 2002


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cryptographydiscrete logarithmsstate of the artkangaroo methodbaby-step giant-step methodrho method


Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)


Related Items

Baby-step giant-step algorithms for the symmetric group ⋮ Computing low-weight discrete logarithms ⋮ Non-Interactive Key Exchange ⋮ A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm ⋮ A nonlinear elliptic curve cryptosystem based on matrices ⋮ On the low Hamming weight discrete logarithm problem for nonadjacent representations ⋮ Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых ⋮ Construction of strong elliptic curves suitable for cryptographic applications ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2765016&oldid=15642099"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 15:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki