.
├── Coppersmith matrix construction.htm
├── exam
│ ├── Exercise 1.html
│ ├── Exercise 1.ipynb
│ ├── Exercise 2.html
│ ├── Exercise 2.ipynb
│ ├── Exercise 3.html
│ ├── Exercise 3.ipynb
│ ├── Exercise 4.html
│ └── Exercise 4.ipynb
├── notebooks
│ ├── Computing order divisors.ipynb
│ ├── Computing square roots in a finite field.html
│ ├── Computing square roots in a finite field.ipynb
│ ├── Coppersmith method with most significant bits unknown.html
│ ├── Coppersmith method with prime most significant digits known.html
│ └── Practice exams
│ ├── Coppersmith example.ipynb
│ ├── Coppersmith method with most significant bits unknown.ipynb
│ ├── Coppersmith method with prime most significant digits known.ipynb
│ ├── Exam January 2021.ipynb
│ ├── Exam January 2022.ipynb
│ ├── Exam November 2021 - exercise 2 - p-1 method.ipynb
│ ├── Exam november 2021.ipynb
│ ├── Exam October 2020.ipynb
│ ├── Practice exam - exercise 3.nb
│ ├── Practice exam - with guesswork.ipynb
│ └── Practice exam - without guesswork.ipynb
└── notes
├── Lecture 02.pdf
├── Lecture 03.pdf
├── Lecture 04.pdf
├── Lecture 05 - part 2.pdf
├── Lecture 06.pdf
├── Lecture 07.pdf
├── Lecture 08.pdf
├── Lecture 09.pdf
├── Lecture 10.pdf
├── Lecture 11.pdf
├── Lecture 12.pdf
├── Lecture 13.pdf
└── Lecture 14.pdf
4 directories, 38 files
tree v1.7.0 © 1996 - 2014 by Steve Baker and Thomas Moore
HTML output hacked and copyleft © 1998 by Francesc Rocher
JSON output hacked and copyleft © 2014 by Florian Sesser
Charsets / OS/2 support © 2001 by Kyosuke Tokoro