Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Teske, Edlyn"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On prime-order elliptic curves with embedding degrees
k=3, 4,
and
6
Koray Karabina
,
Edlyn Teske
Lecture Notes in Computer Science
5011
, 2008, pp. 102-117
Factoring
N = pq^2
with the elliptic curve method
Peter Ebinger
,
Edlyn Teske
Lecture Notes in Computer Science
2369
, 2002, pp. 475-490
Baby-step giant-step algorithms for non-uniform distributions
Simon R. Blackburn
,
Edlyn Teske
Lecture Notes in Computer Science
1838
, 2000, pp. 153-168
A note on Shanks's chains of primes
Edlyn Teske
,
Hugh C. Williams
Lecture Notes in Computer Science
1838
, 2000, pp. 563-580
The Pohlig-Hellman method generalized for group structure computation
Edlyn Teske
Journal Symbolic Computation
27
(6), 1999, pp. 521-534
Speeding up Pollard's rho method for computing discrete logarithms
Edlyn Teske
Lecture Notes in Computer Science
1423
, 1998, pp. 541-554