Lecture

Elliptic Curve Cryptography: Galois Fields

In course
DEMO: duis fugiat
Cillum enim ut elit officia laboris. Sunt laboris veniam minim non eu id commodo ut tempor veniam reprehenderit aliqua. Esse magna eiusmod id quis ea proident ad in duis duis.
Login to see this section
Description

This lecture covers the concepts of Galois fields and elliptic curve cryptography. It starts by explaining the properties of finite fields and their cardinality. Then, it delves into the construction of Galois fields and their isomorphism. The lecture also explores the arithmetic operations in elliptic curves, including addition and multiplication. Additionally, it discusses the group structure in elliptic curves and the points of order 2. The lecture concludes with practical examples and tips related to characteristic 2 fields and twist curves. Various cryptographic problems related to RSA security are also addressed, such as RSA decryption, key recovery, and factorization problems.

Instructor
dolor culpa nostrud incididunt
Esse reprehenderit anim dolor qui aute eu adipisicing laborum laboris. Aliqua culpa incididunt Lorem pariatur dolore anim. Eiusmod ipsum id cupidatat adipisicing incididunt occaecat eu irure. Eiusmod officia proident occaecat deserunt adipisicing minim esse. Culpa qui exercitation anim deserunt nisi cupidatat laborum culpa id esse do. Magna proident dolor ea minim id est deserunt veniam Lorem nulla nulla magna.
Login to see this section
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 (36)
Finite Fields: Construction and Properties
Explores the construction and properties of finite fields, including irreducible polynomials and the Chinese Remainder Theorem.
Galois Fields and Elliptic Curves
Introduces Galois fields, elliptic curves, factorization algorithms, and the discrete logarithm problem in cryptography.
Finite Fields: Properties and Applications
Explores the properties and applications of finite fields, including isomorphism and cyclic properties.
Algebraic Curves: Normalization
Covers the normalization process of plane algebraic curves, focusing on irreducible polynomials and affine curves.
Bar Construction: Homology Groups and Classifying Space
Covers the bar construction method, homology groups, classifying space, and the Hopf formula.
Show more