Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication
- Publication Type
Articles 1 - 3 of 3
Full-Text Articles in Engineering
Smart As A Cryptographic Processor, Saroja Kanchi, Nozar Tabrizi, Cody Hayden
Smart As A Cryptographic Processor, Saroja Kanchi, Nozar Tabrizi, Cody Hayden
Electrical & Computer Engineering Presentations And Conference Materials
SMaRT is a 16-bit 2.5-address RISC-type single-cycle processor, which was recently designed and successfully mapped into a FPGA chip in our ECE department. In this paper, we use SMaRT to run the well-known encryption algorithm, Data Encryption Standard. For information security purposes, encryption is a must in today’s sophisticated and ever-increasing computer communications such as ATM machines and SIM cards. For comparison and evaluation purposes, we also map the same algorithm on the HC12, a same-size but CISC-type off-the-shelf microcontroller, Our results show that compared to HC12, SMaRT code is only 14% longer in terms of the static number of …
Pointing Analysis And Design Drivers For Low Earth Orbit Satellite Quantum Key Distribution, Jeremiah A. Specht
Pointing Analysis And Design Drivers For Low Earth Orbit Satellite Quantum Key Distribution, Jeremiah A. Specht
Theses and Dissertations
The world relies on encryption to perform critical and sensitive tasks every day. If quantum computing matures, the capability to decode keys and decrypt messages becomes possible. Quantum key distribution (QKD) is a method of distributing secure cryptographic keys which relies on the laws of quantum mechanics. Current implementations of QKD use fiber-based channels which limit the number of users and the distance between users. Satellite-based QKD using free-space channels is proposed as a feasible secure global communication solution. Since a free-space link does not use a waveguide, pointing a transmitter to receiver is required to ensure signal arrival. In …
Public Key Cryptography With The Brin-Thompson Group 2v, Cyril Xavier Kuhns
Public Key Cryptography With The Brin-Thompson Group 2v, Cyril Xavier Kuhns
Senior Projects Spring 2016
The Brin-Thompson group 2V is a simple, finitely presented group of functions with solvable word problem and unsolvable torsion problem, which makes it a promising platform group for the Anshel-Anshel-Goldfeld key agreement protocol. The primary results of this project are an implementation of 2V and the AAG protocol in Java, which is shown to be susceptible to the heuristic length based attack.