Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Edlyn Teske"'
Autor:
Edlyn Teske
Publikováno v:
Encyclopedia of Cryptography, Security and Privacy ISBN: 9783642277399
Encyclopedia of Cryptography and Security (2nd Ed.)
Encyclopedia of Cryptography and Security (2nd Ed.)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9f18d06256fc5873d32e7da78f4d17a
https://doi.org/10.1007/978-3-642-27739-9_256-2
https://doi.org/10.1007/978-3-642-27739-9_256-2
Autor:
Safia Haloui, Edlyn Teske
Publikováno v:
Guide to Pairing-Based Cryptography ISBN: 9781315370170
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5763441047a7c1ec8b60048527ecfa30
https://doi.org/10.1201/9781315370170-4
https://doi.org/10.1201/9781315370170-4
Autor:
Alfred Menezes, Edlyn Teske
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing, 16, 439-460
A finite field K is said to be weak for elliptic curve cryptography if all instances of the discrete logarithm problem for all elliptic curves over K can be solved in significantly less time than it takes Pollard's rho method to solve the hardest ins
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3364389d3729f125ef3f28a497c46367
https://doi.org/10.1007/s00200-005-0186-8
https://doi.org/10.1007/s00200-005-0186-8
Autor:
Edlyn Teske
Publikováno v:
High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams. :341-352
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10fd2134d1bdacc6b9776608f608443d
https://doi.org/10.1090/fic/041/27
https://doi.org/10.1090/fic/041/27
Autor:
Edlyn Teske
Publikováno v:
Discrete Applied Mathematics. 130(1):61-82
The Pollard kangaroo method computes discrete logarithms in arbitrary cyclic groups. It is applied if the discrete logarithm is known to lie in a certain interval, say [a,b], and then has expected running time O(b−a) group operations. In its serial
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76c98ebe3ca6b1ee19c650cf2117207b
Publikováno v:
LMS Journal of Computation and Mathematics. 5:127-174
In this paper, the authors analyze the Gaudry-Hess-Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over characteristic two finite fields of composite extension degree. For each such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44e73b3ecb72e28519f0f756dd8059d4
https://doi.org/10.1112/s1461157000000723
https://doi.org/10.1112/s1461157000000723
Autor:
Edlyn Teske, Andreas Stein
Publikováno v:
Mathematics of Computation. 71:793-815
We show how to use the parallelized kangaroo method for computing invariants in real quadratic function fields. Specifically, we show how to apply the kangaroo method to the infrastructure in these fields. We also show how to speed up the computation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2a38949f0167abe3254d63797307bbe
https://doi.org/10.1090/s0025-5718-01-01343-6
https://doi.org/10.1090/s0025-5718-01-01343-6
Autor:
Edlyn Teske, Andreas Stein
Publikováno v:
Mathematics of Computation. 71:837-862
In this paper, we provide tight estimates for the divisor class number of hyperelliptic function fields. We extend the existing methods to any hyperelliptic function field and improve the previous bounds by a factor proportional to g with the help of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a1f3516612beece12edd0edc0ac92eb
https://doi.org/10.1090/s0025-5718-01-01385-0
https://doi.org/10.1090/s0025-5718-01-01385-0
Autor:
Edlyn Teske
Publikováno v:
Mathematics of Computation. 70:809-826
We consider Pollard's rho method for discrete logarithm computation. Usually, in the analysis of its running time the assumption is made that a random walk in the underlying group is simulated. We show that this assumption does not hold for the walk
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c042592cb34bb24c19446e1911ba024c
https://doi.org/10.1090/s0025-5718-00-01213-8
https://doi.org/10.1090/s0025-5718-00-01213-8
Publikováno v:
Designs, Codes and Cryptography. 20:41-64
The xedni calculus attack on the elliptic curve discrete logarithm problem (ECDLP) involves lifting points from the finite field{\Bbb F}_p to the rational numbers {\Bbb Q} and then constructing an elliptic curve over {\Bbb Q} that passes through them
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f65c86f948eef688b85000f245680572
https://doi.org/10.1023/a:1008312401197
https://doi.org/10.1023/a:1008312401197