introduction
play

Introduction Marijn J.H. Heule Warren A. Hunt Jr. The University - PowerPoint PPT Presentation

Apr 14, 2023 •333 likes •736 views

Introduction Marijn J.H. Heule Warren A. Hunt Jr. The University of Texas at Austin Heule & Hunt (UT Austin) Introduction 1 / 28 Motivation satisfiability solving From 100 variables, 200 clauses (early 90s) to 1,000,000 vars. and

  1. Introduction Marijn J.H. Heule Warren A. Hunt Jr. The University of Texas at Austin Heule & Hunt (UT Austin) Introduction 1 / 28

  2. Motivation satisfiability solving From 100 variables, 200 clauses (early 90’s) to 1,000,000 vars. and 5,000,000 clauses in 15 years. Heule & Hunt (UT Austin) Introduction 2 / 28

  3. Motivation satisfiability solving From 100 variables, 200 clauses (early 90’s) to 1,000,000 vars. and 5,000,000 clauses in 15 years. Applications: Hardware and Software Verification, Planning, Scheduling, Optimal Control, Protocol Design, Routing, Combinatorial problems, Equivalence Checking, etc. Heule & Hunt (UT Austin) Introduction 2 / 28

  4. Motivation satisfiability solving From 100 variables, 200 clauses (early 90’s) to 1,000,000 vars. and 5,000,000 clauses in 15 years. Applications: Hardware and Software Verification, Planning, Scheduling, Optimal Control, Protocol Design, Routing, Combinatorial problems, Equivalence Checking, etc. SAT used to solve many other problems! Heule & Hunt (UT Austin) Introduction 2 / 28

  5. Overview Introduction The Satisfiability problem Terminology SAT solving SAT benchmarks Heule & Hunt (UT Austin) Introduction 3 / 28

  6. Introduction ”You are chief of protocol for the embassy ball. The crown prince instructs you either to invite Peru or to exclude Qatar . The queen asks you to invite either Qatar or Romania or both. The king, in a spiteful mood, wants to snub either Romania or Peru or both. Is there a guest list that will satisfy the whims of the entire royal family?” Heule & Hunt (UT Austin) Introduction 4 / 28

  7. Introduction ”You are chief of protocol for the embassy ball. The crown prince instructs you either to invite Peru or to exclude Qatar . The queen asks you to invite either Qatar or Romania or both. The king, in a spiteful mood, wants to snub either Romania or Peru or both. Is there a guest list that will satisfy the whims of the entire royal family?” ( P ∨ ¬ Q ) ∧ ( Q ∨ R ) ∧ ( ¬ R ∨ ¬ P ) Heule & Hunt (UT Austin) Introduction 4 / 28

  8. Truth Table F := ( P ∨ ¬ Q ) ∧ ( Q ∨ R ) ∧ ( ¬ R ∨ ¬ P ) falsifies ϕ ◦ F P Q R ( Q ∨ R ) 0 0 0 0 0 0 1 — 1 ( P ∨ ¬ Q ) 0 1 0 0 ( P ∨ ¬ Q ) 0 1 1 0 1 0 0 ( Q ∨ R ) 0 1 0 1 ( ¬ R ∨ ¬ P ) 0 1 1 0 — 1 1 1 1 ( ¬ R ∨ ¬ P ) 0 Heule & Hunt (UT Austin) Introduction 5 / 28

  9. Slightly Harder Example What are the solutions for the following formula? ( A ∨ B ∨ ¬ C ) ( ¬ A ∨ ¬ B ∨ C ) ( B ∨ C ∨ ¬ D ) ( ¬ B ∨ ¬ C ∨ D ) ( A ∨ C ∨ D ) ( ¬ A ∨ ¬ C ∨ ¬ D ) ( ¬ A ∨ B ∨ D ) Heule & Hunt (UT Austin) Introduction 6 / 28

  10. Slightly Harder Example What are the solutions for the following formula? A B C D A B C D ( A ∨ B ∨ ¬ C ) 0 0 0 0 1 0 0 0 ( ¬ A ∨ ¬ B ∨ C ) 0 0 0 1 1 0 0 1 ( B ∨ C ∨ ¬ D ) 0 0 1 0 1 0 1 0 ( ¬ B ∨ ¬ C ∨ D ) 0 0 1 1 1 0 1 1 ( A ∨ C ∨ D ) 0 1 0 0 1 1 0 0 ( ¬ A ∨ ¬ C ∨ ¬ D ) 0 1 0 1 1 1 0 1 ( ¬ A ∨ B ∨ D ) 0 1 1 0 1 1 1 0 0 1 1 1 1 1 1 1 Heule & Hunt (UT Austin) Introduction 6 / 28

  11. Introduction: Sat question Given a CNF formula , does there exist an assignment to the Boolean variables that satisfies all clauses ? Heule & Hunt (UT Austin) Introduction 7 / 28

  12. Terminology: Variables and literals Boolean variable can be assigned the Boolean values 0 or 1 Literal refers either to x i or its complement ¬ x i literals x i are satisfied if variable x i is assigned to 1 (true) literals ¬ x i are satisfied if variable x i is assigned to 0 (false) Heule & Hunt (UT Austin) Introduction 8 / 28

  13. Terminology: Clauses Clause Disjunction of literals: E.g. C j = ( l 1 ∨ l 2 ∨ l 3 ) Can be falsified with only one assignment to its literals: All literals assigned to false Can be satisfied with 2 k − 1 assignment to its k literals One special clause - the empty clause (denoted by ∅ ) - which is always falsified Heule & Hunt (UT Austin) Introduction 9 / 28

  14. Terminology: Formulae Formula Conjunction of clauses: E.g. F = C 1 ∧ C 2 ∧ C 3 Is satisfiable if there exists an assignment satisfying all clauses, otherwise unsatisfiable Formulae are defined in Conjunction Normal Form (CNF) and generally also stored as such - also learned information Heule & Hunt (UT Austin) Introduction 10 / 28

  15. Terminology: Assignments Assignment Mapping of the values 0 and 1 to the variables ϕ ◦ F results in a reduced formula F reduced : all satisfied clauses are removed all falsified literals are removed satisfying assignment ↔ F reduced is empty falsifying assignment ↔ F reduced contains ∅ partial assignment versus full assignment Heule & Hunt (UT Austin) Introduction 11 / 28

  16. Resolution Given two clauses C 1 = ( x ∨ a 1 ∨ · · · ∨ a n ) and C 2 = ( ¬ x ∨ b 1 ∨ · · · ∨ b m ), the resolvent of C 1 and C 2 (denoted by C 1 ⊲ ⊳ C 2 ) is R = ( a 1 ∨ · · ·∨ a n ∨ b 1 ∨ · · ·∨ b m ) Heule & Hunt (UT Austin) Introduction 12 / 28

  17. Resolution Given two clauses C 1 = ( x ∨ a 1 ∨ · · · ∨ a n ) and C 2 = ( ¬ x ∨ b 1 ∨ · · · ∨ b m ), the resolvent of C 1 and C 2 (denoted by C 1 ⊲ ⊳ C 2 ) is R = ( a 1 ∨ · · ·∨ a n ∨ b 1 ∨ · · ·∨ b m ) Examples for F := ( P ∨ ¬ Q ) ∧ ( Q ∨ R ) ∧ ( ¬ R ∨ ¬ P ) ( P ∨ ¬ Q ) ⊲ ⊳ ( Q ∨ R ) = ( P ∨ R ) ( P ∨ ¬ Q ) ⊲ ⊳ ( ¬ R ∨ ¬ P ) = ( ¬ Q ∨ ¬ R ) ( Q ∨ R ) ⊲ ⊳ ( ¬ R ∨ ¬ P ) = ( Q ∨ ¬ P ) Heule & Hunt (UT Austin) Introduction 12 / 28

  18. Resolution Given two clauses C 1 = ( x ∨ a 1 ∨ · · · ∨ a n ) and C 2 = ( ¬ x ∨ b 1 ∨ · · · ∨ b m ), the resolvent of C 1 and C 2 (denoted by C 1 ⊲ ⊳ C 2 ) is R = ( a 1 ∨ · · ·∨ a n ∨ b 1 ∨ · · ·∨ b m ) Examples for F := ( P ∨ ¬ Q ) ∧ ( Q ∨ R ) ∧ ( ¬ R ∨ ¬ P ) ( P ∨ ¬ Q ) ⊲ ⊳ ( Q ∨ R ) = ( P ∨ R ) ( P ∨ ¬ Q ) ⊲ ⊳ ( ¬ R ∨ ¬ P ) = ( ¬ Q ∨ ¬ R ) ( Q ∨ R ) ⊲ ⊳ ( ¬ R ∨ ¬ P ) = ( Q ∨ ¬ P ) Resolution, i.e., adding resolvents until fixpoint, is a complete proof procedure. It produces the empty clause if and only if the formula is unsatisfiable Heule & Hunt (UT Austin) Introduction 12 / 28

  19. Tautology A clause C is a tautology if it contains for some variable x , both the literals x and ¬ x . Slightly Harder Example 2 Compute all non-tautological resolvents for: ( A ∨ B ∨ ¬ C ) ∧ ( ¬ A ∨ ¬ B ∨ C ) ∧ ( B ∨ C ∨ ¬ D ) ∧ ( ¬ B ∨ ¬ C ∨ D ) ∧ ( A ∨ C ∨ D ) ∧ ( ¬ A ∨ ¬ C ∨ ¬ D ) ∧ ( ¬ A ∨ B ∨ D ) Which resolvents remain after removing the supersets? Heule & Hunt (UT Austin) Introduction 13 / 28

  20. Sat solving: Unit propagation A unit clause is a clause of size 1 UnitPropagation ( ϕ, F ): 1: while ∅ / ∈ F and unit clause y exists do expand ϕ and simplify F 2: 3: end while 4: return ϕ, F Heule & Hunt (UT Austin) Introduction 14 / 28

  21. Unit propagation: Example F unit := ( ¬ x 1 ∨ ¬ x 3 ∨ x 4 ) ∧ ( ¬ x 1 ∨ ¬ x 2 ∨ x 3 ) ∧ ( ¬ x 1 ∨ x 2 ) ∧ ( x 1 ∨ x 3 ∨ x 6 ) ∧ ( ¬ x 1 ∨ x 4 ∨ ¬ x 5 ) ∧ ( x 1 ∨ ¬ x 6 ) ∧ ( x 4 ∨ x 5 ∨ x 6 ) ∧ ( x 5 ∨ ¬ x 6 ) Heule & Hunt (UT Austin) Introduction 15 / 28

  22. Unit propagation: Example F unit := ( ¬ x 1 ∨ ¬ x 3 ∨ x 4 ) ∧ ( ¬ x 1 ∨ ¬ x 2 ∨ x 3 ) ∧ ( ¬ x 1 ∨ x 2 ) ∧ ( x 1 ∨ x 3 ∨ x 6 ) ∧ ( ¬ x 1 ∨ x 4 ∨ ¬ x 5 ) ∧ ( x 1 ∨ ¬ x 6 ) ∧ ( x 4 ∨ x 5 ∨ x 6 ) ∧ ( x 5 ∨ ¬ x 6 ) ϕ = { x 1 =1 } Heule & Hunt (UT Austin) Introduction 15 / 28

  23. Unit propagation: Example F unit := ( ¬ x 1 ∨ ¬ x 3 ∨ x 4 ) ∧ ( ¬ x 1 ∨ ¬ x 2 ∨ x 3 ) ∧ ( ¬ x 1 ∨ x 2 ) ∧ ( x 1 ∨ x 3 ∨ x 6 ) ∧ ( ¬ x 1 ∨ x 4 ∨ ¬ x 5 ) ∧ ( x 1 ∨ ¬ x 6 ) ∧ ( x 4 ∨ x 5 ∨ x 6 ) ∧ ( x 5 ∨ ¬ x 6 ) ϕ = { x 1 =1 , x 2 =1 } Heule & Hunt (UT Austin) Introduction 15 / 28

  24. Unit propagation: Example F unit := ( ¬ x 1 ∨ ¬ x 3 ∨ x 4 ) ∧ ( ¬ x 1 ∨ ¬ x 2 ∨ x 3 ) ∧ ( ¬ x 1 ∨ x 2 ) ∧ ( x 1 ∨ x 3 ∨ x 6 ) ∧ ( ¬ x 1 ∨ x 4 ∨ ¬ x 5 ) ∧ ( x 1 ∨ ¬ x 6 ) ∧ ( x 4 ∨ x 5 ∨ x 6 ) ∧ ( x 5 ∨ ¬ x 6 ) ϕ = { x 1 =1 , x 2 =1 , x 3 =1 } Heule & Hunt (UT Austin) Introduction 15 / 28

  25. Unit propagation: Example F unit := ( ¬ x 1 ∨ ¬ x 3 ∨ x 4 ) ∧ ( ¬ x 1 ∨ ¬ x 2 ∨ x 3 ) ∧ ( ¬ x 1 ∨ x 2 ) ∧ ( x 1 ∨ x 3 ∨ x 6 ) ∧ ( ¬ x 1 ∨ x 4 ∨ ¬ x 5 ) ∧ ( x 1 ∨ ¬ x 6 ) ∧ ( x 4 ∨ x 5 ∨ x 6 ) ∧ ( x 5 ∨ ¬ x 6 ) ϕ = { x 1 =1 , x 2 =1 , x 3 =1 , x 4 =1 } Heule & Hunt (UT Austin) Introduction 15 / 28

  26. Sat solving: DPLL Davis Putnam Logemann Loveland [DP60,DLL62] Simplify (Unit Propagation) Split the formula Variable Selection Heuristics Direction heuristics Heule & Hunt (UT Austin) Introduction 16 / 28

  27. DPLL: Example F DPLL := ( x 1 ∨ x 2 ∨ ¬ x 3 ) ∧ ( ¬ x 1 ∨ x 2 ∨ x 3 ) ∧ ( ¬ x 1 ∨ ¬ x 2 ∨ x 3 ) ∧ ( x 1 ∨ x 3 ) ∧ ( ¬ x 1 ∨ ¬ x 3 ) Heule & Hunt (UT Austin) Introduction 17 / 28

  28. DPLL: Example F DPLL := ( x 1 ∨ x 2 ∨ ¬ x 3 ) ∧ ( ¬ x 1 ∨ x 2 ∨ x 3 ) ∧ ( ¬ x 1 ∨ ¬ x 2 ∨ x 3 ) ∧ ( x 1 ∨ x 3 ) ∧ ( ¬ x 1 ∨ ¬ x 3 ) x 3 1 0 Heule & Hunt (UT Austin) Introduction 17 / 28

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION

INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION

TRAINING COURSE ON SOCIAL PROTECTION & FORMALIZATION TRINIDAD AND TOBAGO MARCH 15, 2017 INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION Design of the NIS Assistance from the

547 views • 23 slides
INTRODUCTION Introduction 2/42 INTRODUCTION Alternations I am giving bread to the

INTRODUCTION Introduction 2/42 INTRODUCTION Alternations I am giving bread to the

Patterns of variation in the expression of case and agreement Andrs Brny Leiden University Centre for Linguistics 9 November 2019, BaSIS Workshop a.barany@hum.leidenuniv.nl INTRODUCTION Introduction 2/42 INTRODUCTION

1.37k views • 42 slides
Introduction Introduction Introduction Introduction Outline Motivation Failures

Introduction Introduction Introduction Introduction Outline Motivation Failures

Introduction Introduction Introduction Introduction Outline Motivation Failures Definition and concepts Process and product properties Principles SE Approaches Motivation Software and the economy The economies of

1.03k views • 49 slides
Introduction Introduction Introduction Nationwide Cause for Concern 1

Introduction Introduction Introduction Nationwide Cause for Concern 1

Introduction Introduction Introduction Nationwide Cause for Concern 1 https://www.cdc.gov/std/stats17/infographic.htm Introduction Epidemiology in Western Colorado CPHE Surveillance Data Report, May 2018 Chlamydia Epidemiology in Western

977 views • 39 slides
DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every

DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every

DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every meeting (2) Some ideas of diagrams for section 7.1 (Introduction) of TP. Giles Barr 25 Jan 2018, Pembroke College On DUNE, the reality is there is a

474 views • 10 slides
INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT

INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT

ADVANCED COMPUTER SECURITY INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT IS SECURITY? A systems security policies describe What the system is supposed to do Store and provide access

479 views • 16 slides
Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL

Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL

Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL Writing a SMIL file Adding Media Objects Martin Halvey Clipping media files January 2008 Timing and Synchronising Layout World Wide

387 views • 14 slides
14 Introduction Introduction Bad guys can put malware into Example: hosts

14 Introduction Introduction Bad guys can put malware into Example: hosts

Introduction Introduction source Encapsulation ISO/OSI reference model message M application segment H t H t M transport network datagram H n H n H t M presentation: allow applications to frame link H l H n H t M interpret

583 views • 4 slides
Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL

Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL

Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL Writing a SMIL file Adding Media Objects Martin Halvey Clipping media files January 2008 Timing and Synchronising Layout

322 views • 8 slides
Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL

Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL

Introduction Zynq Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL Processing System Processor Peripherals Data Buses AXI Bus Conclusion BTE5380 - Embedded Systems Octobre 2014 Andreas Habegger

1.81k views • 30 slides
2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04

2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04

2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04 Project References S E 5 PART.1 SMILE5 Introduction M I L Introduction STORION-SMILE5 Residential Energy Storage System Inverter 5kW Output Input

1.06k views • 25 slides
Introduction to CICS Course introduction Course introduction What is CICS? What is an

Introduction to CICS Course introduction Course introduction What is CICS? What is an

Introduction to CICS Course introduction Course introduction What is CICS? What is an application server? Why use an application server? Course introduction Services provided by CICS How CICS applications are defined Scaling CICS to meet

1.84k views • 146 slides
Network Visualization Introduction Presented by Shahed Introduction Introduction Basic

Network Visualization Introduction Presented by Shahed Introduction Introduction Basic

Network Visualization Introduction Presented by Shahed Introduction Introduction Basic building blocks Node Links (relationship between nodes) Spatial information Network data

584 views • 9 slides
Introduction Introduction (1) Main argument of the paper: universities are not only

Introduction Introduction (1) Main argument of the paper: universities are not only

Le jugement des pairs comme outil de management des universits Peer-review as a management tool Christine Musselin (CSO, Sciences Po et CNRS) Avril 2013, Lirrsistible ascension du capitalisme acadmique Introduction Introduction (1)

590 views • 28 slides
Introduction Introduction to storage and to storage and filesystems filesystems Introduction

Introduction Introduction to storage and to storage and filesystems filesystems Introduction

Moreno Baricevic Gilberto Daz Axel Kohlmeyer Stefano Cozzini ULA ICTP CNR-IOM DEMOCRITOS Merida, VENEZUELA Trieste, ITALY Trieste, ITALY Introduction Introduction to storage and to storage and filesystems filesystems Introduction

1.19k views • 51 slides
JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of

JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of

JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of the brand new JA-100 alarm system Visions Basic architecture System components Setting Help us with final validations You are the FIRST ones

1.69k views • 111 slides
B6.1 Introduction Heuristics Constraints Planning Explicit MDPs Probabilistic Factored MDPs

B6.1 Introduction Heuristics Constraints Planning Explicit MDPs Probabilistic Factored MDPs

Planning and Optimization B6. SAT Planning: Parallel Encoding Planning and Optimization B6.1 Introduction B6. SAT Planning: Parallel Encoding B6.2 Adapting the SAT Encoding Malte Helmert and Gabriele R oger Universit at Basel B6.3

66 views • 5 slides
Vigenre Cipher Like Csar cipher, but use a phrase Example Message THE BOY HAS THE

Vigenre Cipher Like Csar cipher, but use a phrase Example Message THE BOY HAS THE

Vigenre Cipher Like Csar cipher, but use a phrase Example Message THE BOY HAS THE BALL Key VIG Encipher using Csar cipher for each letter: key VIGVIGVIGVIGVIGV plain THEBOYHASTHEBALL cipher OPKWWECIYOPKWIRG May

304 views • 26 slides
CS 3000: Algorithms & Data Jonathan Ullman Lecture 19: Data Compression Greedy

CS 3000: Algorithms & Data Jonathan Ullman Lecture 19: Data Compression Greedy

CS 3000: Algorithms & Data Jonathan Ullman Lecture 19: Data Compression Greedy Algorithms: Huffman Codes Apr 5, 2018 Data Compression How do we store strings of text compactly? A binary code is a mapping from 0,1

652 views • 30 slides
Complexity of the hypercubic billiard Nicolas Bedaride Laboratoire dAnalyse Topologie

Complexity of the hypercubic billiard Nicolas Bedaride Laboratoire dAnalyse Topologie

Complexity of the hypercubic billiard Nicolas Bedaride Laboratoire dAnalyse Topologie Probabilits, Universit Paul Czanne. Complexity of the hypercubic billiard p.1/26 Complexity If v is an infinite word, we define the complexity

550 views • 31 slides
Bidirected edge-maximality of power graphs of finite cyclic groups Brian Curtin 1 Gholam Reza

Bidirected edge-maximality of power graphs of finite cyclic groups Brian Curtin 1 Gholam Reza

Bidirected edge-maximality of power graphs of finite cyclic groups Brian Curtin 1 Gholam Reza Pourgholi 2 1 Department of Mathematics and Statistics University of South Florida 2 School of Mathematics, Statistics and Computer Science University

1.02k views • 81 slides
POSIX I/O The fun stuff! Review from Lecture ssize_t read(int fd, void *buf, size_t count)

POSIX I/O The fun stuff! Review from Lecture ssize_t read(int fd, void *buf, size_t count)

POSIX I/O The fun stuff! Review from Lecture ssize_t read(int fd, void *buf, size_t count) result = -1 An error occurred errno = error result = 0 Already at EOF result < count Partial Read result == count Success! New Scenario -

693 views • 14 slides
CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 9: Convex Optimization Problems

CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 9: Convex Optimization Problems

CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 9: Convex Optimization Problems Instructor: Shaddin Dughmi Announcements Homework: Due beginning of next class Must submit a hard copy, unless you have a good excuse If using late

934 views • 62 slides
Protecting communications against forgery D. J. Bernstein University of Illinois at Chicago

Protecting communications against forgery D. J. Bernstein University of Illinois at Chicago

Protecting communications against forgery D. J. Bernstein University of Illinois at Chicago Secret-key authenticators Message m 10 50 Z , at most 1000000 digits. Sender and receiver know secret prime p , 10 39 < p < 10 40 , and

479 views • 18 slides

More recommend