Undergraduate (3rd and 4th years)
HOME Undergraduate (3rd and 4th years) Special Lectures in Information Science III
This is information from a past (2023) course.
The URLs, account and classroom informations have been removed to prevent the leakage of internal information for online classes.
Last updated at Apr 22, 2024.

Class plans and classrooms are subject to change, so be sure to check UTAS for the latest information.
If you do not have access to the UTAS, please contact your instructor or academic affairs office.

Special Lectures in Information Science III

Algorithms for Information Security and Privacy
In this class, we discuss algorithms that use for speeding up systems for information security and privacy. Particularly, the class focuses on algorithms for elliptic curve cryptography, one of the most well-known cryptographic system. We also explain ideas behind discrete algorithms that can protect users’ personal information in large-scale database.

本授業には、情報セキュリティ・情報プライバシーを保護するシステムを最速するアルゴリズムについて講義する。特に、セキュリティ技術の代表になっている楕円曲線暗号の実装アルゴリズムについて議論し、巨大データベースに入っている個人情報を保護する離散アルゴリズムを解説する。
MIMA Search
Code
Course title
Lecturer
Semester
Period
0510063
FSC-IS4063L1
Special Lectures in Information Science III
Suppakitpaisarn Vorapong
A1 A2
Mon 3rd
Add to My List
Remove from My List
Language
English
Credit
2
Lecturers with practical experience
NO
Other Faculty
NO
Course Offered by
Science
Schedule
Differential Privacy Class 1: Anonymity Class 2: Basic Definition Class 3: Laplacian Mechanism Class 4: Workshop 1 Class 5: Exponential Mechanism Class 6: Graph Differential Privacy Class 7: Local Differential Privacy Class 8: Graph Local Differential Privacy Class 9: Workshop 2 Elliptic Curve Cryptography Class 10: Introduction to Abstract Algebra Class 11: Calculation on elliptic curves, Diffie-Hellman Key Exchange Protocol Class 12: Divisors Class 13: Pairing-based cryptography Class 14: Workshop 3 Class 15: Exercises
Teaching Methods
The lecture is given in English using a projector and a blackboard. プロジェクター・黒板を併用した講義の形式で行います。
Method of Evaluation
There is one final examination and three optional assignments during this course.
Required Textbook
Lecture notes will be distributed at a given Slack channel. https://*****.slack.com/*****
Reference Books
1) C. Dwork and A. Roth. The Algorithmic Foundations of Differential Privacy, Foundation and Trends in Theoretical Computer Science, Vol. 9, Nos. 3-4, pages 211-407, 2014. 2) L. C. Washington. Elliptic Curves: Number Theory and Cryptography, 2nd edition. Chapman & Hall/CRC, 2007.
Notes on Taking the Course
The basic knowledge on algorithms and data structures is assumed, but any knowledge on cryptography and anonymity is not. Students must be familiar with mathematical notations before joining this class.