Digital Logic

Transistors to Gates

Data as Bits

Software Tools

Integer Representation

Combinational Logic

Arithmetic Logic

Sequential logic

Processor Datapath

Floating Point Number Representation

Programming with Memory

C Pointers

C Arrays

Call stack

Representing Data Structures

Buffer overflow

Memory allocation

Memory hierarchy

Exceptional Control Flow (ECF)

Process modeling

Shell (computing)

Thread (computing)

Virtual memory

Process (computing)

CS 240 Foundations of Computer Systems Wellesley College Spring 2023 This course explores the inner workings of computers, focusing on how they execute programs. Students gain an in-depth understanding of software and hardware abstractions, ranging from programming languages to transistors. Key areas covered include computational building blocks, hardware-software interfaces, data representation, and practical system abstractions. The course also emphasizes structured reasoning about program execution and promotes skills for independent learning, critical thinking, and problem-solving in computer science. CS 240 examines how computers run programs, introducing key abstractions and implementations in software and hardware between programming languages and transistors. ## Goals

Course goals include:

- To understand how computers execute programs.
- To understand the roles of key software and hardware abstractions, their implementations, and their relation through translation and representation, including: digital logic, microarchitecture, instruction set architecture, the memory hierarchy, basics of programming language implementations, and operating system abstractions.
- To understand when and how computer system implementation impacts correctness or performance of arbitrary high-level programs.
- To become proficient in structured reasoning about the execution of programs on well-defined models, including the use of assertions and debugging tools to inspect program invariants and execution state.
- To develop foundations for further study of programming language implementation, security, computer architecture, operating systems, networks, concurrent and distributed systems, or other systems/implementation topics in computer science.
- [**To develop skills for independent learning, critical thinking, and problem-solving as a self-reliant computer scientist.**](#compact)

## Topics

The [course home page](https://cs.wellesley.edu/~cs240/s23/) hosts the working schedule. +Optional extensions are prefixed in the schedule with a plus sign. We may visit these if there is time. They are always available for your own exploration in further depth.

**Computational Building Blocks:**

- Hardware computation building blocks: 
    - Transistors, digital logic gates
    - Combinational and arithmetic logic
    - Sequential (stateful) logic
    - Overview of computer processor architecture
- Data representation fundamentals: 
    - Data representation with bits, bit-level computation
    - Number representation, arithmetic
    - The memory model, pointers, and arrays in the C language
    - Assertions, debugging

**Hardware-Software Interface:**

- The instruction set architecture model, machine code, assembly language, x86
- Basic program translation
- Control flow
- Procedures, call stack
- Data layout, security implications

**Abstractions for Practical Systems:**

- The memory hierarchy, caches
- Memory allocation
- Operating system basics: 
    - Exception control flow
    - The process model
    - Virtual memory
- Compilers, run-time systems, programming tools
- Beyond 240 ### When Should You Take CS 240?

**Prerequisite:** CS 230 or permission of the instructor is **required** to enroll in CS 240.

**Recommendations:**

- Consider your courseload carefully. CS 240 is a 1.25-credit lab course that requires a larger time commitment and workload than most 1-credit courses.
- Take CS 240 early after finishing the CS 111 / CS 230 introductory sequence. CS 240 should boost your independence, give valuable context for *how things work* as you approach further computing studies, and open doors to a wide range of courses and areas in CS.

Please talk to the [instructors](#staff) if you have any questions or concerns. We are happy to work with you to make your time in CS 240 most effective and rewarding for you. ### Texts

Electronic options are available for all required sources. At least one physical copy of each text is also available in the physical SCI L037 CS Systems Lab **for use within the CS department area.**Please use them in the data lab area and return them to the shelf when you are done.

**We use one primary textbook extensively:**

- **CSAPP 3e** ([*Wellesley online access*](https://drive.google.com/drive/folders/1eFNJ7GqAHH8_W4dNv0UC4qkZX-kEMQH_?usp=sharing)):   
    [*Computer Systems: A Programmer’s Perspective, 3/E*](http://csapp.cs.cmu.edu). (**3rd edition**, significant changes since 2nd)   
    Bryant and O’Hallaron, Pearson, 2016. ISBN-13: 9780134092669. 
    - We **need the 3rd edition**. See [the errata](http://csapp.cs.cmu.edu/3e/errata.html).
    - Unfortunately, the library is not able to acquire an electronic version, but there are several options to access the book, including, but not limited to: 
        - If you prefer physical books, paperback copies are available for much less than the hardcover version. “Global” 3rd editions mostly work, but have some additional errors (not listed on the errata page).
        - [6 months of access to an electronic version is available for $35.](https://www.vitalsource.com/products/computer-systems-a-programmer-39-s-perspective-randal-e-bryant-david-r-v9780134092997)
        - During difficult pandemic circumstances, [we have scans of the relevant excerpts available for CS 240 students (Wellesley ONLY)](https://drive.google.com/drive/folders/1eFNJ7GqAHH8_W4dNv0UC4qkZX-kEMQH_?usp=sharing). Being scans, these excerpts are not quite as good quality as some other electronic or paper options.
    - Please contact the instructors if none of the available options work for you.

**Other textbooks are used during the first part of the course:**

- **DDCA** ([*Wellesley online access*](https://ebookcentral.proquest.com/lib/well/detail.action?docID=404196)):   
    [*Digital Design and Computer Architecture*](https://ebookcentral.proquest.com/lib/well/detail.action?docID=404196).   
    Harris and Harris, Morgan Kaufmann, 2007. 
    - [The library has an electronic version of this text](https://ebookcentral.proquest.com/lib/well/detail.action?docID=404196)

**We recommend a good reference on the C programming language.**Here are a couple solid options:

- **[Essential C](http://cslibrary.stanford.edu/101/)** (PDF)  
    Nick Parlante, 2003. Stanford University.
- **K&amp;R:**  
    [*The C Programming Language, 2nd edition*](http://luna.wellesley.edu/record=b1630956~s1).   
    Kernighan and Ritchie, Prentice Hall, 1988. ISBN-13: 978-0131103627, ISBN-10: 0131103628.

**Additional materials** will be posted directly on the [course website](/~cs240/s23/).

CS 240 Foundations of Computer Systems

Computer Systems

Radiometry

Rendering Equation

Monte Carlo Integration

Path tracing

Uniform Hemisphere Sampling

Russian Roulette

Bidirectional reflectance distribution function (BRDF)

Ideal Specular Reflection

Refraction

Direct Lighting

Tone Mapping

Advanced Sampling

Advanced Materials

Light Transport Algorithms

Polygon mesh

Geometry Processing

Subdivision surface

Mesh Simplification

Remeshing

Image Filtering

Geometry Representations

Physically based animation (simulation)

Continuum Mechanics

Finite Element Method (FEM)

Optimization in Graphics

Linear Solvers

ARAP (As-Rigid-As-Possible surface modeling)

CSCI 2240: Advanced Computer Graphics Brown University Spring 2023 CSCI 2240 is a comprehensive exploration of 3D graphics, diving into rendering, geometry processing, simulation, and optimization. Expect a mathematically intensive approach to topics such as light transport physics, 3D triangle mesh algorithms, and 3D shape optimization. Culminating in an open-ended project, students will be equipped to undertake graphics research and delve into recent research papers.  CSCI 2240 is an advanced computer graphics course. It assumes prior experience with the fundamentals of computer graphics, typically by having completed an introductory computer graphics course. The course explores several key areas of 3D graphics---rendering, geometry processing, simulation, and optimization---taking a mathematically-sophisticated approach to each. We will study computational approximations to the physics of light transport and the motion of deformable objects, algorithms for processing 3D triangle meshes, and optimization-based techniques for manipulating 3D shapes. The course culminates with an open-ended, group final project in which students choose a recent research paper of interest and implement the techniques it describes.

[Past Projects](https://cs2240.graphics/past_projects.html) Students who complete this course will:

- Understand the physics of light transport and be able to implement approximate solutions to the rendering equation.
- Understand the strengths and weakness of different geometry representations and be able to build efficient algorithms for processing and manipulating meshes.
- Know how to pose graphics problems as quadratic optimization problems and solve the resulting sparse linear systems.
- Understand the continuum mechanics governing the motion of solid objects and be able to simulate them through finite element approximations.
- Build depth of knowledge in one area of computer graphics by completing an open-ended final project.
- Be able to read technical papers in the graphics literature and implement the algorithms they describe.

More holistically: completing this course will take you from "I know the fundamentals of computer graphics" to "I can read and implement graphics research papers and contribute to new graphics research." Students who complete this course will be well-prepared to begin an academic research career in computer graphics or to join an industrial research and development lab.

Accordingly, this course is challenging. On your journey to becoming an independent graphics researcher/practitioner, expect to be pushed out of your comfort zone. It is totally normal to struggle with some assignments in this course (to which the TAs can attest). If you feel stuck, remember: we're here for you! Take advantage of office hours and ask for help from your fellow students on Slack.  The following skills will be necessary for this course:

- **Computer Graphics:** This course assumes familiarity with the fundamentals of computer graphics, such as 3D transformations, viewing and projection, basic illumination models, raytracing, and OpenGL. Brown's introductory computer graphics course, [CSCI 1230](https://cs.brown.edu/courses/info/csci1230), is a prerequisite for this course. Similar courses from other institutions may also be acceptable.
- **Software Engineering:** The assignments in this course, and particularly the final project, require you to design, develop, and debug large pieces of software. The project work required for CSCI 1230 should be sufficient preparation. If you took an introductory graphics course elsewhere that did not emphasize large software projects, you should have experience with building such projects from other courses.
- **Math:** The techniques we will explore in this course are based on physics concepts, involve geometric calculations in three-space, and/or require solving large systems of equations. Familiarity with linear algebra and vector calculus are important for successfully understanding and applying these techniques.
 
 If you are not sure whether you can/should take the course, we encourage you to show up to the first class and talk to the instructor.  There is no required textbook this semester. Readings relevant to each course assignment will be posted on this website. Optionally, you might consider purchasing [The Graphics Codex](http://graphicscodex.com/), which costs only $10 and provides reference materials which can be useful for the first part of the course (on rendering).

CSCI 2240: Advanced Computer Graphics

Computer Graphics

Hypertext

Hyperlink

Hypertext Forerunners

Annotation

Text Processing

Digital Hypertext Pioneers

World Wide Web

Temporal Media

Zettelkasten Method

Notetaking Systems

Search/Filtering/Viewspecs in Hypertext Systems

Metaverse as Hypermedia

Collaborative Systems

Semantic Web

Internet Architecture and Functioning

Addressing & Permanence in Hypertext Systems

Transfer, Exchange, and Storage of Hypertext Systems

Societal Implications of Hypertext Systems

Tracking of Individuals

Surveillance Capitalism

CS1951V Hypertext/Hypermedia Brown University Fall 2022 CS1951-V dives deep into the history and potential future of hypertext systems, providing insights beyond the World Wide Web. Through hands-on projects, students not only learn about hypertext but also gain expertise in full-stack application development using the modern MERN stack. The course blends technical skills with discussions, pushing students to prototype future hypermedia systems. CSCI1951-V, “Hypertext/Hypermedia: The Web Was Not the Beginning and the Web Is Not the End,” looks at hypertext systems that came before and after the World Wide Web as a basis for discussing what next generation hypertext systems could look like. Students will be doing writing assignments, reading, annotating, and writing technical papers, participating in in-class brainstorming sessions, discussing materials in a roundtable format, and developing software prototypes with Javascript and the state-of-the-art MERN (MongoDB, Express, React and Node.js) stack. Students will learn not only about hypertext, but will use that knowledge to develop full-stack applications using modern technologies and high-level software architectures as they prototype systems of the future. The course will be capped at 35 students to facilitate participation and discussion.  - Understand...
    - ...the foundations of the ubiquitous computing environment you have grown up with
    - ...the scope of hypermedia systems – from personal information manager to full multi-user, local to global
    - ...the features from early systems/research...
        - ...that have made it into today’s environment
        - ...that have not made it into today’s environment and why not?
    - ...the technical/architectural issues of hypermedia systems and…
        - ...how they have evolved over the years,
        - ...how some old assumptions have held back improvements for the future,  
        - ...how current technology can drive those improvements.
    - ...tradeoffs - state-of-technology, time vs. features vs. quality, etc. – what is/was the right choice?
    - ...the applications of hypertext
    - ...the societal implications of hypertext systems
- Learn...
    - ...to do a critical analysis of technical papers
    - ...to do comparisons of systems
    - ...to create crisp summaries and presentations of research and projects/products
    - ... to use the MERN stack
- Build...
    - ...a hypertext “corpus” using Dash, a modern hypermedia system being developed in Prof. van Dam’s research group 
    - ...a hypertext system as a group project
 This is a course for undergraduates and graduate students with CS systems background, object-oriented design and programming knowledge, and software architecture and development experience. Students must have taken at least an introductory CS sequence or equivalent, and preference will be given to those who have taken additional relevant systems courses or who have had significant experience in software development through jobs or internships. Experience with Javascript or Typescript and full-stack development is not required but is a plus. Interest in reading journal articles and papers, and writing, commenting, and presenting on those readings is essential.  

CS1951V Hypertext/Hypermedia

Interdisciplinary

Hardware

Safety

Linux

Networking

Middleware

Sensors

Inertial measurement unit (IMU)

Time-of-flight (ToF) camera

Camera

Measuring Velocity and Position

Proportional–integral–derivative (PID) controller

Kalman Filtering

Uncertainty

Simultaneous Localization and Mapping (SLAM)

CS1951R Introduction to Robotics Brown University Fall 2023 This course offers students the opportunity to build and program an autonomous drone. Focusing primarily on autonomous drones, the course provides a broader insight into modern robotics, encompassing autonomous ground vehicles and robotic arms. Topics include safety, networking, controls, state estimation, and high-level planning. By the end, students can design, build, and operate a robotic drone. The aim of this course is to empower people to build robots. Students will build, program, and fly an autonomous drone. We will cover everything needed to program an autonomous robot, including safety, networking, state estimation, controls, and high-level planning. Although the course focuses on an autonomous drone, we will provide a broad overview of modern robotics, including some topics relating to autonomous ground vehicles and robotic arms. Each student will build and program their own small quadcopter. The course will provide basic components and a small number of replacement parts. After taking this course, students will be able to:

- Explain the space of designs for robotic communications, safety, state estimation, and control.
- Apply that knowledge to construct programs for communications, safety, state estimation, and control.
- Build, program, and operate an autonomous robot drone.
  The class textbook can be found online at [Duckiesky Learning Materials](https://docs.duckietown.org/daffy/doc-sky/out/index.html). Each assignment or project is a link to a specific chapter in this textbook and has corresponding lectures in the edX Edge course.

CS1951R Introduction to Robotics

Robotics

Security Principles

Symmetric-key Cryptography

One-time pad

Hash functions

Block cipher

Stream ciphers

Public-key cryptography

Digital signature

Message authentication code (MAC)

Authentication

Authorization

Accounting

Web Security Model

Browser Security

Web Technologies

Web Protocols

Session Management

Same-Origin Policy

Cross-Site Request Forgery (CSRF)

SQL Injection

Cross-Site Scripting (XSS)

Operating System Security

Passwords

OS Isolation

Malware

OS Privileges

Cloud Security

Storage Encryption

Networks

DNS (Domain Name System)

Denial-of-service attack (DoS attack)

Transport Protocols

Transport Layer Security (TLS)

Certificates

Firewalls

Scanning

Physical Security

CS1660: Computer Systems Security Brown University Spring 2022 CS1660 delivers a balanced mix of theory and practice in computer systems security. Starting with the foundational aspects of cryptography, the course navigates through security aspects of web applications, operating systems, and networks. Students will hone their "security mindset," learning to identify vulnerabilities and understand defenses across different domains. CS1660 (formerly called CS166) is a course on **computer systems security** through a balanced mixture of theory and practice.

We’ll start out with building the foundations of security through an exploration of **cryptography**. From there, we’ll move to more complex, multi-faceted systems such as **web applications**, **operating systems**, and **networks**. Along the way, we’ll explore complementary topics such as authentication, physical security, social engineering, privacy, anonymity, usability, and the security of emergent systems such as blockchains and machine learning.

By learning about security through these multiple domains, you’ll concretely learn how various classes of attacks appear in a vast variety of scenarios and how they work in practice. You’ll also learn how to evaluate systems adversarially, from writing precise security analyses about subtle issues in protocols to discovering and exploiting vulnerabilities in concrete technical systems for yourself.

Through all of these activities, you’ll ultimately work to develop a specific kind of intuition—a ***“security mindset”***—that will give you the knowledge, vocabulary, and confidence to critically analyze and effectively defend the software and systems you approach as a computer scientist even after the course. - Provide an introduction to computer security
    - Overview security threats and defenses
- Help you develop a security-aware mindset:
    - Take the big picture and understand the details
- Learning by practicing
    - Consider ethical implications and tradeoffs of using, building, and testing secure systems You should have an intro-sequence’s worth of programming experience ([0160](https://cs.brown.edu/courses/info/csci0160/), [0180](https://cs.brown.edu/courses/info/csci0180/), or [0190](https://cs.brown.edu/courses/info/csci0190/)) and have a good understanding of systems programming ([0300](https://cs.brown.edu/courses/info/csci0300/), [0330](https://cs.brown.edu/courses/info/csci0330/), [1310](https://cs.brown.edu/courses/info/csci1310/), or [1330](https://cs.brown.edu/courses/info/csci1330/)). This concretely means that:

- You should be comfortable writing programs and scripts in the language of your choice (such as Python, Ruby, Bash, Go, C++, etc.), be comfortable in a Unix command-line environment (running binaries, filesystem navigation, etc.) and using SSH with the Brown CS filesystem, have a basic understanding of systems programming concepts such as memory management and networking.
- You also should have heard of the terms “race condition”, “packet”, “TCP”, “UDP”, “buffer overflows”, and “DNS”. (If you forget what these are, don’t worry—we’ll describe them again when they come up in the latter half of the course.)
- You should also be at least somewhat comfortable (and very willing) to learn new programming languages and reading code in languages and programs that you’ve never used before. (You’ll get lots of practice with this in this course!)
 
*If you don’t meet the official prerequisites* but still want to take the course, please feel free to ask the instructors–we are happy to discuss your individual situation to determine if the course is right for you!

Your willingness to challenge yourself is perhaps the most important prerequsite for the course. Security can be frustrating at times, but the rewards are great. In exchange for engaging with some difficult intellectual challenges, you’ll have the opportunity to gain concrete insights about systems and security and become a better computer scientist along the way! 

CS1660: Computer Systems Security

Computer Security and Cryptography

Interrupts

Input/output

Booting

Unix

Operating System Structure

Virtual Machine (VM)

Operating System Design

Microkernels

Scheduling (computing)

File system

Communication protocol

Remote Procedure Call (RPC)

Distributed File Systems

Avoiding Operating Systems

CS167 Operating Systems Brown University Spring 2023 CS167 offers comprehensive insights into the principles and intricacies of operating systems. Topics range from multithreaded programming to file system designs. Students will not only grasp theoretical knowledge but also get hands-on experience, particularly through the optional lab CS169, where they can develop an operating system called Weenix. In this class, you'll have the opportunity to learn both the overarching principles of operating systems as well as the intricacies of how they work.

We'll cover topics including multithreaded programming; managing threads, interrupts, and storage; processor scheduling; operating system structure; virtualization; security; and the design of both local and distributed file systems. You'll develop your skill as a C programmer while simultaneously learning what goes on inside your computer from the moment you power it on.

As part of the class, if you are enrolled in CS167, you may choose to take the (optional) half-credit lab, CS169. If you do so, you will attend the same lectures and complete the written assignments as usual. However, you will only complete the first two programming assignments from CS167, before embarking on an in-depth project wherein you build much of the functionality of a small operating system called Weenix. It is a significant time investment, and you'll still get a lot from the class if you don't take the lab. Some thoughts on taking CS169 from previous students can be found [here](). CS267 covers the material of both CS167 and 169; it is for graduate students only. ### The Course

- Implement threads
- Learn about operating systems
- Implement one (Weenix)
    - file-system-related components (1670)
    - most of the rest of it (1690, 2670) ### Skills Needed

- Ability to write and debug largish programs in C with POSIX threads
    - CSCI 330/1330 or CSCI 300/1310 (you may want to review POSIX threads material from 330 lectures)
- Basic computer architecture
    - CSCI 330/1330 or CSCI 300/1310 ### Workload Components

- Four moderate programming assignments
    - UThreads: simple user-level threads package
    - MThreads: more sophisticated user-level threads package
    - VFS: system calls and high-level file system
    - S5FS: low-level file system
- One large programming assignment: Weenix
- combines VFS and S5FS, as well as Processes, Drivers, and Virtual Memory
- Four homeworks
- In-class TopHat questions

### Textbook

Operating Systems In Depth: Design and Programming, 1st Edition

CS167 Operating Systems

Operating Systems

Randomized Algorithms

Large Deviation Bounds

Packet Routing

Sample Complexity

Martingales

Rademacher complexity

Probabilistic Method

Hashing

Markov Chains

Monte Carlo method

CSCI 1550/2450 Probabilistic Methods in Computer Science Brown University Spring 2022 This analytical course dives into the mathematical underpinnings of computing successes like machine learning and cryptography, emphasizing the role of probability, randomness, and statistics. Students will explore mathematical models, theorems, and proofs. Practical implementations are not covered, focusing instead on the theories driving computational probabilities. CSCI 1550/2450 is a course on the mathematics that motivates, formulates, and explains many of the great successes of computing, including statistical machine learning, Monte Carlo methods, and modern cryptography. Probability, randomness, and statistics play a key role in these and almost any other modern computer science application. This course introduces the novel mathematical and computation methods that were developed at the interplay of probability and computing. The course focuses on mathematical models, theorems and proofs, and leaves implementation and experiments to other courses. - CSCI 1550/2540 is a theory/analytical course - analysis, theorems, no implementations.
- The course covers modern mathematics at the interface of probability theory and computation
- Formulates, and explains many of the great successes of computing, such as machine learning, cryptography, modern finance, computational biology, etc.
- This course focuses on tools, not particular applications. CS145 or equivalent (first three chapters in the course textbook). ## Textbook

The textbook for the course is *[Probability and Computing Randomization and Probabilistic Techniques in Algorithms and Data Analysis, 2nd Edition](https://www.amazon.com/Probability-Computing-Randomization-Probabilistic-Techniques/dp/110715488X/ref=dp_ob_title_bk)* by [Michael Mitzenmacher](http://www.eecs.harvard.edu/%7Emichaelm/) and [Eli Upfal](/people/eli).

[Errata for the 1st Printing](http://www.eecs.harvard.edu/%7Emichaelm/MUErrataPrint1.pdf), [Errata for the 2nd Printing](http://www.eecs.harvard.edu/%7Emichaelm/MUErrataPrint2.pdf)

CSCI 1550/2450 Probabilistic Methods in Computer Science

Mathematical Foundations

Cryptography

Computational assumptions

Symmetric-key encryption

RSA (cryptosystem)

Shannon's Theorem

Computational security

ElGamal public key encryption

Diffie-Hellman key exchange

Message integrity

DSA signature schemes

Authenticated encryption

Collision-resistant hash functions

Birthday attack

Random oracle model

Secure Hash Algorithm (SHA)

Hash-based Message Authentication Code (HMAC)

HKDF

Hash-and-Sign paradigm

Pseudorandom generator (PRG)

Pseudorandom function/permutation (PRF/PRP)

Modes of operation

CBC-MAC

Secure shell protocol (SSH)

Public key infrastructure (PKI)

Password-based authentication

Two-factor authentication

Secure authentication

Single Sign-On (SSO) authentication

Zero-knowledge proof

Diffie-Hellman tuple

Proof of knowledge

Schnorr's identification protocol

Sigma protocol

Non-interactive zero-knowledge (NIZK) proof

 CSCI 1515 Applied Cryptography Brown University Spring 2023 Applied Cryptography at Brown University offers a practical take on securing systems. By learning foundational cryptographic algorithms and advanced topics like zero-knowledge proofs and post-quantum cryptography, students gain both theoretical insights and hands-on experience in implementing cryptosystems using C++ and crypto libraries. Label: State-of-art concepts. ### Welcome to Applied Cryptography (CSCI 1515) at Brown!

This course teaches cryptography from a practical perspective and provides hands-on experience in building secure systems.

We first introduce foundational cryptographic algorithms including secret-key and public-key encryption schemes, message authentication codes, digital signatures, and hash functions, from which you will build secure communication and authentication systems.

More advanced topics that are covered include zero-knowledge proofs, secure multi-party computation, fully homomorphic encryption, post-quantum cryptography, and differential privacy. You will learn how these cryptographic techniques can be used to develop more advanced applications such as secure online anonymous voting, secure computation, and private information retrieval.

Besides the high-level design of these cryptosystems, you will also get hands-on experience implementing them using tools from the existing crypto libraries written in C++.    ## Textbooks

- [MOV] [Handbook of Applied Cryptography](https://cacr.uwaterloo.ca/hac/) by Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone
- [BS] [A Graduate Course in Applied Cryptography](http://toc.cryptobook.us/book.pdf) by Dan Boneh and Victor Shoup
- [KL] [Introduction to Cryptography](https://eclass.uniwa.gr/modules/document/file.php/CSCYB105/Reading%20Material/%5BJonathan_Katz%2C_Yehuda_Lindell%5D_Introduction_to_Mo%282nd%29.pdf) by Jonathan Katz and Yehuda Lindell
- [R] [The Joy of Cryptography](https://joyofcryptography.com/pdf/book.pdf) by Mike Rosulek

 CSCI 1515 Applied Cryptography

Explore courses