Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"Cryptography -- Mathematics."”.
-
Tweakable Ciphers: Constructions and Applications
Tweakable ciphers are a building block used to construct a variety of cryptographic algorithms. Typically, one proves (via a reduction) that a tweakable-cipher-based algorithm is about as secure as the underlying tweakable cipher. Hence improving the security or performance of tweakable ciphers …
-
FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field
Elliptic curve cryptography (ECC) is an alternative to traditional techniques for public key cryptography. It offers smaller key size without sacrificing security level. Tate pairing is a bilinear map used in identity based cryptography schemes. In a typical elliptic curve cryptosystem, elliptic …
-
A Survey of Code-Based Cryptography
One of the biggest concerns of the digital era is to keep data secure. With the rise of quantum computers, some of the problems that were considered hard will be solved in polynomial time. Therefore, efforts are taken to design practical cryptosystems that will resist attacks from both classical …
-
Reconfigurable and compact modular polynomial multiplier in Galois field for the security of IoT
… and cryptographic robustness for Elliptic Curve Cryptography (ECC) applications. The proposed multipliers were synthesized and validated on multiple FPGA platforms including Spartan-7, Zynq UltraScale+, and Artix-7 using the AMD Xilinx Vivado toolchain. The Karatsuba reconfigurable multiplier …
-
Abelian Varieties with Small Isogeny Class and Applications to Cryptography
An elliptic curve $E$ over a finite field $\FF_q$ is called isolated if it admits few efficiently computable $\FF_q$-isogenies from $E$ to a non-isomorphic curve. We present a variation on the CM method that constructs isolated curves. Assuming the Bateman-Horn conjecture, we show that there is …
-
Smart card fault attacks on public key and elliptic curve cryptography
… on a smart card implementation of elliptic curve cryptography. King and Wang designed a new attack called counter fault attack by attacking the scalar multiple of discrete-log cryptosystem. They then successfully generalize this approach to a family of attacks. By implementing King and Wang's …
-
Quantum Encryption with Certified Deletion
In the context of classical information, every message is composed of 0s and 1s; these messages can generally be copied at will. However, when quantum phenomena are used to model information, this guarantee no longer exists. This difference gives rise to a range of cryptographic possibilities when …