To understand philosophy of RSA cryptosystem

Version 1.0.3 (1.5 KB) by Chixin Xiao
This code segment aims to illustrate the philosophy of RSA cryptosystem by using Symbolic Math Toolbox.
0.0
(0)
23 Downloads
Updated 16 Oct 2022

View License

This code segment aims to illustrate the philosophy of RSA cryptosystem. One can find that the result of the expression, mod(x^e^d, N) == x, is always 'true' as long as three suitable constants, e,d and N, are given. For example, e = 11; d = 95; N = 1121; and x is a variable in [1,128]. Because x^e^d will be a huge number which cannot be calculated precisely, here we adopt the Symbolic Math Toolbox in Matlab.
The explanation in detail is on my Youtube Channel, 'How to understand RSA philosophy by using programming'.
https://www.youtube.com/watch?v=A5TEzPG4T_k

Cite As

Chixin Xiao (2025). To understand philosophy of RSA cryptosystem (https://www.mathworks.com/matlabcentral/fileexchange/72411-to-understand-philosophy-of-rsa-cryptosystem), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2019a
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Version Published Release Notes
1.0.3

Add a profile picture
1.0.2

The corresponding Youtube video is relinked.
1.0.1

Increase the corresponding Youtube link
1.0.0