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

Remove compression section from README

Browse Source 
Removed section on data compression and its examples.
This commit is contained in:
Bill Buchanan
2026-01-25 14:10:46 +00:00
committed by GitHub
parent 27679d4dd2
commit f2cf85e1f7
1 changed files with 0 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
unit01_cipher_fundamentals/lab/README.md
View File

@@ -154,20 +154,6 @@ Web link (Factorization): [here](https://asecuritysite.com/primes/factors)
Think of two extremely large values and determine their factors.
### A.13 Compression
Another format we can use for our data is compression, and we can do the compression before or after the encryption process. One of the most popular methods is gzip compress, and which uses the LZ method to reduce the number of bits used. For this we will use node.js. Create a file named a_13.js and determine what the following Base64 conversions are when they are uncompressed (Hint: they are cities of the World):
Web link (Compression): [here](https://asecuritysite.com/encryption/gzip)
Take a string of “abc” and compress it, and now keep building up the string with the same sequence (such as “abcabc…”). What do you observe from the length of the compression string if you use a random characters of the same length as an input:
```python
eJzzyc9Lyc8DAAgpAms=
eJxzSi3KycwDAAfXAl0=
eJzzSy1XiMwvygYADKUC8A==
```
## B GCD
GCD is known as the greatest common divisor, or greatest common factor (gcf), and is the largest positive integer that divides into two numbers without a remain-der. For example, the GCD of 9 and 15 is 3. It is used many encryption algorithms, and a sample algorithm to determine the GCD of two values (a and b) is given on: