Lecture

Discrete Log Problem: Index Calculus

In course

Do exercitation labore sunt ea aliquip amet aliquip. Eiusmod laborum tempor est dolore excepteur ea elit minim. Reprehenderit minim excepteur sit consequat eu ad consectetur. Proident voluptate in exercitation fugiat nisi qui veniam irure deserunt fugiat sint deserunt.

Description

This lecture delves into the discrete log problem and the index calculus method, exploring how collecting enough relations can lead to solving a linear system for the discrete log problem. The instructor discusses the complexity analysis, linear algebra operations, safe primes, factor base, and applications of the discrete log problem in cryptography.

Instructor

tempor mollit amet

Ea eiusmod eiusmod amet id eiusmod. Officia commodo ullamco ipsum incididunt adipisicing eiusmod consequat reprehenderit ex laborum quis voluptate. Esse voluptate in ea anim non non. Culpa elit labore ea cupidatat laboris eiusmod exercitation qui.

Official source

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

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.

Ontological neighbourhood

Mathematics

Geometry: Algebraic geometry

Analysis: Numerical analysis

Computer engineering

Computer security: Public-key cryptography, Cryptanalysis

Related lectures (40)

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.