Extended Euclidean algorithm

Applied sciences
Computer engineering
Computer security
Cryptanalysis

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (10)

Euclid and Bézout: Algorithms and Theorems

Explores the Euclidean algorithm, Bézout's identity, extended Euclid algorithm, and commutative groups in mathematics.

Euclidean Algorithm

Explains the Euclidean algorithm for polynomials over a field K, illustrating its application with examples.

Number Theory: Quiz

Covers fundamental concepts in number theory with examples and quizzes.

Polynomial Methods: GCD Calculation Summary

Covers the calculation of the greatest common divisor using polynomial methods and the Euclidean algorithm.

Graph Mining: Social Networks Analysis

Explores graph mining in social networks, covering modularity algorithms and community detection.

Polynomial Division & Observer/Controller Approach

Covers polynomial division and observer/controller approach with step-by-step examples.

Ideals: Polynomials and Definitions

Explores ideals in K[X], including PGCD, uniqueness, coprimality, and theorems of Bézout and Gauss.

Number Theory: Foundations and Applications in Cryptography

Introduces number theory and its essential applications in cryptography.

Extended Binomial Theorem

Explores the Extended Binomial Theorem and counting problems using generating functions.

RSA: Privacy and Signatures

Explores RSA encryption for privacy and digital signatures, covering keys generation, decoding, possible attacks, hash functions, and cryptographic standards.

Page 1 of 1