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 20 of 367 for “"Elliptic Curve"”.
-
Reconfigurable elliptic curve cryptography
Elliptic Curve Cryptosystems (ECC) have been proposed as an alternative to other established public key cryptosystems such as RSA (Rivest Shamir Adleman). ECC provide more security per bit than other known public key schemes based on the discrete logarithm problem. Smaller key sizes result in …
-
Elliptic Curve Arithmetic for Cryptography
… cryptosystems. A mathematical object called an elliptic curve can be used in the construction of public key cryptosystems. This thesis focuses on speeding up elliptic curve cryptography which is an attractive alternative to traditional public key cryptosystems such as RSA. Speeding up elliptic …
-
Post-Quantum Elliptic Curve Cryptography
… cryptography based on isogenies over elliptic curves. First we show that ordinary elliptic curves are have less than exponential security against quantum computers. These results were used as the motivation for De Feo, Jao and Pl\^ut's construction of public key cryptosystems using …
-
Galois Representation on Elliptic Curve
… representations about torsion subgroups of elliptic curves. We review the literature on elliptic curves and Serre's theorem. We describe a field formed by adjoining torsion subgroup of an elliptic curve. We show that the extension is finite and algebraic. Next, we construct a Galois group …
-
AN EXPOSITION OF ELLIPTIC CURVE CRYPTOGRAPHY
… In this paper, we set out to explore the use of elliptic curves in the cryptography of today, as well as the cryptography of the future.We also offer our own original cryptosystem, CSDH. This system on its ownoffers some moderate level of security. It shares many similarities to the post-quantum, …
-
Elliptic Curve Cryptography using Computational Intelligence
… processes. Presently, cryptosystems based on elliptic curves are becoming popular due to strong cryptographic strength per small key size. At the heart of these schemes is the complexity of the elliptic curve discrete logarithm problem (ECDLP). Pollard’s Rho algorithm is a well known method …
-
High Performance Elliptic Curve Cryptographic Co-processor
… several finite fields to be used in the elliptic curve digital signature algorithm (ECDSA). Of the ten recommended finite fields, five are binary extension fields with degrees ranging from 163 to 571. The fundamental building block of the ECDSA, like any ECC based protocol, is elliptic …
-
Batch Verification of Elliptic Curve Digital Signatures
… the efficiency of batching the verification of elliptic curve signatures. The first signature scheme considered is a modification of ECDSA proposed by Antipa et al.\ along with a batch verification algorithm by Cheon and Yi. Next, Bernstein's EdDSA signature scheme and the Bos-Coster …
-
Elliptic Curve Cryptography on Modern Processor Architectures
Abstract Elliptic Curve Cryptography (ECC) has been adopted by the US National Security Agency (NSA) in Suite "B" as part of its "Cryptographic Modernisation Program ". Additionally, it has been favoured by an entire host of mobile devices due to its superior performance characteristics. ECC is …
-
Probabilistic Record Linkage with Elliptic Curve Operations
… the runtime of a linkage exercise by adopting elliptic curve based transformations that are mostly additive and multiplicative, instead of exponentiations. The elliptic curve operations are used to improve the precomputation time, eliminate memory intensive comparisons of encrypted values and …
-
Elliptic Curve Cryptography on Heterogeneous Multicore Platform
Elliptic curve cryptography (ECC) is becoming the algorithm of choice for digital signature generation and authentication in embedded context. However, performance of ECC and the underlying modular arithmetic on embedded processors remains a concern. At the same time, more complex system-on-chip …
-
High-Speed Elliptic Curve and Pairing-Based Cryptography
Elliptic Curve Cryptography (ECC), independently proposed by Miller [Mil86] and Koblitz [Kob87] in mid 80’s, is finding momentum to consolidate its status as the public-key system of choice in a wide range of applications and to further expand this position to settings traditionally occupied by RSA …
-
Iteration functions for Pollard's rho on elliptic curve groups
… way to solve the discrete log problem (DLP) in Elliptic Curve Groups. It relies on the use of an iterative mapping that behaves like a random mapping. In this paper, we will discuss some alternative iteration functions to Pollard's original suggestion. We will then compare the different …
-
On Error Detection and Recovery in Elliptic Curve Cryptosystems
… range of cryptosystems including those based on elliptic curves. With the variety and demonstrated practicality of these attacks, it is essential for cryptographic implementations to handle different types of errors properly and securely. In this work, we address some aspects of error detection …
-
Using Random Digit Representation for Elliptic Curve Scalar Multiplication
Elliptic Curve Cryptography (ECC) was introduced independently by Miller and Koblitz in 1986. Compared to the integer factorization based Rivest-Shamir-Adleman (RSA) cryptosystem, ECC provides shorter key length with the same security level. Therefore, it has advantages in terms of storage …
-
Automatic generation of high speed elliptic curve cryptography code
… to use the group of rational points of an elliptic curve over a finite field to create an asymmetric algorithm. Elliptic Curve Cryptography (ECC) is based on a problem known as the ECDLP (Elliptic Curve Discrete Logarithm Problem) and offers several advantages with respect to other more …
-
On the Shafarevich-Tate group of an elliptic curve
… elements in the Shafarevich-Tate group of an elliptic curve. The set of K-rational points on an elliptic curve, E, are known to form a finitely generated abelian group. My results are of interest when trying to find the rank of this group, which in general is a hard problem. The Selmer group …
Page 1 of 19