RSA Encryption: Main Concepts

In course

Consequat duis culpa incididunt fugiat ea esse deserunt magna eu adipisicing deserunt dolor. Velit duis veniam sunt tempor eiusmod labore qui id voluptate occaecat non ullamco. Anim culpa cillum dolor dolor. Amet dolore mollit aute culpa aliqua. Eu dolore adipisicing quis amet minim ea voluptate duis aliquip enim laborum cupidatat. Non ex non exercitation ullamco. Cupidatat veniam magna velit proident aute ut sunt proident sint commodo.

Description

This lecture covers the main concepts behind RSA encryption, including groups defined by generators and relations, homomorphisms of groups, isomorphism, and automorphism. Examples of homomorphisms between cyclic groups are also discussed, illustrating the application of RSA in practice.

Instructor

reprehenderit ex cupidatat anim

Ut deserunt eu ullamco reprehenderit non dolore sit excepteur voluptate nisi velit aliquip culpa. Quis deserunt occaecat et voluptate ipsum nulla. Ullamco labore exercitation aliquip commodo cupidatat occaecat est. Eu veniam mollit tempor est adipisicing adipisicing.

Official source

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

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

Algebra: Abstract algebra, Representation theory

Mathematical logic: Set theory

Related lectures (81)