{"id":711,"date":"2009-08-29T16:55:39","date_gmt":"2009-08-29T20:55:39","guid":{"rendered":"http:\/\/www.bu.edu\/csmet\/?page_id=711"},"modified":"2025-11-07T12:48:55","modified_gmt":"2025-11-07T17:48:55","slug":"cs789","status":"publish","type":"page","link":"https:\/\/www.bu.edu\/csmet\/academic-programs\/courses\/cs789\/","title":{"rendered":"Cryptography"},"content":{"rendered":"<style> p {margin-bottom:0px;} .course-feed .cf-course h4 {display: none; white-space: wrap;} .button{width:125px;}<\/style>\n<hr \/>\n<div class=\"course-feed\"><div class=\"cf-course\">\n\t<h4>Cryptography<\/h4>\n\t<p class=\"meta\">MET CS 789 (4 credits)<\/p>\n\t\n\t<p>Prerequisites: (MET CS 248 & MET CS 566) or consent of instructor - The course covers the main concepts and principles of cryptography, with the main emphasis on public key cryptography. It begins with the review of integers and a thorough coverage of the fundamentals of finite group theory, followed by the RSA and ElGamal ciphers. Primitive roots in cyclic groups and the discrete log problem are discussed. Baby-step Giant-step and the Index Calculus probabilistic algorithms to compute discrete logs in cyclic groups are presented. Naor -- Reingold and Blum -- Blum -- Shub Random Number Generators as well as Fermat, Euler and Miller-Rabin primality tests are thoroughly covered. Pollard's Rho, Pollard's and Quadratic Sieve factorization algorithms are presented. The course ends with the coverage of some oblivious transfer protocols and zero-knowledge proofs. There are numerous programming assignments in the course.<\/p>\n\t\n\t\n<\/div><\/div>\n<p><strong>Format &amp; Syllabus:<\/strong><\/p>\n<div class=\"btn-group\">\n<div class=\"dropdown\">\n<p><button class=\"button\">On Campus<\/button><\/p>\n<div class=\"dropdown-content\"><a href=\"\/csmet\/files\/2024\/08\/789-CS-Syllabus-Fall-2024-Boston.pdf\"><\/a><a href=\"\/csmet\/files\/2025\/11\/CS-789-Syllabus-25-Boston.pdf\">789 A1 FALL25<\/a><a href=\"\/csmet\/files\/2024\/08\/789-CS-Syllabus-Fall-2024-Boston.pdf\">CS789 FALL24<\/a><a href=\"\/csmet\/files\/2020\/10\/CS-789-A1_Syllabus_Pascoe.pdf\">CS789 FALL20<\/a><a href=\"\/csmet\/files\/2019\/12\/MET-CS789-Cryptography-Fall-2019-Boston.pdf\">CS789 FALL19<\/a><a href=\"\/csmet\/files\/2015\/08\/CS789_B1_Fall-2015.pdf\">CS789 FALL15<\/a><\/div>\n<\/div>\n<div class=\"dropdown\"><button class=\"button\" disabled=\"disabled\">Online<\/button><\/div>\n<div class=\"dropdown\"><button class=\"button\" disabled=\"disabled\">Blended<\/button><\/div>\n<\/div>\n<div class=\"clearfloat\"><\/div>\n<p>&nbsp;<\/p>\n<h5><\/h5>\n","protected":false},"excerpt":{"rendered":"<p>Format &amp; Syllabus: On Campus 789 A1 FALL25CS789 FALL24CS789 FALL20CS789 FALL19CS789 FALL15 Online Blended &nbsp;<\/p>\n","protected":false},"author":1719,"featured_media":0,"parent":7301,"menu_order":79,"comment_status":"closed","ping_status":"closed","template":"page-templates\/no-sidebars.php","meta":[],"_links":{"self":[{"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/pages\/711"}],"collection":[{"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/users\/1719"}],"replies":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/comments?post=711"}],"version-history":[{"count":24,"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/pages\/711\/revisions"}],"predecessor-version":[{"id":30891,"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/pages\/711\/revisions\/30891"}],"up":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/pages\/7301"}],"wp:attachment":[{"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/media?parent=711"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}