
Suggested Project Topics
and Related Resources  Spring 2008
Software
projects
Group SW1
Extensions to Cryptool  public domain educational program for learning
cryptology
Resources
common for the entire group:
Suggestions for the Possible CrypTool Extensions

Number Field Sieve
factoring algorithm
Resources:

General Number Field Sieve  Wikipedia article

Song Y. Yan, Number Theory for Computing, 2nd ed., SpringerVerlag,
Berlin, 2002.

Arjen K. Lenstra and H. W.
Lenstra, Jr. (eds.), The development of the number field sieve,
Lecture Notes in Math. (1993) 1554. SpringerVerlag.

Carl
Pomerance, "A Tale of Two Sieves," Notices of the AMS 43 (12):
14731485, Dec. 1996.

B. Murphy and R. P. Brent. "On quadratic polynomials for the number
field sieve," Australian Computer Science Communications 20 (1998), pp.
199213.

Thorsten Kleinjung, "On polynomial selection for the general number
field sieve," Mathematics of Computation 75: 20372047 (Oct. 2006).

Jens Franke and Thorsten Kleinjung, "Continued Fractions and Lattice
Sieving," SHARCS 2005.

Chandana Anand, "Factoring of Large Numbers using Number Field Sieve 
The Matrix Step," Research Project Report and Scholarly Paper, ECE
Department, Spring 2007. (source codes in C++ based on the LiDIA
library, and in MAGMA available on request).

Libraries and Programming Resources

Timing attacks
against public key cryptosystems
Resources:

Paul C. Kocher, "Timing Attacks on Implementations of DieHellman, RSA,
DSS, and Other Systems," 
Proc. Crypto'96, pp. 104113.

Kevin Magee,
"Timing Cryptanalysis," Scholarly Paper, George Mason University, ECE
Department, September 2004

Kevin Magee,
Program demonstrating timing
attack for a short key

Statistical tests
for randomness
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 338.

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)

Generation of
truly random numbers with known factorization
Resources:
Group SW2
Experiments with eBATS 
eCRYPT
Benchmarking
of AsymmeTric
Systems
Resources
common for the entire group:
Suggestions for the Possible Projects Involving eBATS

Comparative
analysis of software multiprecision arithmetic libraries for public key
cryptography
Resources:

Developing eBATS
based on the new ECC library developed at GMU as a part of ECE 746 in
Fall 2006  ECClib
Resources:

Matthew Estes and Philip Hines, Efficient
Implementation of Elliptic Curve Cryptosystems over Binary Galois
Fields, GF(2^{m}) in Normal and Polynomial Bases, ECE 746
Project, Fall 2006 (final
report + final
presentation).

D. Hankerson,
A. Menezes, and
S. Vanstone,
Guide to Elliptic Curve Cryptography, Springer, 2004

M. Rosing,
Implementing Elliptic Curve
Cryptography, Manning Publications, 1998, including the
source codes (scroll to the bottom of the book web page for the Download
link)

Extending eBATs
to support new emerging class of public key cryptosystems called
pairingbased cryptosystems
Resources:

P. S. L. M. Barreto, H. Y. Kim, B. Lynn, M. Scott, "Efficient Algorithms
for PairingBased Cryptosystems," Crypto 2002.

The PairingBased Crypto Lounge

Paulo S. L. M. Barreto,
Steven Galbraith, Colm O hEigeartaigh, and Michael Scott, "Efficient
Pairing Computation on Supersingular Abelian Varieties," Cryptology
ePrint Archive, 2004/375.

Soonhak Kwon, "Efficient
Tate Pairing Computation for Supersingular Elliptic Curves over Binary
Fields," Cryptology ePrint Archive, 2004/303.

John
Gibson, Efficient Software Implementations of Pairing Based
Cryptosystems over Binary Fields, MS Thesis, GMU, ECE Department (under
development).
Hardware
projects
Group HW1
Comparative Analysis of Various Hardware Architectures of AES
Resources
common for the entire group:
Suggestions for the Possible Project Topics

Sbox vs. Tbox based iterative
architecture of AES
Resources:

Fully pipelined implementations of
AES with a speed exceeding 20 Gbit/s with Sboxes implemented using logic only
(instead of lookup tables)
Resources:

Compact architectures of AES with a
data path width equal to 8bits, 32bits, 64bits, 128bits
Resources:
Group HW2
eBATS for FPGAbased platforms
Resources
common for the entire group:

Block cipher eBATS for Xilinx or
Altera FPGAs
Resources:

Stream cipher eBATS for Xilinx or
Altera FPGAs
Resources:
Analytical projects
Group AN

Analysis of various proposed designs
for True Random Number Generators
Resources:

Viktor Fischer,
Milos Drutarovský, Martin Šimka, Nathalie Bochard, "High Performance
True Random Number Generator in Altera Stratix FPLDs," FPL 2004

Paul
Kohlbrenner and Kris Gaj, "An Embedded True Random Number Generator for
FPGAs," FPGA 2004

Holger Bock, Marco Bucci,
Raimondo Luzzi, "An OffsetCompensated OscillatorBased Random Bit
Source for Security Applications," CHES 2004.

Marco Bucci, Raimondo Luzzi,
"Design of Testable Random Bit Generators," CHES 2005 (paper +
presentation).

Markus Dichtl, Jovan Golic,
"HighSpeed True Random Number Generation with Logic Gates Only," CHES
2007.

Random Number Generators

Analysis of countermeasures against
sidechannel attacks based on power analysis
Resources:

Certification of
cryptographic modules according to FIPS 1402 and/or Common Criteria– case study
of FPGAbased products and/or smart cards
Resources:

Survey of patents related
to cryptographic algorithms and their implementations, with the special focus on
ECCrelated patents
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 ellipticcurve cryptography

Cache attacks
against secret key cryptosystems and analysis of effectiveness of all
known countermeasures
Resources:

Daniel Bernstein, Cachetiming attacks on AES

Robert
G. Salembier, "Analysis of Cache Timing Attacks against AES, Scholarly
Paper," ECE Department, May 2006

Dag
Arne Osvik, Adi Shamir, Eran Tromer, "Cache attacks and countermeasures:
the case of AES," Proc. CTRSA 2006.

Dag
Arne Osvik, Adi Shamir, Eran Tromer, "Full AES key extraction in 65
milliseconds using cache attacks," presentation at the Crypto 2005 rump
session
