Write essay_2

bibliography.bib

@@ -1,26 +1,94 @@
-@ARTICLE{shannon,
+@INPROCEEDINGS{hybrid-performance,
-  author={Shannon, C.E.},
+  author={Zhang, Qixin},
-  journal={Proceedings of the IEEE},
+  booktitle={2021 2nd International Conference on Computing and Data Science (CDS)}, 
-  title={Communication In The Presence Of Noise},
+  title={An Overview and Analysis of Hybrid Encryption: The Combination of Symmetric Encryption and Asymmetric Encryption}, 
-  year={1998},
+  year={2021},
-  volume={86},
+  volume={},
+  number={},
+  pages={616-622},
+  keywords={Information security;Information processing;Data science;Elliptic curve cryptography;Encryption;Internet;encryption algorithm;symmetric algorithm;asymmetric algorithm;hybrid encryption},
+  doi={10.1109/CDS52072.2021.00111}}
+
+@misc{performance-comparison, title={Asymmetric vs symmetric encryption-1: Comparing their performances}, url={https://securemyorg.com/asymmetric-vs-symmetric-encryption-1/}, journal={SecureMyOrg}, author={SecureMyOrg}, year={2024}, month={Dec}} 
+
+@INPROCEEDINGS{aes-performance,
+  author={Bhat, Bawna and Ali, Abdul Wahid and Gupta, Apurva},
+  booktitle={International Conference on Computing, Communication & Automation}, 
+  title={DES and AES performance evaluation}, 
+  year={2015},
+  volume={},
+  number={},
+  pages={887-890},
+  keywords={Encryption;Standards;Classification algorithms;Ciphers;Memory management;AES;DES;Cryptography;entropy},
+  doi={10.1109/CCAA.2015.7148500}}
+
+@article{rsa,
+  title={The RSA algorithm},
+  author={Milanov, Evgeny},
+  journal={RSA laboratories},
+  volume={1},
+  number={11},
+  year={2009}
+}
+
+@article{dh-key-exchange,
+  title={Diffie-Hellman Key Exchange},
+  author={Exchange, Diffie-Hellman Key},
+  journal={Diffie\% E2},
+  volume={80},
+  year={1976}
+}
+
+
+@article{symmetric-vs-asymmetric,
+  title={Symmetric and asymmetric encryption},
+  author={Simmons, Gustavus J},
+  journal={ACM Computing Surveys (CSUR)},
+  volume={11},
+  number={4},
+  pages={305--330},
+  year={1979},
+  publisher={ACM New York, NY, USA}
+}
+
+@article{symmetric-security,
+  title={Symmetric encryption algorithms: Review and evaluation study},
+  author={Alenezi, Mohammed N and Alabdulrazzaq, Haneen and Mohammad, Nada Q},
+  journal={International Journal of Communication Networks and Information Security},
+  volume={12},
   number={2},
-  pages={447-457},
+  pages={256--272},
-  keywords={Acoustic noise;Distortion;Telegraphy;Telephony;Communication systems;Bandwidth;Radio transmitters;Signal processing;Signal mapping;Teleprinting},
+  year={2020},
-  doi={10.1109/JPROC.1998.659497}}
+  publisher={Kohat University of Science and Technology (KUST)}
-
-@BOOK{huffman,
-    author={Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein},
-    title={Introduction to Algorithms},
-    volume={2},
-    year={2001},
-    pages={385-392},
-    isbn={0-262-03293-7}
 }
 
-@article{modulation,
+@article{des,
-  title={Principles of digital modulation},
+  title={Data encryption standard},
-  author={Fitton, Mike},
+  author={Standard, Data Encryption and others},
-  journal={URL http://www. berk. tc/combas/digital\_mod. pdf},
+  journal={Federal Information Processing Standards Publication},
-  year={2002}
+  volume={112},
+  number={3},
+  year={1999},
+  publisher={De Standaard}
 }
+
+@article{tls,
+  title={Transport layer security},
+  author={Turner, Sean},
+  journal={IEEE Internet Computing},
+  volume={18},
+  number={6},
+  pages={60--63},
+  year={2014},
+  publisher={IEEE}
+}
+
+@article{pgp,
+  title={„PGP--Pretty Good Privacy},
+  author={Zimmermann, Philip},
+  journal={Public Key Encryption for the Masses, User's Guide},
+  volume={1},
+  year={1997}
+}
+
+

main.typ

@@ -2,21 +2,35 @@
 
 #set page(
   paper: "a4",
-  numbering: "1",
+  //numbering: "1",
   margin: (top: 2.5cm, left: 2.5cm, right: 2.5cm, bottom: 2cm)
 )
 
+#if (context here().page()) != 1 [
+  #set page(
+    numbering: "1"
+  )
+]
+
+#set page(
+  footer: context {
+    if here().page() > 1 {
+      align(center)[#counter(page).display()]
+    }
+  }
+)
+
 #set text(
-  font: "Times New Roman",
+  //font: "Times New Roman",
   size: 12pt,
 )
 
 Marius Drechsler\
-Process Essay\
+Compare and Contrast Essay\
-May 17th, 2025
+June 21st, 2025
 
 #align(center, text(size: 17pt, weight: "bold")[
-  *The Digital Journey of Your Voice*
+  *Decoding Security: A Comparative Analysis of Symmetric and Asymmetric Encryption*
 ])
 
 #set align(left)
@@ -29,65 +43,64 @@ May 17th, 2025
 
 #show: word-count
 
-Have you ever wondered what happens with your voice when you are talking to someone on the phone?
+Modern communication is highly dependent on robust and flexible encryption methods. 
-From the instant the soundwaves leave your throat until they reach the ear of the person you are talking to,
+These methods are not only needed when transmitting a message, but also to provide secure and reliable infrastructure which is dependent on internet-communication. 
-a series of analog and digital processes collaborate to carry your message.
+To achieve such a high standard of flexibility, two prominent methods for encrypting messages are used: symmetric and asymmetric encryption.
-In fact, this whole process can be broken down into three major steps -- sampling, quantisation and modulation.
+These two kinds of encryption algorithms use different strategies and methods to securely encrypt plain text content. 
-In the course of this essay, we will investigate each of these steps in more depth to understand how modern
+This essay will investigate the key differences between symmetric and asymmetric encryption algorithms while especially focussing on use-cases, security, performance and complexity.
-communication works on a technical level.
 
-To start, we will take a closer look at the analoue signal that reaches your phone's microphone.
+The most prominent difference between symmetric and asymmetric encryption is the number of keys used in the encryption and decryption stages.
-Every sound wave, like your voice or the tone of a guitar string, is so called time and value continuous.
+Symmetric encryption utilizes a single key for both encryption and decryption. 
-That means, such a signal has an infinitely accurate value at each imaginable point in time.
+For that reason, both parties that want to encrypt or decrypt a message symmetrically need the same key to decrypt and encrypt their corresponding messages.
-However, an electronic device, for example a computer or a phone, cannot understand such an analogue signal, thus we have to first transform it into some kind of electrical signal the device can understand.
+On the other hand, asymmetric encryption uses two different keys for encryption and decryption: a public and a private key. 
-In general, we can assume that an electrical device can only process time and value disteet signals.
+The public is shared openly and is used to encrypt a message for the recipient of the public keys' owner. 
-To transform our original continuous signal into its discreet or rather digital representation, we can make use of the sampling and
+The recipient of the encrypted message uses their private key to decrypt the message @symmetric-vs-asymmetric.
-quantization steps in our communication process.
+The public key can be thought of as a lock that the sender uses so "seal" their message, while the private key is only owned by the corresponding recipient to unlock the message and read its contents.
+This fundamental difference in key management not only affects the encryption process but also has significant implications for the security of the encrypted data.
 
-In the sampling process, the analogue signal is transformet into a time discreet and value continuous signal.
+The security of both symmetric and asymmetric encryption algorithms depends heavily on the context and application of these methods.
-Conceptually, an analog-to-digital converter (ADC) takes rapid "snapshots" of the amplitude of the input signal at uniform intervals and records each reading.
+Symmetric encryption heavily relies on the strength of the key and the algorithm used @symmetric-security.
-The rate at which these snapshots occur is called sampling frequency.
+For example, the Data Encryption Standard (DES) algorithm introduced in 1975 uses a key length of 56 bits, which makes it too insecure for modern applications, since the key can easily be guessed by a relatively powerful computer @des. 
-Ideally, we do want to maximize the timespan between each of these snapshots, using the lowest possible sampling frequency so to speak.
+For that reason, DES has been generally replaced by the Advanced Encryption Standard (AES). 
-The Nyquist Frequency defines this lowest possible sampling frequency as double the frequency of the originating signal @shannon.
+Additionally, since there is only one key for both encryption and decryption, symmetric encryption algorithms are vulnerable if the key is compromised. 
-For example, if the frequency of our original signal is 1 MHz, the analog-to-digital converter will need to take a snapshot of the signal at a frequency of at least 2 MHz.
+This security vulnerability is not present in asymmetric encryption algorithms, as the keys to encrypt and decrypt messages are separated.  
-At this moment, our signal now is time-discreet and value-continuous.
+The public key is defined as being safely publicly available while the private key can be always kept with its owner @symmetric-vs-asymmetric. 
-To convert these time-discreet values into real bits and bytes we will make use of the quantizer in the next step.
+These implications on security also impact the respecting applications for encryption methods. // why? is not explained here.
+// hier noch ein concluding sentence um auf das thema use case hinzuweisen 
 
-Quanization describes the operation of transforming a continuous value into a discreet form.
+The use of a certain encryption method heavily depends on the given use case. 
-Imagine placing random dots in a row on a piece of paper.
+While symmetric encryption is mainly used to encrypt large amounts of data, like files or even whole disks, asymmetric encryption is usually used for secure communication over the internet. 
-A simple quantization process now would be to take a ruler and for each point record which is the next highest marking on the ruler.
+A fitting example for secure internet communication is secure web browsing, using Transport Layer Security (TLS) @tls.
-In the same sense, the quantizer of an electronic device maps the continuous input vaulues to predefined codewords -- a collection of bits (for example "000", "110" or "011").
+TLS uses asymmetric cryptography to ensure that the web server is correctly authenticated against the user. 
-Our signal has now fully arrived in the digital domain.
+This method provides assurance that the user is genuinely interacting with the designated server.
-// Note: Maybe expand more what happened up until now
+Another example is encrypting or decrypting e-mails using the Pretty-Good-Privacy (PGP) system --- encrypting and decrypting e-mails with the public and private key respectively @pgp.
-Up to this point we have completeley encoded our analogue message digitally.
+PGP can also be used to digitally sign content. 
-During the next steps, the digital signal will be further processed and prepared for transmission.
+As with TLS authentication, asymmetric cryptography makes it possible to generate digital signatures of content using the private key.
+Subsequently, this signature can be verified using the corresponding, publicly available, public key.
+To optimize the use of both encryption methods, hybrid encryption methods can be used. 
+Using hybrid encryption methods, a strong symmetric encryption key can be shared with another party securely using asymmetric encryption methods. 
+The symmetric key can then be used to encrypt and decrypt larger amounts of data, for example to securely transfer large files over the internet. 
+A broadly used method of using hybrid encryption methods is called "Diffie-Hellman (DH) key exchange". 
+Using the DH key exchange, a symmetric key can be securely exchanged on a public channel using the public-private key model of asymmetric encryption @dh-key-exchange.
+The reason for the use of different encryption methods for different use cases is heavily influenced by the underlying performance of these algorithms. 
 
-A digital signal in its raw form is very inefficient to transmit because of the limited underlying bandwidth.
+The performance of an encryption algorithm can be defined as its speed of operation. 
-Because we need to transport our message over some kind of communication channel, the amount of information we can transport in a fixed period of time is limited.
+To measure the performance of an algorithm, the time for both encryption and decryption is measured.
-The first step in solving this issue is using compression by removing irrelevant and redundant information from the signal.
+Symmetric encryption algorithms are generally considered faster due to the use of simpler encryption algorithms, like AES @aes-performance.
-A popular example for a compression method is called Huffman Coding @huffman.
+AES also uses shorter keys than the, for example, asymmetric RSA algorithm @rsa, which also contributes to the higher performance @performance-comparison. 
-Conceptually, the Huffman Code consists of multiple codewords of varying length where symbols with a higher probability of occurrence are assigned to the shorter codewords, thus reducing the overall size of the message.
+The underlying reason for these differing performances in asymmetric and symmetric encryption algorithms can also be attributed to their complexity. 
-Since the assignment of symbols to codewords is based on their probability of occurrence, this method of compression requires information about the statistics of the incoming symbols.
-If these statistical information are not known, other compression methods such as the Lempel–Ziv–Welch algorithm can be used.
-Furtheremore, compression algorithms specifically tailored for different signal sources can be used, for example PNG for pictures, MP3 for audio or MPEG for video signals.
-With the analogue message digizited and compressed for easier transport over our communication channel, we will now need to prepare our message on a physical level for it to be able to be transmitted using a radio wave or a data cable.
 
-Currently, the message to be transmitted can be represented as a set of codewords like "00 01 10 11".
+The implementation and use of symmetric encryption algorithms is significantly less complex than that of asymmetric methods. 
-To prepare our message digital and compressed message for transmission over a physical channel, digital modulation -- like amplitude modulation -- is used.
+Due to the use of the same key for encryption and decryption in symmetric methods, the process of encrypting and decrypting data is simpler than that of asymmetric methods.
-This works by defining a specific signal amplitude for every possible codeword, which is called Amplitude-Shift Keying (ASK) @modulation.
+Symmetric algorithms like AES also use a special structure to encrypt content called "Block Cipher Structure". 
-The simplest form of ASK is called On-Off Keying (OOK), where we will either transmit a wave -- and signaling a binary 1 -- or not transmit anything -- and signal a 0.
+Here, AES splits up the content to be encrypted into fixed-size blocks of data, which then can be processed in parallel, allowing for even higher performance.
-In our example we may define four sine functions with varying amplitutes as the modulated signal that is being transported over the physical communication channel.
+Asymmetric encryption methods, on the other hand, require the previously introduced set of keys (public and private) to encrypt and decrypt data. 
-Because we defined four different Amplitude-Shifts, this type of modulation is called "4 ASK" @modulation.
+The asymmetric RSA algorithm, for example, utilizes computational intensive exponential calculations to encrypt plain text content @rsa.
-Signal modulation is not limited to changing the ampliude of our transmission signal, thus we can also alter the phase or frequency of the signal.
+
-Depending on the type of communication channel we may want to choose a different modulation type using either one or a combination of different modulation parameters.
+In conclusion, both symmetric and asymmetric encryption methods have different strengths in various application areas.
-For example, a popular modulation type that uses a combination of amplitude shifts and phase shifts is called "Amplitude-Phase-Shift Keying (APSK) @modulation.
+While symmetric methods benefit from their high efficiency in encrypting large amounts of data, asymmetric methods are more suitable for secure information exchange, for example over the internet.
-Using modulation, we prepared our signal on a physical level to  instruct a communication interface -- like an antenna or an optical transmitter -- to finally transmit our message.
+Hybrid cryptography represents an exciting solution to the weaknesses of both systems by combining both encryption types. By exchanging symmetric keys via asymmetric cryptographic methods, large amounts of data can already be securely transmitted over the internet today.
 
-As final step, the receiver of the message has to process the received signals in exactly the reverse order to create a comprehensible message.
-The most important prerequisite for this to work is that both sender and receiver have agreed on the same transmission and reception conditions.
-The receiver will first need to use the correct modulation type to convert their received signal back to a set of codewords.
-Going on, they will decompress the message based on the used compression algorithm and use a Digital-to-Analog Converter (DAC) to transform the digital message back into sound waves which will be output by the speaker of their phone.
-This whole process now happens at such a high speed that makes it possible for us to talk to a person on the other side of the world.
 
 //Essay has a total of #total-words words.