
	Where results make sense

Topic: Discrete logarithm problem

	Public-key cryptography - Wikipedia, the free encyclopedia
		The ElGamal cryptosystem (invented by Taher ElGamal then of Netscape) relies on the (similar, and related) difficulty of the discrete logarithm problem, as does the closely related DSA developed by the NSA and NIST.
		Many proofs claim that breaking an algorithm, with respect to some well-defined security goals, is equivalent to solving one of the more popular mathematical problems that are presumed to be intractable, like factoring large integers or finding discrete logarithms.
		That is, it is not known to be impossible that some relation between the keys in a key pair, or a weakness in an algorithm's operation, might be found which would allow decryption without either key, or using only the encryption key.
	en.wikipedia.org /wiki/Public-key_cryptography (3854 words)

	FreeS/WAN glossary (Site not responding. Last check: 2007-11-01)
		discrete logarithm problem and is secure unless someone finds an efficient solution to that problem.
		The discrete log problem is the basis of several cryptographic systems, including the Diffie-Hellman key exchange used in the IKE protocol.
		An attacker cannot deduce i from the cyphertext c, short of either factoring N or solving the discrete logarithm problem for this field.
	www.freeswan.org /freeswan_snaps/CURRENT-SNAP/doc/glossary.html (10741 words)

	21C3: Schedule Day 1
		The talk will give an introduction to elliptic curve cryptography and explain some recent developments regarding attacks on the discrete logarithm problem on elliptic curves.
		There are a variety of problems in biology and biochemistry which can only in recent years be addressed by computational methods.
		Phishing became a serious problem in 2004 with media coverage even in non-technical context.
	www.ccc.de /congress/2004/fahrplan/day_1.en.html (2719 words)

	References for 2005
		The Equivalence Between the DHP and DLP for Elliptic Curves Used in Practical Applications, Revisited.
		On the Discrete Logarithm Problem on Algebraic Tori.
		Faster algorithms for &delta, &gamma matching and related problems.
	www.compsci.bristol.ac.uk /Publications/pub_by_year.jsp?year=2005 (2786 words)

	PlanetMath:
		elliptic curve discrete logarithm problem owned by mathcam
		elliptic curve discrete log problem (=elliptic curve discrete logarithm problem) owned by mathcam
		extension problem (in group extension) owned by CWoo
	planetmath.org /encyclopedia/E (2166 words)

	Alfred Menezes - Research Interests and Publications
		"Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman problem" (with N. Koblitz)
		"Solving elliptic curve discrete logarithm problems using Weil descent" (with M. Jacobson and A. Stein)
		chapter in Handbook of Discrete and Combinatorial Mathematics, CRC Press, 1999, pages 889-954.
	www.cacr.math.uwaterloo.ca /~ajmeneze/research.html (1059 words)

Try your search on: Qwika (all wikis)