




 |


Starting-Point Resources for
Suggested Project Topics
Software
projects
-
Educational software for
a cryptographic laboratory
- support for additional libraries
- statistical tests for randomness
Resources:
-
Comparative
analysis of software multi-precision arithmetic libraries for public key
cryptography
Resources:
-
Timing attacks
against public key cryptosystems
Resources:
-
Cache attacks
against secret key cryptosystems
Resources:
-
Generating large
primes for cryptographic applications using deterministic and
probabilistic methods
Resources:
-
A. Granville, "It Is Easy To Determine Whether a Given Integer Is
Prime," Bulletin (New Series) of the American Mathematical Society Vol.
42 No 1, pp 3-38.
-
Robert
G. Salembier and Paul Southerington, An Implementation of the AKS
Primality Test, ECE 746 Project Report, Spring 2005
-
Robert
G. Salembier and Paul Southerington, AKS Implementation, source codes
available on request
-
Dong Wan Han, Generating strong prime numbers using probabilistic tests
for primality, ECE 646 Project, Spring 1999 (presentation
+
report)
-
Factoring of
large numbers using Number Field Sieve
- implementing and analyzing rho, p-1, and trial division
algorithms
- precomputations, postcomputations, and test vector
generation for the reconfigurable computing implementations based on SRC
and COPACOBANA
- software experiments regarding ECM, rho, p-1, and trial
division algorithms
Resources:
-
Kris Gaj, Soonhak Kwon, Patrick Baier, Paul
Kohlbrenner, Hoang Le, Khaleeluddin Mohammed, Ramakrishna Bachimanchi,
"Implementation of the Elliptic Curve Method of Factoring in
Reconfigurable Hardware,"
SHARCS 2006
(presentation
+
paper)
-
Sandeep Kumar, Christof Paar, Jan Pelzl, Gerd
Pfeiffer, Andy Rupp, and Manfred Schimmler, "How to Break DES for €
8,980,"
SHARCS 2006 (presentation
+
paper)
-
SRC
Computers
-
Song Y. Yan, Number Theory for Computing, 2nd ed., Springer-Verlag,
Berlin, 2002
-
Generation of
truly random numbers with known factorization
Resources:
-
Implementation of
selected candidates competing in the eSTREAM contest for the stream
cipher standard in assembly language or Java
Resources:
-
Efficient
implementation of Elliptic Curve Cryptosystems over binary Galois
Fields, GF(2m) in polynomial bases, based on special
polynomials (trinomials and pentanomials)
Resources:
-
Efficient
implementation of Elliptic Curve Cryptosystems over binary Galois
Fields, GF(2m) in normal bases
Resources:
Hardware
projects
-
Implementation of selected
candidates competing in the eSTREAM contest for the stream cipher standard
Resources:
-
Implementation of a selected new
mode of operation of a secret-key cipher providing both encryption and
authentication (e.g., GCM, CCM, OCB, EAX)
Resources:
-
Milind Parelkar,
Authenticated – Encryption in Hardware, MS Thesis, George Mason University, ECE
Department, December 2005
-
Critical analysis of the existing
hardware implementations of AES
Resources:
-
Analysis of existing hardware
implementations of True Random Number Generators
Resources:
-
Analysis of countermeasures against
side-channel attacks based on power analysis
Resources:
Analytical projects
-
Evolution of protocols and products
for Secure Wireless Communication: algorithms, modes of operation, key
management, etc.
Resources:
-
Jay A. Crossler, "Defensive
Strategies for Establishing a Secure Wireless Network," ECE 646 project,
Fall 2003 (presentation
+
report)
-
Certification of
cryptographic modules according to FIPS 140-2 and/or Common Criteria– case study
of FPGA-based products and/or smart cards
Resources:
-
Survey of patents related
to cryptographic algorithms and their implementations
Resources:
-
Alfred J. Menezes, Paul C.
van Oorschot, and Scott A. Vanstone,
Handbook of Applied Cryptography, CRC Press, Inc., 1996,
Chapter
15, Patents and Standards
-
RSA
Laboratories, Patents on Cryptography
-
Wikipedia, ECC
Patents
-
D. J. Bernstein, Irrelevant
patents on elliptic-curve cryptography
|