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 28 for “"public-key cryptography"”.
-
Public key cryptography and the zero-one knapsack problem
… Asymmetric cryptosystems are introduced through public key cryptography. The Rivest-Shamir-Adelman cryptosystem is explained. Then the Merkle-Hellman system based on the zero-one knapsack problem is presented. Standard attacks on the zero-one knapsack problem are rejected as too time-consuming. …
-
Performance Optimization of Public Key Cryptography on Embedded Platforms
… devices, security becomes an important concern. Public Key Cryptography is an indispensable tool to implement various security features necessary on these embedded platforms. In this thesis, we provide optimized PKC solutions on platforms belonging to two extreme classes of the embedded system …
-
Two issues in public key cryptography : RSA bit security and a new knapsack type system
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 1985
-
Efficient Binary Field Multiplication on a VLIW DSP
Modern public-key cryptography relies extensively on modular multiplication with long operands. We investigate the opportunities to optimize this operation in a heterogeneous multiprocessing platform such as TI OMAP3530. By migrating the long operand modular multiplication from a general-purpose …
-
Implementation of RSA Cryptosystem for Next Generation RFID Tags
… 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 constrained tag therefore making the proposition viable. Public …
-
Kerberos phone secure messenger
… message privacy with the convenience of secret key cryptography. Such an advantage in mobile phones helps reduce the computational burden and power consumption if compared with public key cryptography. KSPM achieves high standards in terms of security, performance and power consumption. This …
-
Relationships between functionality, security, and privacy for multiparty computation, hashing, and encryption
One of the fundamental goals of cryptography is to be able to offer security and privacy without sacrificing functionality. Cryptographers have been able to achieve the best of all three by exploiting the assumed hardness of some problems (e.g. discrete log), and have been able to build protocols …
-
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 …
-
Distributed RBAC for subscription-based remote network services
… in the system for authorization decision. Public key cryptography and XML security technology are used to ensure the confidentiality and integrity of the system and interaction among the involved parties. The web servers use plug-ins to provide an authentication-delegation service and a …
-
High Speed and Low-Complexity Hardware Architectures for Elliptic Curve-Based Crypto-Processors
The elliptic curve cryptography (ECC) has been identified as an efficient scheme for public-key cryptography. This thesis studies efficient implementation of ECC crypto-processors on hardware platforms in a bottom-up approach. We first study efficient and low-complexity architectures for finite …
-
Efficient Authentication in High Security Wireless Sensor Networks
… can easily imitate any node if a single key in the network is compromised. End-to-end security offers an improvement by allowing the sink to authenticate the source of a message as well as its integrity. The impracticality of using public key cryptography for all communication requires …
-
Modular multiplication in the residue number system
Public-key cryptography is a mechanism for secret communication between parties who have never before exchanged a secret message. This thesis contributes arithmetic algorithms and hardware architectures for the modular multiplication Z = A × B mod M. This operation is the basis of many public-key …
-
Privacy engineering for social networks
… The security of Footlights user data is based on public-key cryptography, but users are able to log in to the system without carrying a private key on a hardware token. Instead, users authenticate to a set of authentication agents using a weak secret such as a user-chosen password or …
-
Hardware and protocols for authentication and secure computation
… by embedded devices often preclude the use of public-key cryptography. We address this issue through the development of a lightweight (10k-Gate) Elliptic Curve accelerator for the K-163 curves, which allows us to build a secure wireless-charging system that can block power from counterfeit and …
-
Decentralized Key Management for Beyond 5G Network Coding-Enabled Mobile Small Cells
This thesis investigates decentralized key management and presents two novel decentralized key management schemes that are capable of providing secure communication in ad hoc-type networks and are agnostic to the network coding technology. The main research contributions of this thesis are …
-
Structure vs. hardness through the obfuscation lens
Cryptography relies on the computational hardness of structured problems. While one-way functions, the most basic cryptographic object, does not seem to require much structure, as we advance up the ranks into public-key cryptography and beyond, we seem to require that certain structured problems …
-
Pell Equation - Theory and applications to cryptography
… theoretical results are adopted to formulate new public–key encryption and digital signature schemes with security based on the integer factorization problem or on the discrete logarithm problem, namely new RSA–like and ElGamal cryptosystems, and new Digital Signature Algorithms. The obtained …
-
Large-scale analysis of the security of cryptographic keys
… distinct bit patterns in RSA cryptographic keys allowing their attribution, thus endangering their advertised security. This thesis proposes a novel attribution approach to link cryptographic keys to their originating libraries based on moduli’s characteristics. We analyze over 6.5 million …
-
Cryptographic Key Distribution In Wireless Sensor Networks Using Bilinear Pairings
… space. Despite many research efforts, key distribution in WSNs still remains an open problem. Many of the proposed schemes suffer from high communication overhead and storage costs, low scalability and poor resilience against different types of attacks. The exclusive usage of simple and …
-
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 …
Page 1 of 2