Arithmetic Circuits Courses and Certifications

Simons Institute

Lower Bounds for Tractable Arithmetic Circuits

Explores techniques for proving size lower bounds on tractable arithmetic circuits, focusing on structural restrictions and their impact on circuit complexity in probabilistic reasoning.

• YouTube
• 43 minutes
• On-Demand
• Free Video

NPTEL-NOC IITM

Ripple Carry Adder: Design, Delay, and Area Analysis

Learn about ripple carry adders, including their design, delay analysis, and area considerations in digital circuit implementation.

• YouTube
• 13 minutes
• On-Demand
• Free Video

NPTEL;  IIT Madras

Digital Circuits and Systems

9 reviews

Comprehensive exploration of digital circuits, from basic logic to advanced systems. Covers combinational and sequential circuits, arithmetic operations, state machines, and programmable logic devices.

• YouTube
• 1 day 11 hours
• On-Demand
• Free Video

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 Video

NPTEL;  IIT Kharagpur

Digital Circuits

Comprehensive exploration of digital circuits, covering number systems, Boolean algebra, logic gates, arithmetic circuits, sequential circuits, finite state machines, data converters, memory, FPGA, VHDL, and microprocessors.

• YouTube
• 1 day 7 hours
• On-Demand
• Free Video

IIT Kharagpur;  NPTEL

Digital Circuits

Comprehensive exploration of digital circuit fundamentals, covering number systems, combinational and sequential design, data converters, memories, and microprocessors, with a focus on GATE syllabus for ECE.

• Swayam
• 12 weeks
• On-Demand
• Free Online Course

IIT Ropar;  NPTEL

Digital System Design

Learn digital system design from scratch, covering combinational and sequential building blocks, Verilog modeling, and practical applications in VLSI. Gain skills for designing complex digital systems.

• Swayam
• 12 weeks
• On-Demand
• Free Online Course

IEEE

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

Explore fast, scalable zero-knowledge proofs for Boolean and arithmetic circuits, covering applications, existing systems, tradeoffs, and innovative protocols like SVLE and Cotton Bucketing.

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

TheIACR

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

Explore efficient zero-knowledge arguments for arithmetic circuits, their applications, and novel approaches to MPC-in-the-head protocols, with a focus on improving performance and reducing communication costs.

• YouTube
• 28 minutes
• On-Demand
• Free Video

TheIACR

Boosting Verifiable Computation on Encrypted Data

Explore verifiable computation on encrypted data, covering homomorphic encryption, SNARKs, and polynomial commitments for secure and private delegation of computation.

• YouTube
• 21 minutes
• On-Demand
• Free Video

Simons Institute

Homomorphic Encryption in the SPDZ Protocol for MPC

Explore homomorphic encryption in SPDZ protocol for secure multi-party computation, covering threshold encryption, distributed decryption, and zero-knowledge proofs for improved security and efficiency.

• YouTube
• 54 minutes
• On-Demand
• Free Video

Simons Institute

Tractable Learning in Structured Probability Spaces

Explore tractable learning in structured probability spaces, focusing on logical circuits, probabilistic inference, and learning algorithms for complex datasets with constraints.

• YouTube
• 40 minutes
• On-Demand
• Free Video

Simons Institute

New Ways to Garble Arithmetic Circuits

Explores innovative techniques for garbling arithmetic circuits, improving efficiency, modularity, and functionality. Presents constant-rate schemes for large integers and modular computation, with enhanced capabilities for mixed arithmetic-Boolean opera…

• YouTube
• 51 minutes
• On-Demand
• Free Video

Paul G. Allen School

ITC Conference - Line Point Zero Knowledge and Its Applications

Explore line-point zero knowledge proofs, their efficiency in arithmetic circuit satisfiability, and applications in non-interactive secure computation and vector oblivious linear evaluation.

• YouTube
• 24 minutes
• On-Demand
• Free Video

TheIACR

Sub Linear Lattice Based Zero Knowledge Arguments for Arithmetic Circuits

Explore cutting-edge cryptographic techniques for zero-knowledge proofs in arithmetic circuits, focusing on sub-linear lattice-based approaches presented at Crypto 2018.

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