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 README.md

Browse Source
This commit is contained in:
Bill Buchanan
2023-01-26 20:21:41 +00:00
committed by GitHub
parent f2205c59f5
commit 1cfdacde1e
1 changed files with 10 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
unit01_cipher_fundamentals/lab/README.md
View File

@@ -227,16 +227,22 @@ Now prove the following:
An outline of the Python 2.7 code is:
```python
message = raw_input('Enter message: ')
e = raw_input('Enter exponent: ')
p = raw_input('Enter prime ')
message = input('Enter message value: ')
e = input('Enter exponent: ')
p = input('Enter prime ')
cipher = (int(message) ** int(e)) % int(p)
print (cipher)
print (f"Result is: {cipher}")
```
Note: In Python 3.x, we using input() instead of raw_input().
# Setting up AWS
You should have an account for AWS. Access your AWS Lab, and
# Additional Lab
## D Simple prime number test
A prime number is a value which only has factors of 1 and itself. Prime numbers are used fairly extensively in cryptography, as computers struggle to factorize them when they are multiplied together. The simplest test for a prime number is to divide the value from all the integers from 2 to the value divided by 2. If any of the results leaves no remainder, the value is a prime, otherwise it is composite. We can obviously improve on this by getting rid of even numbers which are greater than 2, and also that the highest value to be tested is the square root of the value.