Essays about: "computer cryptography"
Showing result 1 - 5 of 28 essays containing the words computer cryptography.
-
1. Blockchain-based e-voting system without digital ID: A Proof-of-Concept
University essay from Karlstads universitet/Institutionen för matematik och datavetenskap (from 2013)Abstract : Electronic voting systems have the potential to offer a cost effective, secure and transparent way of communicating with the citizens, increasing trust and participation. However creating a secure open source electronic voting system providing confidentiality and transparency with sufficient performance has long been a challenge. READ MORE
-
2. Homomorphic encryption
University essay from KTH/Matematik (Avd.)Abstract : The problem of constructing a secure encryption scheme that allows for computation on encrypted data was an open problem for more than 30 years. In 2009, Craig Gentry solved the problem, constructing the first fully homomorphic encryption (FHE) scheme. READ MORE
-
3. The Effect of Noise Levels on the Performance of Shor’s Algorithm
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Advanced enough quantum computers promise to revolutionise fields such as cryptography, drug discovery and simulations of complex systems. Quantum computers are built on qubits which are fragile and susceptible to error-inducing interference, which is called noise. READ MORE
-
4. A Side-Channel Attack on Masked and Shuffled Implementations of M-LWE and M-LWR Cryptography : A case study of Kyber and Saber
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : In response to the threat of a future, large-scale, quantum computer, the American National Institute of Standards and Technology (NIST) initiated a competition for designs of quantum-resistant cryptographic primitives. In 2022, the lattice-based Module-Learning With Errors (M-LWE) scheme Kyber emerged as the winner to be standardized. READ MORE
-
5. The Solitaire algorithm and the key stream analysis
University essay from Linnéuniversitetet/Institutionen för matematik (MA)Abstract : The operation of the Solitaire algorithm is based on a deck of cards, including two different jokers. We use the computer to simulate the Solitaire algorithm and analyze the key stream which is generated by the algorithm.We mainly analyze the maximum cycle length of the key stream and doNIST test. . READ MORE