applied-cryptography/appliedcrypto
1
0
Fork 0
mirror of https://github.com/billbuchanan/appliedcrypto.git synced 2026-02-21 11:18:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update to Lab 1 README

Browse Source
This commit is contained in:
Callum Turino
2025-01-27 12:01:07 +00:00
committed by GitHub
parent cbf19f8c44
commit b39431db8e
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
unit01_cipher_fundamentals/lab/README.md
View File

@@ -191,7 +191,7 @@ Result = value<sup>x</sup> mod (prime number)
For example, if we have a prime number of 269, and a value of 8 with an x value of 5, the result of this operation will be:
Result = 85 mod 269 = 219
Result = 8<sup>5</sup> mod 269 = 219
With prime numbers, if we know the result, it is difficult to find the value of x even though we have the other values, as many values of x can produce the same result. It is this feature which makes it difficult to determine a secret value (in this case the secret is x).