This course provides a challenging introduction to some of the central ideas of theoretical computer science. Beginning in antiquity, the course will progress through finite automata, circuits and decision trees, Turing machines and computability, efficient algorithms and reducibility, the P versus NP problem, NP-completeness, the power of randomness, cryptography and one-way functions, computational learning theory, and quantum computing. It examines the classes of problems that can and cannot be solved by various kinds of machines. It tries to explain the key differences between computational models that affect their power.
" This course covers topics on the engineering of computer software and hardware systems: techniques for controlling complexity; strong modularity using client-server design, virtual memory, and threads; networks; atomicity and coordination of parallel activities; recovery and reliability; privacy, security, and encryption; and impact of computer systems on society. Case studies of working systems and readings from the current literature provide comparisons and contrasts. Two design projects are required, and students engage in extensive written communication exercises."
This course focuses on the fundamentals of information security that are used in protecting both the information present in computer storage as well as information traveling over computer networks. Upon successful completion of this course, the student will be able to: explain the challenges and scope of information security; explain such basic security concepts as confidentiality, integrity, and availability, which are used frequently in the field of information security; explain the importance of cryptographic algorithms used in information security in the context of the overall information technology (IT) industry; identify and explain symmetric algorithms for encryption-based security of information; identify and explain public key-based asymmetric algorithms for encryption-based security of information; describe the access control mechanism used for user authentication and authorization; describe Secure Sockets Layer (SSL) as a common solution enabling security of many applications, including all Internet-based commerce; describe securing Internet Protocol (IP) communications by using Internet Protocol Security (IPSec); explain the importance of physical security and discuss ways to improve physical security of an enterprise; explain the use of such security tools as firewalls and intrusion prevention systems; explain malicious software issues, such as those brought forth by software-based viruses and worms; explain common software security issues, such as buffer overflow; describe the basic process of risk assessment in the context of overall IT security management. (Computer Science 406)
Subject covers technology concepts and trends underlying current and future developments in information technology, and fundamental principles for the effective use of computer-based information systems. Special emphasis on networks and distributed computing, including the web. Other topics include: hardware and operating systems, software development tools and processes, relational databases, security and cryptography, enterprise applications and business process redesign, and electronic commerce. Hands-on exposure to Web, database, and graphical user interface (GUI) tools. Primarily for Sloan master's students.
Broad coverage of technology concepts underlying modern computing and information management. Topics include computer architecture and operating systems, relational database systems, graphical user interfaces, networks, client/server systems, enterprise applications, cryptography, and the web. Hands-on exposure to internet services, Microsoft Access database management system, and Lotus Notes. Information Technology I helps students understand technical concepts underlying current and future developments in information technology. There will be a special emphasis on networks and distributed computing. Students will also gain some hands-on exposure to powerful, high-level tools for making computers do amazing things, without the need for conventional programming languages. Since 15.564 is an introductory course, no knowledge of how computers work or are programmed is assumed.
This course provides an introduction to the theory and practice of quantum computation. Topics covered include: physics of information processing; quantum logic; quantum algorithms including Shor's factoring algorithm and Grover's search algorithm; quantum error correction; quantum communication; and cryptography.
Subject:
Mathematics and Statistics, Science and Technology
This course will cover a number of advanced "selected topics" in the field of cryptography. The content may include, depending on the time available and student interest, topics such as: cryptographic protocols (general security definitions, composition theorems, protocols for specific tasks such as commitments and key exchange, general multi-party computation, composable notions of security for PK encryption and signatures), theory of extractors, privacy amplification, special-purpose factoring devices (and algorithms), concrete security arguments, differential cryptanalysis, public-key infrastructures, and protocols for electronic voting.
No restrictions on your remixing, redistributing, or making derivative works.
Give credit to the author, as required.
Your remixing, redistributing, or making derivatives works comes with some
restrictions, including how it is shared.
Your redistributing comes with some restrictions. Do not remix or make
derivative works.
Copyrighted materials, available under Fair Use and the TEACH Act for US-based
educators, or other custom arrangements. Go to the resource provider to see
their individual restrictions.
