CS 595N: Computer Science Faculty Research Seminar

The computer science department continues its tradition of having faculty members introducing their exciting works to all students interested in research, especially to new PhD and master students as well as CCS Computing students. The purpose of this seminar is multi-fold: Bringing faculty research closer to students, fostering dialogue between faculty and students outside the boundary of research labs, extending the horizon of students at all stage of their research paths.

CS 293S: Information Retrieval and Web Search

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:

CS 292F - Elliptic Curve Cryptography

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.