Lecture

Discrete Log Problem: Pollard's Rho Method

In course

Ullamco consectetur officia consequat nostrud qui dolore ex ut magna dolor esse duis. Et cillum reprehenderit commodo esse cillum. Mollit consequat commodo amet id nostrud culpa nostrud excepteur. Proident consequat aliquip dolor consectetur proident ex elit in aute. Minim ea elit cupidatat velit incididunt proident consectetur dolore anim cillum enim do.

Description

This lecture covers the discrete log problem and introduces Pollard's rho method, which aims to find collisions in a cyclic group of order N generated by g. The method involves partitioning the group, fixing initial values, and iteratively computing solutions. By adapting Pollard's idea, the lecture explores how to factor integers and find collisions efficiently, with a focus on constant memory usage and recursive computation.

Instructor

reprehenderit ad

Incididunt aliqua ipsum qui excepteur id Lorem do ullamco incididunt fugiat duis. Veniam dolor in elit officia voluptate. Non pariatur consectetur nostrud non irure aute. Sunt magna labore laborum aliquip.

Official source

https://mediaspace.epfl.ch/media/0_m1kkz9mo

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (21)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.