The RSA - A simple math example

preview_player
Показать описание
First, I like to apologize for making a mistake in my last video - The RSA Cryptosystem. Step 3 should be decryption, not key generation. It is a big mistake. I apologize for causing some confusion.
Last time I talked about how the RSA works with math formulas. Today I will demonstrate how it works with one simple example.
Playlists:
Basic Cryptography
Advanced Cryptography:
Public Key Infrastructure

Privacy Enhanced Technologies
Business continuity
Cyber Attacks and Defense
Remote Access & WAN Technologies
Рекомендации по теме
Комментарии
Автор

Excuse me Prof i could not really get the meaning of coprime numbers with 14 in this context. For what i know a prime number has only 2 factors that is 1 and the number itself. Please i need further explanations on that part. Thanks🙏🙏🙏

sylvaincena
Автор

Prof. Sun, is the Cryptography book by Prof. Forouzan recommended for this topic?

ArghyadeepPal
Автор

In your example, what would happen if we used a letter corresponding to a higher value for the encryption? Because it looks the inequality is not satisfied.

vipermustang
Автор

Great Video Lectures Ever.
From ETHIOPIA

Ethio-
Автор

Thanks for the content. RSA more clear now.

ostanin_vadym
Автор

How about if plaintext its a long sentence?

kharismawanakbar