New Bounds for Keyed Sponges with Extendable Output: Independence between Capacity and Message Length

Size: px
Start display at page:

Download "New Bounds for Keyed Sponges with Extendable Output: Independence between Capacity and Message Length"

Transcription

1 New Bounds for Keyed Sponges with Extendable Output: Independence between Capacity and Message Length Yusuke Naito Mitsubishi Electric Corporation Kan Yasuda NTT Secure latform Laboratories 1

2 Sponge Based on a permutation :{0,1} b {0,1} b b bit r bit: rate c bit: capacity Iterate permutation m pad m 2 m 3 m 4 Inner 0 c Absorbing Squeeing 2

3 Sponge with Extendable Output m pad m 2 m 3 m 4 (variable length) Inner 0 c Absorbing Squeeing Sponge with extendable output used as the constructions of SHAKE128, SHAKE256 in FIS 202 Designed to construct key derivation functions 3

4 Keyed Sponges with Extendable Output Keyed Sponge (OKS) K m pad K m 2 m 3 m 4 Inner 0 c Inner Keyed Sponge (IKS) Absorbing Squeeing m pad Inner m 2 m 3 K m 4 Absorbing Squeeing 4

5 RF Security of Keyed Sponges Real world Ideal world random permutation Keyed Sponge Random Function random permutation offline online D distinguisher online offline 0 or 1 arameters l is the maximum input length to a keyed sponge in blocks q is the number of online queries Q is the number of offline queries 5

6 revious RF Security Bounds There are two terms: capacity term e.g., (lq+q) 2 /2 c, (lq) 2 /2 c r bit: rate, etc b bit b term e.g., (lq) 2 /2 b, lqq/2 b, etc c bit: capacity Since c < b (e.g., b=1600, c=256, 512), the capacity term becomes a dominant term in the RF security bounds The capacity term has been improved Capacity term Target Bertoni et al. (Indiff.) (lq+q) 2 /2 c (EUROCRYT 08) Andreeva et al. (FSE 15) ((lq) 2 + Q)/2 c is multiplicity: 2lq/2 r 2lq OKS OKS and IKS Gai et al. (lq+q 2 +qq)/2 c attack with prob. (q OKS with 2 +qq)/2 c (CRYTO 15) If l q or l Q then single block output [*] the bound is tight IKS Mennink et al. (lq 2 + Q)/2 c IKS [*] (ASIACRYT 15) is multiplicity: 2lq/2 r 2lq [*] Support the constructions with full message state absorption 6

7 Comparison and Our Result Open problem for keyed sponges with extendable output: Improve the capacity terms so that they become tight terms IKS OKS Extendable output Tightness of c term Bertoni et al. Andreeva et al. Gai et al. Mennink et al. This paper Today s talk 7

8 Real world online query m pad RF Security roof of IKS offline query K Ideal world online query (almost) b bit random values offline query m Random Function For any query to a random function, the response is randomly drawn If all outputs of IKS can be seen as random values then the real world and the ideal world are indistinguishable If all inputs to that produces outputs of IKS are new inputs then all outputs of IKS become (almost) random values The distinguishing prob. The prob. that some input to that produces the output of IKS is not new 8

9 Real world online query RF Security roof of IKS K m 1 m 2 m 3 m 4 offline query K The distinguishing prob. The prob. that some input to that produces the output is not a new input The prob. that a collision in inputs to occurs We categorie inputs to in IKS into two sorts of inputs Controllable input Uncontrollable input 9

10 Controllable Input and Uncontrollable Input Controllable input The outer part can be controlled The inner part cannot be controlled Uncontrollable input The outer and inner parts cannot be controlled 1 st online query Inner K Known value Controllable Controllable input 10

11 Controllable Input and Uncontrollable Input Controllable input The outer part can be controlled The inner part cannot be controlled Uncontrollable input The outer and inner parts cannot be controlled 1 st online query Inner K Controllable input New output defined after m 2 was defined Uncontrollable inputs 11

12 Controllable Input and Uncontrollable Input Controllable input The outer part can be controlled The inner part cannot be controlled Uncontrollable input The outer and inner parts cannot be controlled 1 st online query Inner K Obtained from the output 2 nd online query Inner K Controllable input m 5 Controllable m 6 Known value Controllable input 12

13 Inner K Controllable Input and Uncontrollable Input Controllable input The outer part can be controlled The inner part cannot be controlled Uncontrollable input The outer and inner parts cannot be controlled 1 st online query 2 st online query Inner K Controllable input m 5 m 6 Controllable input Uncontrollable inputs New output defined after m 6 was defined 13

14 Controllable Input and Uncontrollable Input 1 st online query Inner K 2 st online query Inner K Controllable input Uncontrollable inputs m 5 m 6 Controllable input Uncontrollable inputs Controllable inputs For each online query, the number of controllable inputs is at most 1 The total number of controllable inputs is at most q Uncontrollable inputs The total number of inputs to the random permutation in IKS is at most lq The total number of uncontrollable inputs is at most lq 14

15 Controllable Input and Uncontrollable Input The features of controllable inputs and uncontrollable inputs Inputs to part (r bit) Inner part (c bi) Number Controllable input Not random Random q Uncontrollable input Random Random lq 15

16 Bound of Distinguishing robability The distinguishing prob. The prob. that a collision in inputs to occurs Inputs to part (r bits) Inner part (c bits) Number Controllable input Not random Random q Uncontrollable input Random Random lq Input by offline query Not random Not random Q The prob. that a collision in inputs to occurs is bounded by the sum of probabilities of collision in controllable inputs q 2 /2 c collision in uncontrollable inputs (lq) 2 /2 b collision between controllable inputs and uncontrollable inputs collision between controllable inputs and inputs by offline queries collision between uncontrollable inputs and inputs by offline queries lqq/2 b The distinguishing prob. (q 2 +qq)/2 c + (lq 2 + (lq) 2 + lqq)/2 b lq 2 /2 b qq/2 c attack with prob. (q 2 +qq)/2 c 16

17 Conclusion Capacity term Target Indifferentiability (lq+q) 2 /2 c (EUROCRYT 08) OKS Andreeva et al. ((lq) 2 + Q)/2 c (FSE 15) is multiplicity: 2lq/2 r 2lq OKS and IKS Gai et al. (lq+q 2 +qq)/2 c (CRYTO 15) OKS with single block output Mennink et al. (ASIACRYT 15) (lq 2 + Q)/2 c is multiplicity: 2lq/2 r 2lq IKS This paper (q 2 +qq)/2 c (Tight) IKS and OKS 17

18 Thank You! 18

SHA-3 and permutation-based cryptography

SHA-3 and permutation-based cryptography SHA-3 and permutation-based cryptography Joan Daemen 1 Joint work with Guido Bertoni 1, Michaël Peeters 2 and Gilles Van Assche 1 1 STMicroelectronics 2 NXP Semiconductors Crypto summer school Šibenik,

More information

Block Ciphers Security of block ciphers. Symmetric Ciphers

Block Ciphers Security of block ciphers. Symmetric Ciphers Lecturers: Mark D. Ryan and David Galindo. Cryptography 2016. Slide: 26 Assume encryption and decryption use the same key. Will discuss how to distribute key to all parties later Symmetric ciphers unusable

More information

Randomized Algorithms

Randomized Algorithms Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 Randomized Algorithms Randomized Algorithms 1 Applications: Simple Algorithms and

More information

Variations of Rank Modulation for Flash Memories

Variations of Rank Modulation for Flash Memories Variations of Rank Modulation for Flash Memories Zhiying Wang Joint work with Anxiao(Andrew) Jiang Jehoshua Bruck Flash Memory Control Gate Floating Gate Source Drain Substrate Block erasure X Flash Memory

More information

Eliminating Random Permutation Oracles in the Even-Mansour Cipher. Zulfikar Ramzan. Joint work w/ Craig Gentry. DoCoMo Labs USA

Eliminating Random Permutation Oracles in the Even-Mansour Cipher. Zulfikar Ramzan. Joint work w/ Craig Gentry. DoCoMo Labs USA Eliminating Random Permutation Oracles in the Even-Mansour Cipher Zulfikar Ramzan Joint work w/ Craig Gentry DoCoMo Labs USA ASIACRYPT 2004 Outline Even-Mansour work and open problems. Main contributions

More information

Solution Concepts 4 Nash equilibrium in mixed strategies

Solution Concepts 4 Nash equilibrium in mixed strategies Solution Concepts 4 Nash equilibrium in mixed strategies Watson 11, pages 123-128 Bruno Salcedo The Pennsylvania State University Econ 402 Summer 2012 Mixing strategies In a strictly competitive situation

More information

Step-by-Step Guide Query Studio Grouping, Sorting, Sectioning, Filtering and Calculations. Grouping

Step-by-Step Guide Query Studio Grouping, Sorting, Sectioning, Filtering and Calculations. Grouping There are several ways that data contained in reports run using Query Studio can be formatted. Data can be auto-summarized by grouping the data based on specific criteria, data can be sorted in ascending

More information

Part I: The Swap Puzzle

Part I: The Swap Puzzle Part I: The Swap Puzzle Game Play: Randomly arrange the tiles in the boxes then try to put them in proper order using only legal moves. A variety of legal moves are: Legal Moves (variation 1): Swap the

More information

Section 6.1 #16. Question: What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit?

Section 6.1 #16. Question: What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit? Section 6.1 #16 What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit? page 1 Section 6.1 #38 Two events E 1 and E 2 are called independent if p(e 1

More information

Generic Attacks on Feistel Schemes

Generic Attacks on Feistel Schemes Generic Attacks on Feistel Schemes Jacques Patarin 1, 1 CP8 Crypto Lab, SchlumbergerSema, 36-38 rue de la Princesse, BP 45, 78430 Louveciennes Cedex, France PRiSM, University of Versailles, 45 av. des

More information

CSCI 2200 Foundations of Computer Science (FoCS) Solutions for Homework 7

CSCI 2200 Foundations of Computer Science (FoCS) Solutions for Homework 7 CSCI 00 Foundations of Computer Science (FoCS) Solutions for Homework 7 Homework Problems. [0 POINTS] Problem.4(e)-(f) [or F7 Problem.7(e)-(f)]: In each case, count. (e) The number of orders in which a

More information

Conditional Cube Attack on Reduced-Round Keccak Sponge Function

Conditional Cube Attack on Reduced-Round Keccak Sponge Function Conditional Cube Attack on Reduced-Round Keccak Sponge Function Senyang Huang 1, Xiaoyun Wang 1,2,3, Guangwu Xu 4, Meiqin Wang 2,3, Jingyuan Zhao 5 1 Institute for Advanced Study, Tsinghua University,

More information

Sensus AMI Electric and Gas Endpoints Radio Frequency Test Results. Compliance to: Health Canada Safety Code 6. Summary of Findings

Sensus AMI Electric and Gas Endpoints Radio Frequency Test Results. Compliance to: Health Canada Safety Code 6. Summary of Findings Sensus AMI Electric and Gas Endpoints Radio Frequency Test Results Compliance to: Health Canada Safety Code 6 Summary of Findings Conducted by: Planetworks Consulting Corporation North Vancouver, BC April

More information

Generic Attacks on Feistel Schemes

Generic Attacks on Feistel Schemes Generic Attacks on Feistel Schemes -Extended Version- Jacques Patarin PRiSM, University of Versailles, 45 av. des États-Unis, 78035 Versailles Cedex, France This paper is the extended version of the paper

More information

Introduction to Cryptography

Introduction to Cryptography B504 / I538: Introduction to Cryptography Spring 2017 Lecture 10 Assignment 2 is due on Tuesday! 1 Recall: Pseudorandom generator (PRG) Defⁿ: A (fixed-length) pseudorandom generator (PRG) with expansion

More information

Anavilhanas Natural Reserve (about 4000 Km 2 )

Anavilhanas Natural Reserve (about 4000 Km 2 ) Anavilhanas Natural Reserve (about 4000 Km 2 ) A control room receives this alarm signal: what to do? adversarial patrolling with spatially uncertain alarm signals Nicola Basilico, Giuseppe De Nittis,

More information

Comp551: Advanced Robotics Lab Lecture 7: Consensus CSE481C wi09 - Robotics Capstone, Lec3: Consensus

Comp551: Advanced Robotics Lab Lecture 7: Consensus CSE481C wi09 - Robotics Capstone, Lec3: Consensus Comp551: Advanced Robotics Lab Lecture 7: Consensus 1 intro 3 multi-robot computation model 5 Model: Robot State We can describe the state, s, of a single robot as a tuple of its ID, pose, and private

More information

Localization (Position Estimation) Problem in WSN

Localization (Position Estimation) Problem in WSN Localization (Position Estimation) Problem in WSN [1] Convex Position Estimation in Wireless Sensor Networks by L. Doherty, K.S.J. Pister, and L.E. Ghaoui [2] Semidefinite Programming for Ad Hoc Wireless

More information

STUDENT'S BOOKLET. Shapes, Bees and Balloons. Meeting 20 Student s Booklet. Contents. April 27 UCI

STUDENT'S BOOKLET. Shapes, Bees and Balloons. Meeting 20 Student s Booklet. Contents. April 27 UCI Meeting 20 Student s Booklet Shapes, Bees and Balloons April 27 2016 @ UCI Contents 1 A Shapes Experiment 2 Trinities 3 Balloons 4 Two bees and a very hungry caterpillar STUDENT'S BOOKLET UC IRVINE MATH

More information

Cryptanalysis on short messages encrypted with M-138 cipher machine

Cryptanalysis on short messages encrypted with M-138 cipher machine Cryptanalysis on short messages encrypted with M-138 cipher machine Tsonka Baicheva Miroslav Dimitrov Institute of Mathematics and Informatics Bulgarian Academy of Sciences 10-14 July, 2017 Sofia Introduction

More information

Matrices AT

Matrices AT VCE Further Mathematics Matrices AT 4.1 2016 Part A Outcome 1 Define and explain key concepts and apply related mathematical techniques and models in routine contexts. Outcome 2 Select and apply the mathematical

More information

3. Discrete Probability. CSE 312 Spring 2015 W.L. Ruzzo

3. Discrete Probability. CSE 312 Spring 2015 W.L. Ruzzo 3. Discrete Probability CSE 312 Spring 2015 W.L. Ruzzo 2 Probability theory: an aberration of the intellect and ignorance coined into science John Stuart Mill 3 sample spaces Sample space: S is a set of

More information

New Linear Cryptanalytic Results of Reduced-Round of CAST-128 and CAST-256

New Linear Cryptanalytic Results of Reduced-Round of CAST-128 and CAST-256 New Linear Cryptanalytic Results of Reduced-Round of CAST-28 and CAST-256 Meiqin Wang, Xiaoyun Wang, and Changhui Hu Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education,

More information

Instructions [CT+PT Treatment]

Instructions [CT+PT Treatment] Instructions [CT+PT Treatment] 1. Overview Welcome to this experiment in the economics of decision-making. Please read these instructions carefully as they explain how you earn money from the decisions

More information

ECE 242 Data Structures and Algorithms. Simple Sorting II. Lecture 5. Prof.

ECE 242 Data Structures and Algorithms.  Simple Sorting II. Lecture 5. Prof. ECE 242 Data Structures and Algorithms http://www.ecs.umass.edu/~polizzi/teaching/ece242/ Simple Sorting II Lecture 5 Prof. Eric Polizzi Summary previous lecture 1 Bubble Sort 2 Selection Sort 3 Insertion

More information

* Order Matters For Permutations * Section 4.6 Permutations MDM4U Jensen. Part 1: Factorial Investigation

* Order Matters For Permutations * Section 4.6 Permutations MDM4U Jensen. Part 1: Factorial Investigation Section 4.6 Permutations MDM4U Jensen Part 1: Factorial Investigation You are trying to put three children, represented by A, B, and C, in a line for a game. How many different orders are possible? a)

More information

Statistical tests. Paired t-test

Statistical tests. Paired t-test Statistical tests Gather data to assess some hypothesis (e.g., does this treatment have an effect on this outcome?) Form a test statistic for which large values indicate a departure from the hypothesis.

More information

2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC)

2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC) 2. Combinatorics: the systematic study of counting The Basic Principle of Counting (BPC) Suppose r experiments will be performed. The 1st has n 1 possible outcomes, for each of these outcomes there are

More information

* Order Matters For Permutations * Section 4.6 Permutations MDM4U Jensen. Part 1: Factorial Investigation

* Order Matters For Permutations * Section 4.6 Permutations MDM4U Jensen. Part 1: Factorial Investigation Section 4.6 Permutations MDM4U Jensen Part 1: Factorial Investigation You are trying to put three children, represented by A, B, and C, in a line for a game. How many different orders are possible? a)

More information

Lecture 7: The Principle of Deferred Decisions

Lecture 7: The Principle of Deferred Decisions Randomized Algorithms Lecture 7: The Principle of Deferred Decisions Sotiris Nikoletseas Professor CEID - ETY Course 2017-2018 Sotiris Nikoletseas, Professor Randomized Algorithms - Lecture 7 1 / 20 Overview

More information

Midterm practice super-problems

Midterm practice super-problems Midterm practice super-problems These problems are definitely harder than the midterm (even the ones without ), so if you solve them you should have no problem at all with the exam. However be aware that

More information

ProxiMate : Proximity Based Secure Pairing using Ambient Wireless Signals

ProxiMate : Proximity Based Secure Pairing using Ambient Wireless Signals ProxiMate : Proximity Based Secure Pairing using Ambient Wireless Signals Suhas Mathur AT&T Security Research Group Rob Miller, Alex Varshavsky, Wade Trappe, Narayan Madayam Suhas Mathur (AT&T) firstname

More information

Creating 3D-Frogger. Created by: Susan Miller, University of Colorado, School of Education. Adaptations using AgentCubes made by Cathy Brand

Creating 3D-Frogger. Created by: Susan Miller, University of Colorado, School of Education. Adaptations using AgentCubes made by Cathy Brand Creating 3D-Frogger You are a frog. Your task is simple: hop across a busy highway, dodging cars and trucks, until you get to the edge of a river, where you must keep yourself from drowning by crossing

More information

M146 - Chapter 5 Handouts. Chapter 5

M146 - Chapter 5 Handouts. Chapter 5 Chapter 5 Objectives of chapter: Understand probability values. Know how to determine probability values. Use rules of counting. Section 5-1 Probability Rules What is probability? It s the of the occurrence

More information

Fast Sorting and Pattern-Avoiding Permutations

Fast Sorting and Pattern-Avoiding Permutations Fast Sorting and Pattern-Avoiding Permutations David Arthur Stanford University darthur@cs.stanford.edu Abstract We say a permutation π avoids a pattern σ if no length σ subsequence of π is ordered in

More information

Visual Cryptography. Frederik Vercauteren. University of Bristol, Merchant Venturers Building, Woodland Road, Bristol BS8 1UB.

Visual Cryptography. Frederik Vercauteren. University of Bristol, Merchant Venturers Building, Woodland Road, Bristol BS8 1UB. Visual Cryptography Frederik Vercauteren University of Bristol, Merchant Venturers Building, Woodland Road, Bristol BS8 1UB frederik@cs.bris.ac.uk Frederik Vercauteren 1 University of Bristol 21 November

More information

4.1 What is Probability?

4.1 What is Probability? 4.1 What is Probability? between 0 and 1 to indicate the likelihood of an event. We use event is to occur. 1 use three major methods: 1) Intuition 3) Equally Likely Outcomes Intuition - prediction based

More information

Multi-Instance Security and its Application to Password- Based Cryptography

Multi-Instance Security and its Application to Password- Based Cryptography Multi-Instance Security and its Application to Password- Based Cryptography Stefano Tessaro MIT Joint work with Mihir Bellare (UC San Diego) Thomas Ristenpart (Univ. of Wisconsin) Scenario: File encryption

More information

V.Sorge/E.Ritter, Handout 2

V.Sorge/E.Ritter, Handout 2 06-20008 Cryptography The University of Birmingham Autumn Semester 2015 School of Computer Science V.Sorge/E.Ritter, 2015 Handout 2 Summary of this handout: Symmetric Ciphers Overview Block Ciphers Feistel

More information

The next several lectures will be concerned with probability theory. We will aim to make sense of statements such as the following:

The next several lectures will be concerned with probability theory. We will aim to make sense of statements such as the following: CS 70 Discrete Mathematics for CS Fall 2004 Rao Lecture 14 Introduction to Probability The next several lectures will be concerned with probability theory. We will aim to make sense of statements such

More information

Chapter 1. Probability

Chapter 1. Probability Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.

More information

Classification of Ciphers

Classification of Ciphers Classification of Ciphers A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Technology by Pooja Maheshwari to the Department of Computer Science & Engineering Indian

More information

Counting Subsets with Repetitions. ICS 6C Sandy Irani

Counting Subsets with Repetitions. ICS 6C Sandy Irani Counting Subsets with Repetitions ICS 6C Sandy Irani Multi-sets A Multi-set can have more than one copy of an item. Order doesn t matter The number of elements of each type does matter: {1, 2, 2, 2, 3,

More information

Content. 1 Understanding and analyzing algorithms. 2 Using graphs and graph algorithms

Content. 1 Understanding and analyzing algorithms. 2 Using graphs and graph algorithms Content 1 Understanding and analyzing algorithms 2 Using graphs and graph algorithms 3 Using combinatorial reasoning and probability to quantitatively analyze algorithms and systems 3.1 Basics of Counting:

More information

HIGH SCHOOL MATHEMATICS CONTEST. Prepared by the Mathematics Department of Rose-Hulman Institute of Technology Terre Haute, Indiana

HIGH SCHOOL MATHEMATICS CONTEST. Prepared by the Mathematics Department of Rose-Hulman Institute of Technology Terre Haute, Indiana HIGH SCHOOL MATHEMATICS CONTEST Prepared by the Mathematics Department of Rose-Hulman Institute of Technology Terre Haute, Indiana November 14, 015 Instructions: Put your name and home address on the back

More information

MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology

MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability Preliminary Concepts, Formulas, and Terminology Meanings of Basic Arithmetic Operations in Mathematics Addition: Generally

More information

Statistics 101: Section L Laboratory 10

Statistics 101: Section L Laboratory 10 Statistics 101: Section L Laboratory 10 This lab looks at the sampling distribution of the sample proportion pˆ and probabilities associated with sampling from a population with a categorical variable.

More information

Introduction. APPLICATION NOTE 3981 HFTA-15.0 Thermistor Networks and Genetics. By: Craig K. Lyon, Strategic Applications Engineer

Introduction. APPLICATION NOTE 3981 HFTA-15.0 Thermistor Networks and Genetics. By: Craig K. Lyon, Strategic Applications Engineer Maxim > App Notes > FIBER-OPTIC CIRCUITS Keywords: thermistor networks, resistor, temperature compensation, Genetic Algorithm May 13, 2008 APPLICATION NOTE 3981 HFTA-15.0 Thermistor Networks and Genetics

More information

The factorial of a number (n!) is the product of all of the integers from that number down to 1.

The factorial of a number (n!) is the product of all of the integers from that number down to 1. ointers 5.5 Factorial The factorial of a number (n!) is the product of all of the integers from that number down to 1. 6! 6 x 5 x 4 x 3 x 2 x 1 20 You should have a built-in button or function on your

More information

Chapter 2 Distributed Consensus Estimation of Wireless Sensor Networks

Chapter 2 Distributed Consensus Estimation of Wireless Sensor Networks Chapter 2 Distributed Consensus Estimation of Wireless Sensor Networks Recently, consensus based distributed estimation has attracted considerable attention from various fields to estimate deterministic

More information

World Robot Olympiad Regular Category Senior. Game Description, Rules and Scoring FOOD MATTERS FOOD DISTRIBUTION

World Robot Olympiad Regular Category Senior. Game Description, Rules and Scoring FOOD MATTERS FOOD DISTRIBUTION World Robot Olympiad 2018 Regular Category Senior Game Description, Rules and Scoring FOOD MATTERS FOOD DISTRIBUTION Version: Final Version January 15 th Table of Contents Introduction... 2 1. Game Description...

More information

MITOCW watch?v=krzi60lkpek

MITOCW watch?v=krzi60lkpek MITOCW watch?v=krzi60lkpek The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To

More information

Permutations. Example 1. Lecture Notes #2 June 28, Will Monroe CS 109 Combinatorics

Permutations. Example 1. Lecture Notes #2 June 28, Will Monroe CS 109 Combinatorics Will Monroe CS 09 Combinatorics Lecture Notes # June 8, 07 Handout by Chris Piech, with examples by Mehran Sahami As we mentioned last class, the principles of counting are core to probability. Counting

More information

11.2. Counting Techniques and Probability

11.2. Counting Techniques and Probability 11.2. Counting Techniques and Probability 1 Objectives A. Draw and use a tree diagram to find the probability of an event. B. Use permutations and combinations to find the probability of an event. C. Solve

More information

Indiana Jones and the Raiders of the Lost RFID Tag

Indiana Jones and the Raiders of the Lost RFID Tag Indiana Jones and the Raiders of the Lost RFID Tag Starring: Bernhard Firner Screenshot Indiana Jones and the Raiders of the Lost Ark Paramount Pictures, 1981. Co-starring: Yanyong Zhang Richard Howard

More information

Andrei Sabelfeld. Joint work with Per Hallgren and Martin Ochoa

Andrei Sabelfeld. Joint work with Per Hallgren and Martin Ochoa Andrei Sabelfeld Joint work with Per Hallgren and Martin Ochoa Privacy for location based services Explosion of interest to location based services (LBS) locating people, vehicles, vessels, cargo, devices

More information

Five-In-Row with Local Evaluation and Beam Search

Five-In-Row with Local Evaluation and Beam Search Five-In-Row with Local Evaluation and Beam Search Jiun-Hung Chen and Adrienne X. Wang jhchen@cs axwang@cs Abstract This report provides a brief overview of the game of five-in-row, also known as Go-Moku,

More information

1 Permutations. Example 1. Lecture #2 Sept 26, Chris Piech CS 109 Combinatorics

1 Permutations. Example 1. Lecture #2 Sept 26, Chris Piech CS 109 Combinatorics Chris Piech CS 09 Combinatorics Lecture # Sept 6, 08 Based on a handout by Mehran Sahami As we mentioned last class, the principles of counting are core to probability. Counting is like the foundation

More information

Saturday Morning Math Group October 27, Game Theory and Knowing about Knowledge PACKET A

Saturday Morning Math Group October 27, Game Theory and Knowing about Knowledge PACKET A Saturday Morning Math Group October 27, 2012 Game Theory and Knowing about Knowledge PACKET A The table below shows your ( s) payoffs: Situation 1 Role: Row Player ( ) Left Right Up 100 100 Down 0 0 Situation

More information

Introduction to Mathematical Reasoning, Saylor 111

Introduction to Mathematical Reasoning, Saylor 111 Here s a game I like plying with students I ll write a positive integer on the board that comes from a set S You can propose other numbers, and I tell you if your proposed number comes from the set Eventually

More information

Robust Location Detection in Emergency Sensor Networks. Goals

Robust Location Detection in Emergency Sensor Networks. Goals Robust Location Detection in Emergency Sensor Networks S. Ray, R. Ungrangsi, F. D. Pellegrini, A. Trachtenberg, and D. Starobinski. Robust location detection in emergency sensor networks. In Proceedings

More information

Window component characteristics

Window component characteristics Window component characteristics Content Panes and Screens Shading Devices Frames and Spacers Module 2: Window components characteristics / July 2004 / Slide 1 Panes and Screens Most important properties

More information

TMA4155 Cryptography, Intro

TMA4155 Cryptography, Intro Trondheim, December 12, 2006. TMA4155 Cryptography, Intro 2006-12-02 Problem 1 a. We need to find an inverse of 403 modulo (19 1)(31 1) = 540: 540 = 1 403 + 137 = 17 403 50 540 + 50 403 = 67 403 50 540

More information

Encryption at the Speed of Light? Towards a cryptanalysis of an optical CDMA encryption scheme

Encryption at the Speed of Light? Towards a cryptanalysis of an optical CDMA encryption scheme Encryption at the Speed of Light? Towards a cryptanalysis of an optical CDMA encryption scheme Sharon Goldberg * Ron Menendez **, Paul R. Prucnal * *, ** Telcordia Technologies IPAM Workshop on Special

More information

TJP TOP TIPS FOR IGCSE STATS & PROBABILITY

TJP TOP TIPS FOR IGCSE STATS & PROBABILITY TJP TOP TIPS FOR IGCSE STATS & PROBABILITY Dr T J Price, 2011 First, some important words; know what they mean (get someone to test you): Mean the sum of the data values divided by the number of items.

More information

Shannon Information Theory

Shannon Information Theory Comm. 5: Communication Theor Lecture Shannon Information Theor -Binar Erasure Channel, Binar Smmetric channel, Channel Caacit, Shannon Caacit Noiseless Channel P P P Noiseless Channel P is the robabilit

More information

Multi-user Two-way Deterministic Modulo 2 Adder Channels When Adaptation Is Useless

Multi-user Two-way Deterministic Modulo 2 Adder Channels When Adaptation Is Useless Forty-Ninth Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 28-30, 2011 Multi-user Two-way Deterministic Modulo 2 Adder Channels When Adaptation Is Useless Zhiyu Cheng, Natasha

More information

November 8, Chapter 8: Probability: The Mathematics of Chance

November 8, Chapter 8: Probability: The Mathematics of Chance Chapter 8: Probability: The Mathematics of Chance November 8, 2013 Last Time Probability Models and Rules Discrete Probability Models Equally Likely Outcomes Crystallographic notation The first symbol

More information

Standardized Calibration Process for the imagepress C1 Series with Server Calibrations

Standardized Calibration Process for the imagepress C1 Series with Server Calibrations Standardized Calibration Process for the imagepress C1 Series with Server Calibrations Please read this disclosure before proceeding. The printer should be stabilized before performing the following adjustments.

More information

CS1802 Week 9: Probability, Expectation, Entropy

CS1802 Week 9: Probability, Expectation, Entropy CS02 Discrete Structures Recitation Fall 207 October 30 - November 3, 207 CS02 Week 9: Probability, Expectation, Entropy Simple Probabilities i. What is the probability that if a die is rolled five times,

More information

Chapter 1. Probability

Chapter 1. Probability Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.

More information

Time Iteration Protocol for TOD Clock Synchronization. Eric E. Johnson. January 23, 1992

Time Iteration Protocol for TOD Clock Synchronization. Eric E. Johnson. January 23, 1992 Time Iteration Protocol for TOD Clock Synchronization Eric E. Johnson January 23, 1992 Introduction This report presents a protocol for bringing HF stations into closer synchronization than is normally

More information

5984 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 12, DECEMBER 2010

5984 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 12, DECEMBER 2010 5984 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 12, DECEMBER 2010 Interference Channels With Correlated Receiver Side Information Nan Liu, Member, IEEE, Deniz Gündüz, Member, IEEE, Andrea J.

More information

Math is Cool Masters

Math is Cool Masters Sponsored by: Algebra II January 6, 008 Individual Contest Tear this sheet off and fill out top of answer sheet on following page prior to the start of the test. GENERAL INSTRUCTIONS applying to all tests:

More information

A Probability Work Sheet

A Probability Work Sheet A Probability Work Sheet October 19, 2006 Introduction: Rolling a Die Suppose Geoff is given a fair six-sided die, which he rolls. What are the chances he rolls a six? In order to solve this problem, we

More information

Section 6.4. Sampling Distributions and Estimators

Section 6.4. Sampling Distributions and Estimators Section 6.4 Sampling Distributions and Estimators IDEA Ch 5 and part of Ch 6 worked with population. Now we are going to work with statistics. Sample Statistics to estimate population parameters. To make

More information

Spectrum Sharing with Adjacent Channel Constraints

Spectrum Sharing with Adjacent Channel Constraints Spectrum Sharing with Adjacent Channel Constraints icholas Misiunas, Miroslava Raspopovic, Charles Thompson and Kavitha Chandra Center for Advanced Computation and Telecommunications Department of Electrical

More information

Chapter 3: TRANSISTORS. Dr. Gopika Sood PG Govt. College For Girls Sector -11, Chandigarh

Chapter 3: TRANSISTORS. Dr. Gopika Sood PG Govt. College For Girls Sector -11, Chandigarh Chapter 3: TRANSISTORS Dr. Gopika Sood PG Govt. College For Girls Sector -11, Chandigarh OUTLINE Transistors Bipolar Junction Transistor (BJT) Operation of Transistor Transistor parameters Load Line Biasing

More information

SMART CITIES SMART LIGHTING

SMART CITIES SMART LIGHTING World Robot Olympiad 2019 Regular Category Junior SMART CITIES SMART LIGHTING Version: January 15 th WRO International Premium Partners Table of Contents 1. Introduction... 2 2. Game Field... 3 3. Game

More information

Week in Review #5 ( , 3.1)

Week in Review #5 ( , 3.1) Math 166 Week-in-Review - S. Nite 10/6/2012 Page 1 of 5 Week in Review #5 (2.3-2.4, 3.1) n( E) In general, the probability of an event is P ( E) =. n( S) Distinguishable Permutations Given a set of n objects

More information

DOWNLOAD OR READ : VIDEO POKER SALVATION OR DAMNATION A PERSONAL JOURNEY PDF EBOOK EPUB MOBI

DOWNLOAD OR READ : VIDEO POKER SALVATION OR DAMNATION A PERSONAL JOURNEY PDF EBOOK EPUB MOBI DOWNLOAD OR READ : VIDEO POKER SALVATION OR DAMNATION A PERSONAL JOURNEY PDF EBOOK EPUB MOBI Page 1 Page 2 video poker salvation or damnation a personal journey video poker salvation or pdf video poker

More information

CS 261 Notes: Zerocash

CS 261 Notes: Zerocash CS 261 Notes: Zerocash Scribe: Lynn Chua September 19, 2018 1 Introduction Zerocash is a cryptocurrency which allows users to pay each other directly, without revealing any information about the parties

More information

22c:145 Artificial Intelligence

22c:145 Artificial Intelligence 22c:145 Artificial Intelligence Fall 2005 Informed Search and Exploration II Cesare Tinelli The University of Iowa Copyright 2001-05 Cesare Tinelli and Hantao Zhang. a a These notes are copyrighted material

More information

Two Improvements of Random Key Predistribution for Wireless Sensor Networks

Two Improvements of Random Key Predistribution for Wireless Sensor Networks Two Improvements of Random Key Predistribution for Wireless Sensor Networks Jiří Kůr, Vashek Matyáš, Petr Švenda Faculty of Informatics Masaryk University Capture resilience improvements Collision key

More information

Signatures for Network Coding

Signatures for Network Coding Conference on Random network codes and Designs over F q Signatures for Network Coding Oliver Gnilke, Claude-Shannon-Institute, University College Dublin 18. September 2013 1 / 14 Network Coding Signature

More information

GstarCAD Mechanical 2015 Help

GstarCAD Mechanical 2015 Help 1 Chapter 1 GstarCAD Mechanical 2015 Introduction Abstract GstarCAD Mechanical 2015 drafting/design software, covers all fields of mechanical design. It supplies the latest standard parts library, symbols

More information

Dynamic Framed Slotted ALOHA Algorithms using Fast Tag Estimation Method for RFID System

Dynamic Framed Slotted ALOHA Algorithms using Fast Tag Estimation Method for RFID System Dynamic Framed Slotted AOHA Algorithms using Fast Tag Estimation Method for RFID System Jae-Ryong Cha School of Electrical and Computer Engineering Ajou Univ., Suwon, Korea builder@ajou.ac.kr Jae-Hyun

More information

Cricket: Location- Support For Wireless Mobile Networks

Cricket: Location- Support For Wireless Mobile Networks Cricket: Location- Support For Wireless Mobile Networks Presented By: Bill Cabral wcabral@cs.brown.edu Purpose To provide a means of localization for inbuilding, location-dependent applications Maintain

More information

50 Counting Questions

50 Counting Questions 50 Counting Questions Prob-Stats (Math 3350) Fall 2012 Formulas and Notation Permutations: P (n, k) = n!, the number of ordered ways to permute n objects into (n k)! k bins. Combinations: ( ) n k = n!,

More information

GAME PROGRAMMING & DESIGN LAB 1 Egg Catcher - a simple SCRATCH game

GAME PROGRAMMING & DESIGN LAB 1 Egg Catcher - a simple SCRATCH game I. BACKGROUND 1.Introduction: GAME PROGRAMMING & DESIGN LAB 1 Egg Catcher - a simple SCRATCH game We have talked about the programming languages and discussed popular programming paradigms. We discussed

More information

Supplementary Figures

Supplementary Figures Supplementary Figures Supplementary Figure 1. The schematic of the perceptron. Here m is the index of a pixel of an input pattern and can be defined from 1 to 320, j represents the number of the output

More information

period one to have external validity since we cannot apply them in our real life if it takes many periods to achieve the goal of them. In order to cop

period one to have external validity since we cannot apply them in our real life if it takes many periods to achieve the goal of them. In order to cop Second Thought: Theory and Experiment in Social ilemma Saijo, Tatsuyoshi and Okano, Yoshitaka (Kochitech) 1. Introduction Why have we been using second thought? This paper shows that second thought is

More information

MAC Theory Chapter 7. Standby Energy [digitalstrom.org] Rating. Overview. No apps Mission critical

MAC Theory Chapter 7. Standby Energy [digitalstrom.org] Rating. Overview. No apps Mission critical Standby Energy [digitalstrom.org] MAC Theory Chapter 7 0 billion electrical devices in Europe 9.5 billion are not networked 6 billion euro per year energy lost Make electricity smart cheap networking (over

More information

MAC Theory. Chapter 7

MAC Theory. Chapter 7 MAC Theory Chapter 7 Ad Hoc and Sensor Networks Roger Wattenhofer 7/1 Standby Energy [digitalstrom.org] 10 billion electrical devices in Europe 9.5 billion are not networked 6 billion euro per year energy

More information

How to Draw a New York Beauty Block

How to Draw a New York Beauty Block How to Draw a New York Beauty Block We start by opening the Block Wizard. Click Options, Screen settings. In the Grid tab, choose Circular for the Grid Type. Set the Size to be.50 Number of Rings: 15 Radials:

More information

CS 361: Probability & Statistics

CS 361: Probability & Statistics January 31, 2018 CS 361: Probability & Statistics Probability Probability theory Probability Reasoning about uncertain situations with formal models Allows us to compute probabilities Experiments will

More information

VISUAL CRYPTOGRAPHY for COLOR IMAGES USING ERROR DIFFUSION AND PIXEL SYNCHRONIZATION

VISUAL CRYPTOGRAPHY for COLOR IMAGES USING ERROR DIFFUSION AND PIXEL SYNCHRONIZATION VISUAL CRYPTOGRAPHY for COLOR IMAGES USING ERROR DIFFUSION AND PIXEL SYNCHRONIZATION Pankaja Patil Department of Computer Science and Engineering Gogte Institute of Technology, Belgaum, Karnataka Bharati

More information

Case 1: If Denver is the first city visited, then the outcome looks like: ( D ).

Case 1: If Denver is the first city visited, then the outcome looks like: ( D ). 2.37. (a) Think of each city as an object. Each one is distinct. Therefore, there are 6! = 720 different itineraries. (b) Envision the process of selecting an itinerary as a random experiment with sample

More information

Solution Paper: Contention Slots in PMP 450

Solution Paper: Contention Slots in PMP 450 Solution Paper: Contention Slots in PMP 450 CN CN PMP 450 CS OG 03052014 01192014 This solution paper describes how Contention Slots are used in a PMP 450 wireless broadband access network system, and

More information

More Great Ideas in Theoretical Computer Science. Lecture 1: Sorting Pancakes

More Great Ideas in Theoretical Computer Science. Lecture 1: Sorting Pancakes 15-252 More Great Ideas in Theoretical Computer Science Lecture 1: Sorting Pancakes January 19th, 2018 Question If there are n pancakes in total (all in different sizes), what is the max number of flips

More information