Discrete logarithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Discrete logarithm" in English language version.

refsWebsite

Global rank English rank

6doi.org

2^nd place

2worldcat.org

5^th place

1uwaterloo.ca

3,153^rd place

2,332^nd place

1taylorfrancis.com

3,142^nd place

2,072^nd place

1springer.com

274^th place

309^th place

1arxiv.org

69^th place

59^th place

1ams.org

451^st place

277^th place

1semanticscholar.org

11^th place

8^th place

1acm.org

1,185^th place

840^th place

1rfc-editor.org

6,184^th place

4,465^th place

acm.org (Global: 1,185^th place; English: 840^th place)

dl.acm.org

Adrian, David; Bhargavan, Karthikeyan; Durumeric, Zakir; Gaudry, Pierrick; Green, Matthew; Halderman, J. Alex; Heninger, Nadia; Springall, Drew; Thomé, Emmanuel; Valenta, Luke; VanderSloot, Benjamin; Wustrow, Eric; Zanella-Béguelin, Santiago; Zimmermann, Paul (2015-10-12). "Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice". Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. ACM. pp. 5–17. doi:10.1145/2810103.2813707. ISBN 978-1-4503-3832-5.

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Shor, Peter (1997). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer". SIAM Journal on Computing. 26 (5): 1484–1509. arXiv:quant-ph/9508027. doi:10.1137/s0097539795293172. MR 1471990. S2CID 2337707.

arxiv.org (Global: 69^th place; English: 59^th place)

Shor, Peter (1997). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer". SIAM Journal on Computing. 26 (5): 1484–1509. arXiv:quant-ph/9508027. doi:10.1137/s0097539795293172. MR 1471990. S2CID 2337707.

doi.org (Global: 2^nd place; English: 2^nd place)

Menezes, Alfred J.; van Oorschot, Paul C.; Vanstone, Scott A. (1996). "Public-Key Encryption" (PDF). Handbook of Applied Cryptography (1 ed.). CRC Press. p. 294. doi:10.1201/9780429466335. ISBN 978-0-429-46633-5.
Lam, Kwok-Yan; Shparlinski, Igor; Wang, Huaxiong; Xing, Chaoping, eds. (2001). Cryptography and Computational Number Theory. Basel: Birkhäuser Basel. pp. 54–56. doi:10.1007/978-3-0348-8295-8. eISSN 2297-0584. ISBN 978-3-0348-9507-1. ISSN 2297-0576.
Shor, Peter (1997). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer". SIAM Journal on Computing. 26 (5): 1484–1509. arXiv:quant-ph/9508027. doi:10.1137/s0097539795293172. MR 1471990. S2CID 2337707.
Blake, Ian F.; Garefalakis, Theo (2004-04-01). "On the complexity of the discrete logarithm and Diffie–Hellman problems". Journal of Complexity. Festschrift for Harald Niederreiter, Special Issue on Coding and Cryptography. 20 (2): 148–170. doi:10.1016/j.jco.2004.01.002. ISSN 0885-064X.
Adrian, David; Bhargavan, Karthikeyan; Durumeric, Zakir; Gaudry, Pierrick; Green, Matthew; Halderman, J. Alex; Heninger, Nadia; Springall, Drew; Thomé, Emmanuel; Valenta, Luke; VanderSloot, Benjamin; Wustrow, Eric; Zanella-Béguelin, Santiago; Zimmermann, Paul (2015-10-12). "Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice". Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. ACM. pp. 5–17. doi:10.1145/2810103.2813707. ISBN 978-1-4503-3832-5.
Harkins, D.; Carrel, D. (November 1998). The Internet Key Exchange (IKE) (Report). RFC Editor. doi:10.17487/rfc2409.

rfc-editor.org (Global: 6,184^th place; English: 4,465^th place)

Harkins, D.; Carrel, D. (November 1998). The Internet Key Exchange (IKE) (Report). RFC Editor. doi:10.17487/rfc2409.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Shor, Peter (1997). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer". SIAM Journal on Computing. 26 (5): 1484–1509. arXiv:quant-ph/9508027. doi:10.1137/s0097539795293172. MR 1471990. S2CID 2337707.

springer.com (Global: 274^th place; English: 309^th place)

link.springer.com

Lam, Kwok-Yan; Shparlinski, Igor; Wang, Huaxiong; Xing, Chaoping, eds. (2001). Cryptography and Computational Number Theory. Basel: Birkhäuser Basel. pp. 54–56. doi:10.1007/978-3-0348-8295-8. eISSN 2297-0584. ISBN 978-3-0348-9507-1. ISSN 2297-0576.

taylorfrancis.com (Global: 3,142^nd place; English: 2,072^nd place)

Menezes, Alfred J.; van Oorschot, Paul C.; Vanstone, Scott A. (1996). "Public-Key Encryption" (PDF). Handbook of Applied Cryptography (1 ed.). CRC Press. p. 294. doi:10.1201/9780429466335. ISBN 978-0-429-46633-5.

uwaterloo.ca (Global: 3,153^rd place; English: 2,332^nd place)

cacr.uwaterloo.ca

Menezes, Alfred J.; van Oorschot, Paul C.; Vanstone, Scott A. (1996). "Public-Key Encryption" (PDF). Handbook of Applied Cryptography (1 ed.). CRC Press. p. 294. doi:10.1201/9780429466335. ISBN 978-0-429-46633-5.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Lam, Kwok-Yan; Shparlinski, Igor; Wang, Huaxiong; Xing, Chaoping, eds. (2001). Cryptography and Computational Number Theory. Basel: Birkhäuser Basel. pp. 54–56. doi:10.1007/978-3-0348-8295-8. eISSN 2297-0584. ISBN 978-3-0348-9507-1. ISSN 2297-0576.
Blake, Ian F.; Garefalakis, Theo (2004-04-01). "On the complexity of the discrete logarithm and Diffie–Hellman problems". Journal of Complexity. Festschrift for Harald Niederreiter, Special Issue on Coding and Cryptography. 20 (2): 148–170. doi:10.1016/j.jco.2004.01.002. ISSN 0885-064X.

Discrete logarithm (English Wikipedia)

acm.org (Global: 1,185th place; English: 840th place)

dl.acm.org

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)

rfc-editor.org (Global: 6,184th place; English: 4,465th place)

semanticscholar.org (Global: 11th place; English: 8th place)