Search results
Jump to navigation
Jump to search
Page title matches
- == "A quasi-polynomial algorithm for discrete logarithm ..." ==369 bytes (54 words) - 22:39, 23 March 2014
- '''Discrete logarithm''' is a problem of finding logarithms in a [[finite field]]. Given a field5 KB (772 words) - 17:15, 6 August 2013
- 179 bytes (28 words) - 23:17, 23 December 2007
- | pagename = Discrete logarithm | abc = Discrete logarithm819 bytes (65 words) - 12:05, 16 October 2010
- 12 bytes (1 word) - 15:20, 21 January 2008
- 88 bytes (12 words) - 22:16, 3 January 2009
- 307 bytes (40 words) - 11:59, 15 June 2009
Page text matches
- == "A quasi-polynomial algorithm for discrete logarithm ..." ==369 bytes (54 words) - 22:39, 23 March 2014
- | pagename = Discrete logarithm | abc = Discrete logarithm819 bytes (65 words) - 12:05, 16 October 2010
- {{r|Discrete logarithm}}201 bytes (27 words) - 11:59, 15 June 2009
- {{r|Discrete logarithm}}237 bytes (29 words) - 08:06, 14 January 2009
- {{r|Discrete logarithm}}483 bytes (61 words) - 19:50, 11 January 2010
- {{r|Discrete logarithm}}608 bytes (77 words) - 15:58, 11 January 2010
- {{r|Discrete logarithm}}692 bytes (91 words) - 16:33, 11 January 2010
- {{r|Discrete logarithm}}762 bytes (99 words) - 17:00, 11 January 2010
- '''Discrete logarithm''' is a problem of finding logarithms in a [[finite field]]. Given a field5 KB (772 words) - 17:15, 6 August 2013
- The Diffie-Hellman method is based on the [[discrete logarithm]] problem and is secure unless someone finds an efficient solution to that Given a prime p and generator g (see [[discrete logarithm]]), Alice:6 KB (954 words) - 05:48, 8 April 2024
- == [[Discrete logarithm]] == ...ot directly mentioned in an article. When a Related Articles subpage for [[Discrete Logarithm]] is created by you or anyone else, it should probably include a link back16 KB (2,648 words) - 22:41, 3 January 2009
- ...alk:Howard_C._Berkowitz#Approvals.3F | list]]. Some, such as [[RSA]] and [[discrete logarithm]], really need a math editor to improve or approve them. [[User:Sandy Harri5 KB (781 words) - 09:03, 17 February 2021
- ...factorization]] problem, while Diffie-Hellman and DSA are related to the [[discrete logarithm]] problem. More recently, [[elliptic curve cryptography]] has developed in8 KB (1,233 words) - 05:48, 8 April 2024
- ...alk:Howard_C._Berkowitz#Approvals.3F | list]]. Some, such as [[RSA]] and [[discrete logarithm]], really need a math editor to improve or approve them. [[User:Sandy Harri8 KB (1,252 words) - 11:12, 30 October 2011
- ...utational problems, such as the [[integer factorisation]] problem or the [[discrete logarithm]] problem. In many cases, there are proofs that cryptographic techniques a9 KB (1,312 words) - 05:49, 8 April 2024
- ...from [[integer factorisation]], the [[Diffie-Hellman]] protocol from the [[discrete logarithm]] problem, and other systems from various [[elliptic curve]] problems. In a ...olving the [[elliptic curve cryptography|elliptic curve-based]] version of discrete logarithm are much more time-consuming than the best known algorithms for factoring,32 KB (4,913 words) - 14:38, 18 March 2024
- ...from [[integer factorisation]], the [[Diffie-Hellman]] protocol from the [[discrete logarithm]] problem, and other systems from various [[elliptic curve]] problems. In a ...olving the [[elliptic curve cryptography|elliptic curve-based]] version of discrete logarithm are much more time-consuming than the best known algorithms for factoring,32 KB (4,916 words) - 05:49, 8 April 2024
- ...and [[Diffie-Hellman]] are near the border between crypto and math, and [[discrete logarithm]] is almost entirely math. I think they are reasonable from a crypto point12 KB (1,936 words) - 09:30, 7 June 2016
- ...factorization]] problem, while Diffie-Hellman and DSA are related to the [[discrete logarithm]] problem. More recently, ''[[elliptic curve cryptography]]'' has develope ...olving the [[elliptic curve cryptography|elliptic curve-based]] version of discrete logarithm are much more time-consuming than the best known algorithms for factoring,51 KB (7,594 words) - 02:25, 1 April 2024
- ...factorization]] problem, while Diffie-Hellman and DSA are related to the [[discrete logarithm]] problem. More recently, ''[[elliptic curve cryptography]]'' has develope ...olving the [[elliptic curve cryptography|elliptic curve-based]] version of discrete logarithm are much more time-consuming than the best known algorithms for factoring,52 KB (7,723 words) - 02:25, 1 April 2024