diff --git a/cryptography/README.md b/cryptography/README.md
index f0c9347..5a90063 100644
--- a/cryptography/README.md
+++ b/cryptography/README.md
@@ -6,6 +6,7 @@
 * [New Directions in Cryptography (1976)](http://www-ee.stanford.edu/~hellman/publications/24.pdf)
 * [RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis (2013)](http://www.cs.tau.ac.il/~tromer/papers/acoustic-20131218.pdf)
 * [The Moral Character of Cryptographic Work (2015)](http://web.cs.ucdavis.edu/~rogaway/papers/moral-fn.pdf)
+* [:scroll:](ntru-prime.pdf) [NTRU Prime (2016)](https://eprint.iacr.org/2016/461.pdf) (Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange, and Christine van Vredendaal)
 
 ## Related Works
 ### [A Mathematical Theory of Cryptography (1945)](http://www.cs.bell-labs.com/who/dmr/pdfs/shannoncryptshrt.pdf) - Shannon
diff --git a/cryptography/ntru-prime.pdf b/cryptography/ntru-prime.pdf
new file mode 100644
index 0000000..86581e8
Binary files /dev/null and b/cryptography/ntru-prime.pdf differ
diff --git a/non_blocking_algorithms/README.md b/non_blocking_algorithms/README.md
new file mode 100644
index 0000000..89e9282
--- /dev/null
+++ b/non_blocking_algorithms/README.md
@@ -0,0 +1,9 @@
+# Non-Blocking Algorithmics
+
+An non-blocking algorithm is an algorithm in which failure or suspension of any thread cannot cause failure or suspension of another thread; for some operations, these algorithms provide a useful alternative to traditional blocking implementations. A non-blocking algorithm is lock-free if there is guaranteed system-wide progress, and wait-free if there is also guaranteed per-thread progress.
+
+## Included Papers
+
+* [:scroll:](a-wait-free-stack.pdf) [A Wait-Free Stack (2015)](https://arxiv.org/abs/1510.00116) (Seep Goel, Pooja Aggarwal, Smruti R. Sarangi)
+* [:scroll:](a-wait-free-queue-as-fast-as-fetch-and-add.pdf) [A Wait-free Queue as Fast as Fetch-and-Add (2016)](http://chaoran.me/assets/pdf/wfq-ppopp16.pdf) (Chaoran Yang, John Mellor-Crummey)
+* [:scroll:](efficient-lock-free-b+trees.pdf) [Efficient Lock-free B+trees (2014)](http://orbit.dtu.dk/files/102419168/abstract_ELB_trees.pdf) (Lars Frydendal Bonnichsen, Sven Karlsson, Christian W. Probst)
\ No newline at end of file
diff --git a/non_blocking_algorithms/a-wait-free-queue-as-fast-as-fetch-and-add.pdf b/non_blocking_algorithms/a-wait-free-queue-as-fast-as-fetch-and-add.pdf
new file mode 100644
index 0000000..635c69e
Binary files /dev/null and b/non_blocking_algorithms/a-wait-free-queue-as-fast-as-fetch-and-add.pdf differ
diff --git a/non_blocking_algorithms/a-wait-free-stack.pdf b/non_blocking_algorithms/a-wait-free-stack.pdf
new file mode 100644
index 0000000..4607928
Binary files /dev/null and b/non_blocking_algorithms/a-wait-free-stack.pdf differ
diff --git a/non_blocking_algorithms/efficient-lock-free-b+trees.pdf b/non_blocking_algorithms/efficient-lock-free-b+trees.pdf
new file mode 100644
index 0000000..05a1511
Binary files /dev/null and b/non_blocking_algorithms/efficient-lock-free-b+trees.pdf differ
diff --git a/quantum_computing/README.md b/quantum_computing/README.md
new file mode 100644
index 0000000..ab63150
--- /dev/null
+++ b/quantum_computing/README.md
@@ -0,0 +1,5 @@
+# Quantum computing
+
+## Included Papers
+
+* [:scroll:](advance_in_quantum_machine_learning.pdf) [Advances in quantum machine learning (2015)](https://arxiv.org/abs/1512.02900) (Jeremy Adcock, Euan Allen, Matthew Day, Stefan Frick, Janna Hinchliff, Mack Johnson, Sam Morley-Short, Sam Pallister, Alasdair Price, Stasja Stanisic)
\ No newline at end of file
diff --git a/quantum_computing/advance_in_quantum_machine_learning.pdf b/quantum_computing/advance_in_quantum_machine_learning.pdf
new file mode 100644
index 0000000..7aa00cf
Binary files /dev/null and b/quantum_computing/advance_in_quantum_machine_learning.pdf differ