Essays about: "application of cryptography"
Showing result 1 - 5 of 40 essays containing the words application of cryptography.
-
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. Fuzzing of PKCS#11 Trusted Application
University essay from Lunds universitet/Institutionen för elektro- och informationsteknikAbstract : The main goal of this thesis is to find an effective way to fuzz trusted applications (TAs) with source code residing in trusted execution environment (TEE). While fuzzing TAs has been previously done, no work has been found to utilize the source code of TAs to improve the fuzzing. READ MORE
-
4. Fair Voting System for Permissionless Decentralized Autonomous Organizations
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : The increasingly adapted technology called blockchain can be viewed as a distributed append-only time-stamped data structure which is made possible by a distributed peer-to-peer network. The network uses cryptography and different consensus mechanisms to ensure immutability, security, transparency, and speed in a decentralized fashion. READ MORE
-
5. How is Polly? Revisiting the Differential Attack on Polly Cracker after 20 years
University essay from Lunds universitet/MatematikcentrumAbstract : För att skapa nya krypteringsalgoritmer är man alltid på jakt efter svårlösta matematiska problem. Men är alla problem lämpliga? Uppsatsen behandlar Gröbnerbaser över ändliga kroppar och visar att de är inte lämpliga för att bygga säkra krypteringsalgoritmer. READ MORE