Ransomware and Blockchain Forensics
We are going to study how ransomware propagates and operates. Mine data about payments. Detect specific events and monitor and analyse malware also.
Prerequisites: COMPGA12,programming, visualization, machine learning, working large databases.
Segregated Witness Digital Signatures and Off-Chain Payments in Bitcoin
We will study possibilities offered by new upgrades of bitcoin with Schnorr signatures.
Prerequisites: COMPGA12, COMPGA03 intro to cryptography, good programming, maths.
Anonymity Attacks on Bitcoin Monero Dash ZCash
We will study what and how the attacker can learn about the transaction history in anonymous crypto currencies such as Monero and SDC. We will built software attacks, explore and visualize large data sets.
Prerequisites: COMPGA12, some cryptography, good programming, visualization, working with large databases
Recovery of Private Keys for Bitcoin Wallets
We will develop and implement an attack which consist of discovering a private key of a bitcoin wallet by a side channel attack on a standard PC/laptop or on a smart card.
Prerequisites: COMPGA18 and COMPGA12, basic crypto, good programming skills, engineering background, statistics, operating systems, computer security.
Blockchain Forensics in Bitcoin and other crypto currencies
We are going to mine data from bitcoin blockchain etc etc and create large databases. Then we are going to try to detect specific events and monitor and analyse ransomware and bitcoin thefts.
Not obligatory: C++ or Java programming, databases, some maths (discrete logarithm problem), DSA/ECDSA digital signatures, introduction to Cryptography, COMPGA12, COMPGA18 cryptanalysis, Computer Security.
Cold War Cryptography and Modern Block Ciphers
We will study how various historical ciphers such as East-German T-310, Russian GOST cipher etc. We will exploit correlation, LC, DC, self-similarity, fixed points, involutions, reflection attacks etc.
Maths, good grade in all cryptography modules, maybe some programming.
Cryptanalysis of T-310
We will study the T-310 stream cipher used by Eastern German government during the Cold War. We will study the applicability of all known classical attacks on block and stream ciphers.
Prerequisites: COMPGA18 obligatory, good maths, matrices, polynomials, Boolean functions, ANF.
Efficient Algebraic Coding of ECC Problems
We will study some selected topics covered in this paper such as D73 Theorem page 61. The main problem is given a set of solutions defined by ECC relations and constraints what is the most efficient method to encode them as low degree polynomial equations mod P? Another problem is, can such systems of equations be solved by software at a reasonable cost? A key problem is how the complexity of algebraic coding can be reduced by using redundant expansions on the set of variables. We dispose of a ready
suite of software solutions which allows one to explore these problems.
Prerequisites: COMPGA12 ECC labs, COMPGA18 Cryptanalysis obligatory, maths/algebra, scientific programming with polynomials in C/C++ or SAGE maths.