Where would you hide a tree?
Cryptography
Algebraic
Cryptography and Coding Theory
- Lidl Niederreiter, Introduction to finite fields and their
applications [512.3 LID]
- Note there are three versions: the original, the revised edition
(contains some references, nothing more) and the new book titled
“Finite fields” where some topics are moved or removed
while it has pretty long and deep notes for each chapter.
- Carlet,
Boolean Functions for Cryptography and Error Correcting
Codes [preliminary]
- Carlet, Vectorial Boolean Functions for Cryptography [pre]
- Silverman, An Introduction to Mathematical Cryptography
[003.54 HOF]
- Stinson Paterson, Cryptography: theory and practice
[005.82 STI]
- Washington, Elliptic Curves: number theory and
cryptography [516.352 WAS]
- Roth, Introduction to Coding Theory [003.54 ROT]
- Mac Williams, The Theory of Error-Correcting Codes
[003.54 MAC]
- Koblitz, Algebraic Aspects of Cryptography [005.82
KOB]
Papers
- Rothaus, 1966, On Bent Functions [10.1016/0097-3165(76)90024-8]
- Blakley, 1979, Safeguarding cryptographic keys
[10.1109/MARK.1979.8817296]
- Shamir, 1979, How to Share a Secret
[10.1145/359168.359176]
- Lenstra, 1987, Factoring integers with elliptic curves
[10.2307/1971363]
- Goldwasser, Micali, Rackoff, 1989, The knowledge complexity
of interactive proof-systems [10.1145/22145.22178]
- Quisquater, Guilou et. al, 1989, How to Explain
Zero-Knowledge Protocols to Your Children
[10.1007/0-387-34805-0_60]
- Pedersen, 1991, Non-Interactive and Information-Theoretic
Secure Verifiable Secret Sharing [10.1007/3-540-46766-1_9]
- Pomenance, 1996, A tale of two sieves
[10.1090/dol/034/15]
- Paterson, 1999, Imprimitive Permutation Groups and Trapdoors
in Iterated Block Ciphers [10.1007/3-540-48519-8_15]
- Rivest, Shamir, Tauman, 2001, How to Leak a Secret
[10.1007/3-540-45682-1_32]
- Shumow, Ferguson, 2007, On the Possibility of a back door in
NIST SP800-90 Dual Ec Prng [pdf]
- Caranti, Della Volta, Sala, 2008, On some block ciphers and
imprimitive groups [arXiv:0806.4135]
- Bhupendra, Lexi, Sanjay, 2009, Algebraic Relations of
Serpent S-Boxes [eprint]
- Heys, 2010, A tutorial on linear and differential
cryptanalysis [10.1080/0161-110291890885.pdf]
- Damgard, Nielsen, 2011, Commitment Schemes and
Zero-Knowledge Protocols [10.1007/3-540-48969-X_3]
- Dillon, 2015, A Survey of Bent Functions [cryptodome]
- Costello, 2012, Pairings for Beginners [pdf]
- Krause, 2018, On the security of AES [html] [pdf]
- Heys, 2020, A Tutorial on the Implementation of Block
Ciphers: Software and Hardware Applications [eprint]
- Battagliola, Longo, Meneghetti, Sala, 2020, Threshold ECDSA
with an Offline Recovery Party [arxiv]
Computational Algebra
- Cohen, A Course in Computational Algebraic Number
Theory [512.74 COHE]
- Cohen, Cuypers, Sterk, Some Tapas of Computer Algebra
[10.1007/978-3-662-03891-8]
- Gathen, Gerhard, Modern Computer Algebra [512.00285
GAT]
Some Algebra
- Herstein, Topics In Algebra [512 HER]
- Carmichael, Introduction to the Theory of Groups of finite
order [512.2 CARM]
More Algebra
- Reid, Undergraduate Commutative Algebra [512.24
REI]
- Zariski, Samuel, Commutative Algebra [512.24 ZAR]
- Reid, Undergraduate Algebraic Geometry [516.35
REI]
- Fulton, Algebraic Curves [pdf]
- Shafarevich, Basic Algebraic Geometry 1 [516.35
SHA]
- Ribenboim, The New Book of Prime Number Records [512.72
RIB]
- Gouvea, p-adic Numbers [512.74 GOU]
Books for fun
- Boiler, Recreations in the Theory of Numbers [793.74
BEI]
- Conway, On Numbers and Games [519.3 CON]
- Stamp, Applied Cryptanalysis: Breaking Ciphers in the Real
World
- Gaines, Cryptanalysis: A Study of Ciphers and Their
Solution
- Friedman, Method for the solution of ciphers [15]
[16]
[17]
- Others
from Friedman declassified by NSA
- Cajori, A history of mathemacial notations [510.9
CAJ]
- Mesnager, Bent Functions
Wiki
Others
Videos