Sökning: "Cryptography"
Visar resultat 21 - 25 av 45 avhandlingar innehållade ordet Cryptography.
21. Design and Implementation of Efficient and Secure Lightweight Cryptosystems
Sammanfattning : In recent years there has been a wide-spread deployment of battery-powered and passive devices such as RFID tags, systems with very strong limitations on area, cost and power budgets. Deploying cryptographic solutions for these systems is both important, because it could unlock several security-critical applications, and challenging, due to the stringent budgets: the overheads of even the smallest block ciphers are often one or more orders of magnitude too high. LÄS MER
22. Entanglement in quantum communication : preparation and characterization of photonic qubits
Sammanfattning : At the heart of quantum physics lies the principle of superposition, and at the heart of information theory lies the bit. Perhaps the most useful property of quantum systems is that they can be loaded with information bits, so-called qubits, that are indefinitely both 0 and 1 until a measurement is made. LÄS MER
23. Be More and be Merry: Enhancing Data and User Authentication in Collaborative Settings
Sammanfattning : Cryptography is the science and art of keeping information secret to un-intended parties. But, how can we determine who is an intended party and who is not? Authentication is the branch of cryptography that aims at confirming the source of data or at proving the identity of a person. This Ph.D. LÄS MER
24. Photonic Qubits for Quantum Communication : Exploiting photon-pair correlations; from theory to applications
Sammanfattning : For any communication, the conveyed information must be carried by some physical system. If this system is a quantum system rather than a classical one, its behavior will be governed by the laws of quantum mechanics. LÄS MER
25. Using Coding Techniques for Attacking Post-Quantum Cryptographic Assumptions and Systems
Sammanfattning : Post-quantum cryptography for resisting possible attacks from malicious quantum adversaries has become one of the key topics in recent cryptographic research. Its ultimate goal is to search for efficient and secure primitives replacing the factoring- and discrete log-based schemes in service that will be broken in polynomial time by Shor’s algorithm. LÄS MER