Newton Institute
>
Web Seminars
>
Programmes & Workshops
>
2008
>
CSM
>
CSMW02
> Montenegro, 2008-03-26
26 Mar 2008
A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm
R. Montenegro (Massachusetts Lowell)
[
abstract for this talk
] [
use frames
] [
help
] [
search
] [
first section
]
presentation as: [
Adobe PDF
593kB
]
video:
Flash
87MB
[
download
][
play
]
MP4
193MB
[
download
]
QuickTime
73MB
[
download
][
play
]
Real
158MB
[
download
][
play
]
WMV
79MB
[
download
]
sound for entire talk as: [
MP3
11MB
]
Thumbnails
Newton Institute
>
Web Seminars
>
Programmes & Workshops
>
2008
>
CSM
>
CSMW02
> Montenegro, 2008-03-26
Comments or suggestions?
Send feedback!