Advanced search
Showing result 1 - 5 of 55 essays matching the above criteria.
-
1. LSTM-attack on polyalphabetic cyphers with known plaintext : Case study on the Hagelin C-38 and Siemens and Halske T52
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Polyalphabetic cyphers have been used for centuries and well into the 1970s to transmit all kinds of messages. Since then, computers and modern cryptography have taken over making bruteforce attacks unfeasible when designed properly. READ MORE
-
2. Automated Generation of EfficientBitslice Implementations forArbitrary Sboxes
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Whitebox cryptography aims at protecting standard cryptographic algorithmsthat execute in attacker-controlled environments. In these, the attacker is ableto read a secret key directly from memory. Common implementations mask alldata at runtime and operate on masked data by using many small precomputedtables. READ MORE
-
3. Advanced Secret Handling in Kubernetes Application with HashiCorp Vault
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : In the era of microservices and cloud-based systems, safeguarding sensitive credentials has become a critical concern for modern businesses. This thesis delves into the application of HashiCorp Vault, a prominent tool for secure secret management, within the domain of telecommunication networks, renowned for managing tens of thousands of nodes. READ MORE
-
4. Polar Codes for Biometric Identification Systems
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Biometrics are widely used in identification systems, such as face, fingerprint, iris, etc. Polar code is the only code that can be strictly proved to achieve channel capacity, and it has been proved to be optimal for channel and source coding. READ MORE
-
5. Homomorphic Encryption for Audio Conferencing
University essay from Linköpings universitet/Institutionen för datavetenskapAbstract : Homomorphic encryption (HE) enables computations on encrypted data making it possible to perform calculations on a server without sharing the secret key for decryption. HE is relatively new and has seen significant improvements in recent years in terms of speed of encryption, decryption, operations, and the number of operations possible to perform in a row without damaging the ciphertext. READ MORE