We extend their construction and show that isogenies between supersingular elliptic curves can be used as the underlying hard mathematical problem for other quantum-resistant schemes. For our second contribution, we propose is an undeniable signature scheme based on elliptic curve isogenies.
Quantum Security of Cryptographic Primitives
We prove its security under certain reasonable number-theoretic computational assumptions for which no efficient quantum algorithms are known. This proposal represents only the second known quantum-resistant undeniable signature scheme, and the first such scheme secure under a number-theoretic complexity assumption.
- Abraham Lincoln.
- Subscribe to RSS!
- LINQ for Visual C# 2008.
- Expect a move of God in your life--suddenly!.
- Post-Quantum Elliptic Curve Cryptography.
Finally, we also propose a security model for evaluating the security of authenticated encryption schemes in the post-quantum setting. Our model is based on a combination of the classical Bellare-Namprempre security model for authenticated encryption together with modifications from Boneh and Zhandry to handle message authentication against quantum adversaries. We give a generic construction based on Bellare-Namprempre for producing an authenticated encryption protocol from any quantum-resistant symmetric-key encryption scheme together with any digital signature scheme or MAC admitting any classical security reduction to a quantum-computationally hard problem.
We apply the results and show how we can explicitly construct authenticated encryption schemes based on isogenies. The main goal in this thesis is to consider how cryptographic techniques can be extended to offer greater defence against these non-traditional security threats. In the first part of this thesis, we consider problems in classical cryptography.
singtireclofur.ml/schicksalsschlaege-oder-die-fremde-heimat-der-mensch.php We introduce multi-factor password-authenticated key exchange which allows secure authentication and key agreement based on multiple short secrets, such as a long-term password and a one-time response; it can provide an enhanced level of assurance in higher security scenarios because a multi-factor protocol is designed to remain secure even if all but one of the factors has been compromised due to attacks such as phishing or spyware.
Next, we consider the integration of denial of service countermeasures with key exchange protocols: by introducing a formal model for denial of service resilience that complements the extended Canetti-Krawczyk model for secure key agreement, we cover a wide range of existing denial of service attacks and prevent them by carefully using client puzzles.
Additionally, we look at how side-channel attacks affect certain types of formulae used in elliptic curve cryptography, and demonstrate that information leaked during field operations such as addition, subtraction, and multiplication can be exploited by an attacker. In the second part of this thesis, we examine cryptography in the quantum setting.
We argue that quantum key distribution will have an important role to play in future information security infrastructures and will operate best when integrated with the powerful public key infrastructures that are used today. Finally, we present a new look at quantum money and describe a quantum coin scheme where the coins are not easily counterfeited, are locally verifiable, and can be transferred to another party.
Collections Combinatorics and Optimization Theses. Cite this version of the work Douglas Stebila