- Non-Malleable Cryptography by Danny Dolev, Cynthia Dwork, Moni Naor
- Challenges in Authenticated Encryption by Daniel J. Bernstein
- An Efficient Protocol for Authenticated Key Agreement by Laurie Law, Alfred Menezes, Minghua Qu, Jerry Solinas.
- Two-party authenticated key exchange protocol using lattice-based cryptography by Xiaopeng Yang and Wenping Ma
- The X3DH Key Agreement Protocol by Moxie Marlinspike and Trevor Perrin
- Deniable Authentication and Key Exchange by Mario Di Raimondo, Rosario Gennaro and Hugo Krawczyk
- A non-interactive deniable authentication scheme in the standard model by Bin Wang, Qing Zhao and Ke Dai
- A non-interactive deniable authentication scheme in the standard model by Bin Wang, Qing Zhao and Ke Dai
- Authenticated Key Exchange from Ideal Lattices by Jiang Zhang, Zhenfeng Zhang, Jintai Ding, Michael Snook, and Ozgür Dagdelen
- Security Analysis of Network Protocols by John Mitchell
- Finite-State Security Analysis of OTR Version 2 by Joseph Bonneau and Andrew Morrison.
- Protocol by Nikita Borisov and Ian Goldberg.
- Secure Off-the-Record Messaging by Mario Di Raimondo, Rosario Gennaro and Hugo Krawczyk
- Multi-party Off-the-Record Messaging by Ian Golberg et Al.
- Improved User Authentication in Off-The-Record Messaging by Chris Alexander and Ian Goldberg
- A User Study of Off-the-Record Messaging by Ryan Stedman, Kayo Yoshida and Ian Goldberg
- A Formal Security Analysis of the Signal Messaging Protocol by Katriel Cohn-Gordon, Cas Cremers, Benjamin Dowling, Luke Garratt and Douglas Stebila.
- How Secure is TextSecure? by Tilman Frosch, Christian Mainka, Christoph Bader, Florian Bergsma, Jorg Schwenk and Thorsten Holz.
- Technology preview: Private contact discovery for Signal
- Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String by Uriel Feige, Dror Lapidot and Adi Shamir.
- So you want to use an alternative cipher… by Matthew Green.
- Why switch from AES to a new stream cipher? by Daniel Bernstein.
- Introducing Miscreant: a multi-language misuse resistant encryption library by Tony Arceri
- Nonce misuse resistance 101 by lvh
- Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance by Viet Tung Hoang, Reza Reyhanitabar, Phillip Rogaway and Damian Vizár
- Salsa20 security by Daniel J. Bernstein.
- Notes on the Salsa20 key size by Daniel J. Bernstein.
- Extending the Salsa20 nonce by Daniel J. Bernstein.
- Notes on the Salsa20 key size by Daniel J. Bernstein.
- Implementation in NaCl
- Evaluation of Some Blockcipher Modes of Operation by Phillip Rogaway.
- On the Security of Multiple Encryption by Ralph C. Merkle and Martin E. Hellman
- Entity Authentication and Key Distribution by Mihir Bellare and Phillip Rogaway
- Key Agreement Protocols and their Security Analysis by Simon Blake-Wilson, Don Johnson and Alfred Menezes.
- Key Exchange with Anonymous Authentication using DAA-SIGMA Protocol by Jesse Walker and Jiangtao Li
- Degenerate Keys for RSA Encryption by Seth D. Bergmann
- Info
- Degenerate Curve Attacks by Samuel Neves and Mehdi Tibouchi
- Fault-resistant calculcations on elliptic curves by Marc Joye
- New directions in Cryptography by Diffie and Hellman.
- Diffie-Hellman key exchange by Nikos Drakos
- Diffie-Hellman Key Agreement Method by E. Rescorla
- Diffie-Hellman parameters by OpenSSL
- Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice by David Adrian et al
- Diffie-hellman by Crypto++
- Public key parameters
- A One Round Protocol for Tripartite Diffie–Hellman by Antoine Joux
- The Decision Di�e-Hellman Problem by Dan Boneh
- On Diffie-Hellman key agreement with short exponents by P. C. van Oorschot and M. J. Wiener
- Diffie-Hellman Key Agreement Method by E. Rescorla
- Additional Diffie-Hellman Groups for Use with IETF Standards by M. Lepinski and S. Kent
- HMQV: A High-Performance Secure Diffie-Hellman Protocol by Hugo Krawczyk
- More Modular Exponential (MODP) Diffie-Hellman groups for Internet Key Exchange (IKE) by T. Kivinen and M. Kojo
- Additional Diffie-Hellman Tests for the Internet Key Exchange Protocol Version 2 by Y. Sheffer Porticor, S. Fluhrer
- Methods for Avoiding the "Small-Subgroup" Attacks on the Diffie-Hellman Key Agreement Method for S/MIME by R. Zuccherato
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems by Paul C. Kocher
- On reusing ephemeral keys in Diffie-Hellman key agreement protocols by Alfred Menezes and Berkant Ustaoglu
- A lesson in timing attacks by codahale
- Measuring small subgroup attacks against Diffie-Hellman by Luke Valenta, David Adrian, Antonio Sanso, Shaanan Cohney, Joshua Fried, Marcella Hastings, J. Alex Halderman and Nadia Heninger. Slides
- Remote Timing Attacks are Practical by David Brumley and Dan Boneh
- Why Constant-Time Crypto?
- Cramer Shoup Cryto-System Java implementation by omoeller (not audited).
- Cramer Shoup Cryto-System Python implementation by benkreuter.
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms by Taher ElGamal
- ElGamal:Public-Key Cryptosystem by Jaspreet Kaur Grewal
- The Dual Receiver Cryptosystem and Its Applications by Theodore Diament, Homin K. Lee, Angelos D. Keromytis and Moti Yung
- Practical Dual-Receiver Encryption Soundness, Complete Non-Malleability, and Applications by Sherman S.M. Chow, Matthew Franklin, and Haibin Zhang
- Elliptic Curves Number Theory and Cryptography by Lawrence C. Washington
- Isogenincs for a MIT class.
- Compact representation of an elliptic curve point: This document defines a format for efficient storage representation of an elliptic curve point over prime fields, suitable for use with any IETF format or protocol by A. Jivsov
- Point Generation And Base Point Selection In ECC: An Overview by Moumita Roy1, Nabamita Deb2, Amar Jyoti Kumar.
- SEC 1: Elliptic Curve Cryptography by Certicom Research.
- Elliptic Curves for Security by A. Langley and M. Hamburg. This memo specifies two elliptic curves over prime fields that offer a high level of practical security in cryptographic applications, including Transport Layer Security (TLS). These curves are intended to operate at the ~128-bit and ~224-bit security level, respectively, and are generated deterministically based on a list of required properties.
- ECC2015-Notes by Frederic Jacobs
- Graphs
- How to design an elliptic-curve signature system by blog.cr.yp.to
- Generating Elliptic Curves of Prime Order by Erkay Sava, Thomas A. Schmidt, and Cetin K. Koc
- Extended coordinates with a=-1 for twisted Edwards curves
- Elliptic Curves Suitable for Cryptosystems by Atsuko Miyaji
- Elliptic curves by Bjorn Poonen
- Rigid Parameter Generation for Elliptic Curve Cryptography by B. Black, J. Bos, C. Costello, A. Langley, P. Longa and M. Naehrig
- Tutorial by Tanja Lange
- ECC hacks by Tanja Lange
- Curves Formulas by Tanja Lange
- 512-bit twisted Edwards curve and curve generation methods in Russian standardization by Stanislav V. Smyshlyaev
- Programming: Sage: Elliptic curves over a general field
- Weierstrass coefficients of the canonical lifting by Luis R. A. Finotti
- Weierstrass equation or model
- Elliptic Curves, Lattices, and the Upper Half-Plane
- Elliptic Curve Cryptography: a gentle introduction by Andrea Corbellini
- Curves with a Twist
- Elliptic vs Hyperelliptic by Tanja Lange
- Sign Change Fault Attacks On Elliptic Curve Cryptosystems by Johannes Blömer, Martin Otto and Jean-Pierre Seifert
- An exploration of affine group laws for elliptic curves by Huseyin Hisil, Kenneth Koon-Ho Wong, Gary Carter and Ed Dawson
- A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem by Ayan Mahalanobis and Vivek Mallick
- On isogeny classes of Edwards curves over finite fields by Omran Ahmadi and Robert Granger
- Explicit-Formulas Database by Tanja Lange
- Validation of Elliptic Curve Public Keys by Adrian Antipa, Daniel Brown, Alfred Menezes, René Struik and Scott Vanstone
- Fast genus 2 arithmetic based on Theta functions by P. Gaudry
- Point Generation And Base Point Selection In ECC: An Overview by Moumita Roy, Nabamita Deb and Amar Jyoti Kumar
- Fundamental Elliptic Curve Cryptography Algorithms by D. McGrew, K. Igoe and M. Salter
- Elliptic Curve Groups modulo a Prime (ECP Groups) for IKE and IKEv2 by D. Fu and J. Solinas
- Elliptic Curve Cryptography in Practice by Joppe W. Bos, J. Alex Halderman, Nadia Heninger, Jonathan Moore, Michael Naehrig and Eric Wustrow
- Why Ellipses Are Not Elliptic Curves by Adrian Rice and Ezra Brown
- Visualization by Wolfgang Glas
- Elliptic Curves, Group Law, and Efficient Computation by Hüseyin Hisil. The presentation
- Some notes by Benn Lynn
- SEC 1: Elliptic Curve Cryptography by Daniel R. L. Brown
- Rational points on certain hyperelliptic curves over finite fields by Maciej Ulas
- Construction of Rational Points on Elliptic Curves over Finite Fields by Andrew Shallue and Christiaan E. van de Woestijne
- Compression and decompression of elliptic curve data points
- Encoding points in hyperelliptic curves over finite fields in deterministic polynomial time by Jean-Gabriel Kammerer, Reynald Lercier, and Guénaël Renault
- Twist Insecurity by Manfred Lochter and Andreas Wiemers
- Twist security
- The Jacobi Model of an Elliptic Curve and Side-Channel Analysis by Olivier Billet and Marc Joye
- Arithmetic on Abelian and Kummer Varieties by David Lubicz And Damien Robert
- Elliptic Curves for Security draft-irtf-cfrg-curves-02: an algorithm for deterministically generating parameters for elliptic curves over prime fields by A. Langley.
- Elliptic Curves for Security by A. Langley and M. Hamburg.
- A brief discussion on selecting new elliptic curves by Craig Costello, Patrick Longa, and Michael Naehrig
- Curve41417: Karatsuba revisited by Daniel J. Bernstein, Chitchanok Chuengsatiansup, and Tanja Lange
- Cryptography in NaCl by Daniel J. Bernstein. Pretty interesnting for sage.
- Subtraction
- Elliptic curve point multiplication in Wikipedia.
- Explicit Addition Formulae
- Elliptic curve point multiplication
- Elliptic vs. hyperelliptic by Daniel Bernstein
- Operations by Tanja Lange
- Fault Attacks on Projective-to-Affine Coordinates Conversion by Diana Maimut, C´edric Murdica, David Naccache and Mehdi Tibouchi. Presentation
- Fault Attacks on Projective-to-Affine Coordinates Conversion by Diana Maimut, C´edric Murdica, David Naccache and Mehdi Tibouchi. Pdf
- wNAF*, an Efficient Left-to-Right Signed Digit Recoding Algorithm by Brian King
- Signed Binary Representations Revisited by Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Spahn, and Tsuyoshi Takagi
- Curve25519: new Diffie-Hellman speed records by Daniel J. Bernstein
- A state-of-the-art Diffie-Hellman function by Daniel J. Bernstein
- Usage
- A state-of-the-art Diffie-Hellman function - Code by Daniel J. Bernstein
- Benchmark
- Toy implementatio
- High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers by Michael Düll, Björn Haase, Gesine Hinterwälder, Michael Hutter, Christof Paar and Ana Helena Sánchez
- May the Fourth Be With You: A Microarchitectural Side Channel Attack on Several Real-World Applications of Curve25519 by Daniel Genkin, Luke Valenta and Yuval Yarom
- Twist Insecurity by Manfred Lochter and Andreas Wiemers
- Faster Addition and Doubling on Elliptic Curves by Daniel J. Bernstein and Tanja Lange.
- Twisted Edwards Curves by Daniel J. Bernstein, Peter Birkner, Marc Joye, Tanja Lange, and Christiane Peters
- Twisted Edwards Curves Revisited by Huseyin Hisil, Kenneth Koon-Ho Wong, Gary Carter, and Ed Dawson.
- On isogeny classes of Edwards curves over finite fields by Omran Ahmadi and Robert Granger
- Collective Edwards-Curve Digital Signature Algorithm
- Multiquadratics
- Deterministic Encoding into Twisted Edwards Curves by Wei Yu, Kunpeng Wang, Bao Li and Song Tian.
- Ed448-Goldilocks by sourceforge.
- Mike Hamburg Implementation.
- STRIKE implementation.
- Ed448-Goldilocks, a new elliptic curve by Mike Hamburg.
- Ed448-Goldilocks, a new elliptic curve by Cryptology ePrint Archive
- Decaf: Eliminating cofactors through point compression by Mike Hamburg
- Implementation on C, on github
- Fast and compact elliptic-curve cryptography by Mike Hamburg
- Ed448-Goldilocks, a new elliptic curve by Mike Hamburg
- Some simple ECC tricks by Mike Hamburg
- Spec by Mike Hamburg
- Mike Hamburg's explanation
- Elligator: Elliptic-curve points indistinguishable from uniform random strings by Daniel J. Bernstein, Mike Hamburg, Anna Krasnova and Tanja Lange
- Implementing Elligator for Curve25519 by Adam Langley
- Implementation by Kleshni.
- Implementation by Daniel J. Bernstein.
- Donna-edition by Adam Langley
- Hierarchical Deterministic keys over non-linear Keyspace by Khovratovich and Law
- Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance by P. Rogaway and T. Shrimpton
- The Sponge Functions Corner by Guido Bertoni, Joan Daemen, Michaël Peeters and Gilles Van Assche
- The Keccak SHA-3 submission by by Guido Bertoni, Joan Daemen, Michaël Peeters and Gilles Van Assche
- Stribog
- FIPS 202 and KeccakDerived Functions by John Kelsey
- SHA-3 Derived Functions: cSHAKE, KMAC, TupleHash and ParallelHash by NIST
- A new Design Criteria for Hash-Functions by Jean-Sebastien Coron, Yevgeniy Dodis, , Cecile Malinaud, and Prashant Puniya
- BLAKE2: simpler, smaller, fast as MD5 by Jean-Philippe Aumasson, Samuel Neves, Zooko Wilcox-O’Hearn and Christian Winnerlein
- Analysis of BLAKE2 by Jian Guo, Pierre Karpman, Ivica Nikolic, Lei Wang and Shuang Wu
- BLAKE2: “Harder, Better, Faster, Stronger” Than MD5 by Zooko Wilcox-O'Hearn
- BLAKE 2: slides
- BLAKE2 — fast secure hashing
- Recommendation for Random Number Generation Using Deterministic Random Bit Generators by NIST
- Random number generation: An illustrated primer by Matthew Green
- Surviving a bad RNG by Matthew Green
- Computational Alternatives to Random Number Generators by David M’Raıhi, David Naccache, David Pointcheval, and Serge Vaudenay
- SHA3-based MACs by Ray Perlner.
- New Proofs for NMAC and HMAC: Security without Collision-Resistance by Mihir Bellare.
- Key derivation functions by cryptography.io.
- Recommendation for Key Derivation Using Pseudorandom Functions by Lily Chen in NIST.
- New variant of Guillou-Quisquater digital signature scheme by J. Ettanfouhi, O. Khadir
- RSA signatures and Rabin–Williams signatures: the state of the art by Daniel J. Bernstein.
- Proving tight security for Rabin–Williams signatures by Daniel J. Bernstein.
- Short signatures from the Weil pairing by Dan Boneh, Ben Lynn, and Hovav Shacham.
- A Provably Secure Nyberg-Rueppel Signature Variant with Applications by Giuseppe Ateniese and Breno de Medeiros.
- Performance of Batch-based Digital Signatures by William C. Cheng, Cheng-Fu Chou and Leana Golubchik
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems by Amos Fiat and Adi Shamir
- Schnorr Signatures: An Overview by Christopher Allen.
- Multi-user Schnorr security, revisited by Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe and Bo-Yin Yang
- Fast and compact elliptic-curve cryptography by Mike Hamburg
- Efficient Ring Signatures without Random Oracles by Hovav Shacham and Brent Waters
- Efficient Signature Generation by Smart Cards by C. P. Schnorr
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols by Ronald Cramer, Ivan Damgard, Aarhus University and Berry Schoenmakers
- SPHINCS: practical stateless hash-based signatures by Daniel J. Bernstein, Daira Hopwood, Andreas Hülsing, Tanja Lange, Ruben Niederhagen, Louiza Papachristodoulou, Michael Schneider, Peter Schwabe and Zooko Wilcox-O’Hearn
- Edwards-curve Digital Signature Algorithm (EdDSA): The elliptic curve signature scheme Edwards-curve Digital Signature Algorithm (EdDSA) is described by S. Josefsson.
- Ed25519 and Ed448 for DNSSEC by O. Sury
- EdDSA notes
- High-speed high-security signatures by Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe and Bo-Yin Yang
- EdDSA for more curves by Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe and Bo-Yin Yang
- The Elliptic Curve Digital Signature Algorithm (ECDSA) by American National Standards
- Edwards-curve Digital Signature Algorithm (EdDSA) by S. Josefsson and I. Liusvaara (draft)
- Edwards-curve Digital Signature Algorithm (EdDSA) by S. Josefsson and I. Liusvaara (draft)
- Edwards-Curve Digital Signature Algorithm (EdDSA) by S. Josefsson and I. Liusvaara
- Breaking Ed25519 in WolfSSL by Niels Samwel, Lejla Batina, Guido Bertoni, Joan Daemen, and Ruggero Susella
- A Side-Channel Assisted Cryptanalytic Attack Against QcBits by Melissa Rossi, Mike Hamburg, Michael Hutter and Mark E. Marson
- EdDSA for more curves by Daniel J. Bernstein, Simon Josefsson, Tanja Lange, Peter Schwabe and Bo-Yin Yang
- The XEdDSA and VXEdDSA Signature Schemes by Trevor Perrin.
- qDSA: Small and Secure Digital Signatures with Curve-based Diffie–Hellman Key Pairs by Joost Renes and Benjamin Smith
- Concurrent Zero-Knowledge by Cynthia Dlvork, Moni Naori and Amit Sahai
- Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications by Jonathan Katz
- Recommendation for Pair-Wise Key Establishment Schemes Using Discrete Logarithm Cryptography by NIST
- The random oracle model: a twenty-year retrospective by Neal Koblitz and Alfred J. Menezes.
- Socialist Millionaire Protocol Passphrase Generator by dillbyrne.
- A Fair and Efficient Solution to the Socialist Millionaires’ Problem by Fabrice Boudot, Berry Schoenmakers and Jacques Traoré
- The Double Ratchet Algorithm by Trevor Perrin (editor) and Moxie Marlinspike.
- The Strobe Protocol by Mike Hamburg
- The OAKLEY Key Determination Protocol by H. Orman
- Folklore, Practice and Theory of Robust Combiners by Amir Herzberg.
- Chosen-Ciphertext Security of Multiple Encryption by Yevgeniy Dodis and Jonathan Katz.
- Encryption Works by FOPsF
- Project Wycheproof
- Universally Composable Security: A New Paradigm for Cryptographic Protocols by Ran Canetti
- Theory of Cryptography: 9th Theory of Cryptography Conference, TCC 2012, edited by Ronald Cramer.
- Recommendation for Key Management by Elaine Barker in NIST.
- Recommendation for Pair-Wise Key Establishment Schemes Using Discrete Logarithm Cryptography by Elaine Barker, Don Johnson, and Miles Smid in NIST.
- The PBC (Pairing-Based Cryptography) library by Ben Lynn.
- A Practical Second-Order Fault Attack against a Real-World Pairing Implementation by Johannes Blomer, Ricardo Gomes da Silva, Peter Gunther, Juliane Kramer and Jean-Pierre Seifert
- Off-the-Record Messaging by Ian Goldberg.
- Crypto++ 5.6.5
- cryptopp
- The Apache Milagro Cryptographic Library
- DeDiS Advanced Crypto Library for Go
- Relic
- Libsodium docs
- Libsodium: helpers
- TweetNaCl by Daniel J. Bernstein1, Bernard van Gastel, Wesley Janssen, Tanja Lange, Peter Schwabe3 and Sjaak Smetsers
- NaCl: internals
- HACL: A Verified Modern Cryptographic Library by Jean Karim Zinzindohoué, Karthikeyan Bhargavan, Jonathan Protzenko and Benjamin Beurdouche
- Several
- Privacy Pass by Alex Davidson
- Quantum Computing: Lecture Notes by Ronald de Wolf
- Polynomial time algorithms for prime discrete logarithms on a quantum computer by Peter W. Shor
- Simulating Physics with Computers by Richard Feynman
- Quantum Mechanical Computers by Richard Feynman
- Worst-Case to Average-Case Reductions for Module Lattices
- PQCHacks: A gentle introduction to post-quantum cryptography by djb and Tanja Lange in 32c3.
- Towards quantum-resistance cryptosystems from supersingular elliptic curve isogenies by Luca de Feo, David Jao and Jerome Plut.
- Quantum computers are coming! by Tanja Lange and Daniel J. Bernstein
- Ring learning with errors
- A low-resource quantum factoring algorithm by Daniel J. Bernstein, Jean-François Biasse, and Michele Mosca
- Module-LWE key exchange and encryption: The three bears by Mike Hamburg
- On Lattices, Learning with Errors, Random Linear Codes, and Cryptography by Oded Regev
- On Agnostic Boosting and Parity Learning by Adam Tauman Kalai, Yishay Mansour and Elad Verbin
- Post-Quantum Cryptography by Daniel Bernstein and Johannes Buchmann
- A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem by Jintai Ding, Xiang Xie and Xiaodong Lin
- The Learning with Errors Problem by Oded Regev
- Quantum theory, the Church-Turing principle and the universal quantum computer by David Deutsch
- Post-quantum cryptography –dealing with the fallout of physics success by Daniel J. Bernstein and Tanja Lange
- A Post-Quantum Digital Signature Scheme Based on Supersingular Isogenies by Youngho Yoo, Reza Azarderakhsh, Amir Jalali, David Jao and Vladimir Soukharev
- Quantum Erasure Cryptography by Hatim Salih
- TESLA: Tightly-Secure Efficient Signatures from Standard Lattices by Erdem Alkim, Nina Bindel, Johannes Buchmann, Özgür Dagdelen and Peter Schwabe
- An improved compression technique for signatures based on learning with errors by Shi Bai and Steven D. Galbraith
- NTRU Prime by Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange and Christine van Vredendaal
- An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography by André Chailloux, María Naya-Plasencia, and André Schrottenloher
- Low-communication parallel quantum multi-target preimage search by Gustavo Banegas and Daniel J. Bernstein
- Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions by Reza Curtmola, Juan Garay, Seny Kamara and Rafail Ostrovsky
- Encrypted Viruses
- Official (ISC)2 Guide to the SSCP CBK, Second Edition
- The Art of Computer Virus
- Examples of Malicious Computer Programs by Ronald B. Standler
- Malwaretech
- Common Patterns of Virus Research
- Automatic Transfer Systems (ATS) for Beginners by MalwareTech
- SPHINX: A Password Store that Perfectly Hides from ItselfSPHINX: A Password Store that Perfectly Hides from Itself by Maliheh Shirvanian, Stanislaw Jarecki†, Hugo Krawczyk and Nitesh Saxena
- Obstacles to the Adoption of Secure Communication Tools by Ruba Abu-Salma, Anastasia Danilova, M. Angela Sasse, Alena Naiakshina, Joseph Bonneau and Matthew Smith
- Rebooting the Web-of-Trust
- Tor Browser Bundle - iSEC Deliverable 1.3
- Privacy Enhancement for Internet Electronic Mail: Part I -- Message Encipherment and Authentication Procedures by J. Linn
- Multipurpose Internet Mail Extensions (MIME) Part One: Format of Internet Message Bodies by N. Freed and N. Borenstein