Arithmetic Circuits Courses and Certifications

NPTEL;  IIT Madras

Digital Circuits and Systems

5 reviews

Explore digital circuits and systems with NPTEL's 35-hour program. Learn about combinational logic, logic minimization, arithmetic circuits, sequential circuits, state machines, and system design.

• YouTube
• 1 day 11 hours
• On-Demand
• Free Online Course

NPTEL;  IIT Kharagpur

Digital Electronic Circuits

1 review

Digital systems represent and manipulate digital signals. Such signals represent only finite number of discreet values. A signal can be discreet by nature whereas, a continuous signal can be discretized for digital processing and then converted back.

• YouTube
• 1 day 7 hours
• On-Demand
• Free Online Course

NPTEL;  IIT Kharagpur

Digital Circuits

Dive into digital circuits with NPTEL's 31-hour program. Learn about number systems, Boolean algebra, logic gates, arithmetic circuits, decoders, multiplexers, sequential circuits, and more.

• YouTube
• 1 day 7 hours
• On-Demand
• Free Online Course

Simons Institute

New Ways to Garble Arithmetic Circuits

Explore new methods to garble arithmetic circuits with Simons Institute's under 1-hour material. Improve efficiency, modularity, and functionality in cryptography.

• YouTube
• 51 minutes
• On-Demand
• Free Online Course

TheIACR

Sub Linear Lattice Based Zero Knowledge Arguments for Arithmetic Circuits

Dive into Sub Linear Lattice Based Zero Knowledge Arguments for Arithmetic Circuits in less than an hour with TheIACR's material, originally presented at Crypto 2018.

• YouTube
• 20 minutes
• On-Demand
• Conference Talk

TheIACR

On the Untapped Potential of Encoding Predicates by Arithmetic Circuits and Their Applications

Explore the potential of encoding predicates by arithmetic circuits with Shuichi Katsumata's paper, presented at Asiacrypt 2017 by TheIACR. Less than 1-hour workload.

• YouTube
• 22 minutes
• On-Demand
• Conference Talk

Simons Institute

Lower Bounds for Tractable Arithmetic Circuits

Explore the complexities of tractable arithmetic circuits with Alexis de Colnet at Simons Institute. Learn techniques to prove lower bounds in less than an hour.

• YouTube
• 43 minutes
• On-Demand
• Free Online Course

Simons Institute

Tractable Bounding of Counterfactual Queries by Knowledge Compilation

Learn to bound partially identifiable queries in structural causal models with Simons Institute. Gain inferential speed-up through knowledge compilation and parallelisation techniques.

• YouTube
• 34 minutes
• On-Demand
• Free Online Course

Simons Institute

Homomorphic Encryption in the SPDZ Protocol for MPC

Explore the SPDZ protocol for MPC with Peter Scholl from Aarhus University. Learn about homomorphic encryption, secure multi-party computation, and zero-knowledge proofs in less than an hour.

• YouTube
• 54 minutes
• On-Demand
• Free Online Course

Simons Institute

Tractable Learning in Structured Probability Spaces

Explore structured probability spaces with UCLA's Adnan Darwiche in this under 1-hour material from Simons Institute. Learn about logical inference, learning algorithms, and more.

• YouTube
• 40 minutes
• On-Demand
• Free Online Course

Paul G. Allen School

ITC Conference - Line Point Zero Knowledge and Its Applications

Explore the applications of Line Point Zero Knowledge in this under 1-hour offering from Paul G. Allen School. Learn about vector oblivious linear evaluation, reusable non-interactive secure computation, and more.

• YouTube
• 24 minutes
• On-Demand
• Free Online Course

TheIACR

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application

Explore efficient zero-knowledge arguments for arithmetic circuits with TheIACR. Less than 1-hour study includes MPC approaches, applications, and experimental results.

• YouTube
• 28 minutes
• On-Demand
• Free Online Course

TheIACR

Boosting Verifiable Computation on Encrypted Data

Explore verifiable computation on encrypted data with TheIACR's online material. Learn about homomorphic encryption, SNARKS, and polynomial commitments in under an hour.

• YouTube
• 21 minutes
• On-Demand
• Free Online Course

IEEE

Wolverine - Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits

Explore fast, scalable, and efficient zero-knowledge proofs for Boolean and Arithmetic circuits in less than an hour with this IEEE presentation.

• YouTube
• 15 minutes
• On-Demand
• Conference Talk

Sistemas Digitales: De las puertas lógicas al procesador

243 ratings at Coursera

Learn the fundamentals of digital circuit design and complex digital systems in this practical course from Universitat Autònoma de Barcelona. Ideal for engineering students and those interested in digital systems. No certificate option available.

• Coursera
• 1 day 18 hours 38 minutes
• On-Demand
• Free Online Course (Audit)