Special Topics Course

This class is meant to open to you research in Cryptography, both theoretical and applied. To do so, the class will involve reading research papers, reviewing them, discussing them, and doing a project.

Possible topics include:

• Graph algorithms o Traversals

292F: All About Networks Fall 2017, TR 9-11, Phelps 2510

o Shortest paths o Spanning tree o Network flow o Matching

Spectral analysis
o Eigenvaluesandeigenvectors o Laplacian
o Conductance bounds

Cuts, partitions, and sparsifiers

Random walks

Metrics:

o Centrality

o Homophily

Power laws

Network models
o Erdos Renyi (ER) model

Cryptography provides techniques, mechanisms, and tools for private and authenticated communication, and for performing secure and authenticated transactions over the Internet as well as other open networks. It is highly probable that every single bit of information flowing through our networks will have to be either encrypted and decrypted or signed and authenticated in a few years from now.

This graduate-level special topic class will cover emerging topics on data-driven networking and systems design, ranging from data center networking, mobile networking/computing, cloud computing, infrastructure for social networks, Internet of Things, and cyber physical systems. Students will read and present papers from recent top conferences, and do a team project. 

This is a graduate-level course on neural network and deep learning.  We will discuss neural network, deep learning,  CNN,  RNN, LSTM and their newest advances. 

This course covers advanced topics on information retrieval, web search, and related scalable information systems. The topics include search engines and advertisements, web crawling, classification, indexing and data serving, ranking and recommendation, user behavior analysis, and online services. This course will also cover system and middleware support for building related large-scale Internet services.

Topics:

Public-key cryptography was conceived in 1976 by Whitfield Diffie and Martin Hellman. The first practical realization followed in 1977 when Ron Rivest, Adi Shamir and Len Adleman proposed their now well-known RSA cryptosystem, in which security is based on the intractability of the integer factorization problem. Elliptic curve cryptography (ECC) was discovered in 1985 by Neal Koblitz and Victor Miller. Elliptic curve cryptographic schemes are public-key mechanisms that provide the same functionality as RSA schemes.