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 41 for “"Cryptosystem."”.
-
The Elgamal Cryptosystem is better than Th RSA Cryptosystem for Mental Poker
Cryptosystems are one of the most important parts of secure online poker card games. However, there is no research comparing the RSA Cryptosystem (RC) and Elgamal Cryptosystem (EC) for mental poker card games. This paper compares the RSA Cryptosystem and Elgamal Cryptosystem implementations of …
-
Towards a practical public-key cryptosystem.
Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1978.
-
Reboot based framework for high-threshold cryptosystem
DSpace SAF Submission Ingestion Package generated from Vireo submission #16997 on 2022-01-12 at 12:55:28
-
Resource-constrained and Resource-efficient Modern Cryptosystem Design
… to handle these cases and apply them on modern cryptosystem designs. I illustrate that by clarifying the application context, and then by using appropriate strategies, it is possible to push the envelope on what is perceived as achievable, by up to two orders-of-magnitude. In the first part of …
-
Implementation of RSA Cryptosystem for Next Generation RFID Tags
… thesis addresses concepts of implementing a RSA cryptosystem on a passive RFID tag. With a limited number of public key cryptosystems on passive RFID platforms, the proposed algorithm makes use of Montgomery multiplication primitives to reduce the amount of computation required on the power …
-
An Investigation of Methods to Improve Area and Performance of Hardware Implementations of a Lattice Based Cryptosystem
With continuing research into quantum computing, current public key cryptographic algorithms such as RSA and ECC will become insecure. These algorithms are based on the difficulty of integer factorization or discrete logarithm problems, which are difficult to solve on classical computers but become …
-
DEVELOPMENT OF OPTICAL IMAGE ENCRYPTION TECHNIQUES FOR INFORMATION SECURITY
… overcome some existing problems in conventional cryptosystems. Several works have been accomplished: (1) To develop nonlinear cryptosystems and enhance the security robustness in conventional DRPE technique. (2) To evaluate the security of asymmetric cryptosystems and develop corresponding …
-
Infinite Groebner Bases And Noncommutative Polly Cracker Cryptosystems
We develop a public key cryptosystem whose security is based on the intractability of the ideal membership problem for a noncommutative algebra over a finite field. We show that this system, which is the noncommutative analogue of the Polly Cracker cryptosystem, is more secure than the commutative …
-
Graph-based and algebraic codes for error-correction and erasure recovery
… cryptosytem. However, we study the code-based cryptosystem based on twisted Hermitian codes and lay foundations for a potential attack on such a cryptosystem.
-
Weyl Gröbner Basis Cryptosystems
… we shall consider a certain class of algebraic cryptosystems called Gröbner Basis Cryptosystems. In 1994, Koblitz introduced the Polly Cracker cryptosystem that is based on the theory of Gröbner basis in commutative polynomials rings. The security of this cryptosystem relies on the fact that the …
-
Efficient threshold cryptosystems
… scheme is a distributed implementation of a cryptosystem, in which the secret key is secret-shared among a group of servers. These servers can then sign or decrypt messages by following a distributed protocol. The goal of a threshold scheme is to protect the secret key in a highly …
-
Cryptographic techniques for personal communication systems security
… are presented. The Fiat-Sharmir zero-knowledge cryptosystem is presented as an example of how asymmetric algorithm cryptography may be employed as part of an improved security solution. Various modifications to this cryptosystem have been evaluated and their critical parameters are shown to be …
-
Public key cryptography and the zero-one knapsack problem
This paper reviews several popular symmetric cryptosystems, monoalphabetic and polyalphabetic. Their susceptibility to cryptanalysis is examined. Asymmetric cryptosystems are introduced through public key cryptography. The Rivest-Shamir-Adelman cryptosystem is explained. Then the Merkle-Hellman …
-
Efficient RSA Cryptosystems Immune against the Hardware Fault Attack and the FPGA Implementations
… for CRT-based two-prime and multi-prime RSA cryptosystems are proposed, investigated, and compared to the previous work. The VLSI implementations of these cryptosystems are carried out in the thesis project and the results are presented, which demonstrate the advantages of the proposed …
-
Network coding for anonymous broadcast
… communication systems, NCGAB requires no cryptosystem, no infrastructure of trust, and no special nodes to operate. This thesis also introduces Melting Pad, an algebraic coding scheme with properties of information theoretic security and efficient decodability, designed to protect messages …
-
Fault Injection Attacks on RSA and CSIDH
… of the various fault attacks on symmetric key cryptosystems and public key cryptosystems. The thesis then demonstrates fault injection attacks on RSA-CRT and constant time CSIDH. The fault attack consists of two main components: fault modeling, which examines methods for injecting faults in a …
-
Relationships between functionality, security, and privacy for multiparty computation, hashing, and encryption
… Cryptography, and develop a public key cryptosystem. In this model of cryptography, security takes on a much less restrictive role (e.g. adversaries must run in O(n¹⁰) time), but the protocols and security reductions must run in "fine-grained" time (e.g. less than O(n⁵)).
-
FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field
… schemes. In a typical elliptic curve cryptosystem, elliptic curve point multiplication is the most computationally expensive component. Similarly, Tate pairing is also quite computationally expensive. Therefore, it is more attractive to implement the ECC and Tate pairing using hardware …
-
Advances in signatures, encryption, and E-Cash from bilinear groups
… Re-Encryption: We present the first public key cryptosystem where a semi-trusted proxy, given special information, can translate an encryption of a message under Alice's key into an encryption of the same message under Bob's key. Again, the special information allows nothing else, i.e. the proxy …
Page 1 of 3