Permission hereby granted for anyone to copy, modify, and redistribute any lecture note material from this class that belongs to the instructor.
[ People | Project Description | Download | Using the GUI | References ]
Supervisors:
Antonio R. Nicolosi,
Carleton Bosley
Stevens Scholars:
This is a study of Learning Parity With Noise (the LPN problem), in order to increase security in unaided human to computer interactions. After selecting your specifications, you will be given a 'secret,' and will be prompted with a number of challenges, which could be any of a number of formats, outlined below. You are to respond to each challenge with the appropriate answer, with a certain exception. In order to increase security, random 'noise' is to be added; you should try to get a certain percentage of the challenges wrong intentionally; the default value is one in five. The system will administer a successful or failed login attempt based on your 'secret' and your responses to the given challenges. Please remember to include random error! If you have any questions, please contact us.
Each challenge is shown as a list of the positions of the digits equal to one. For each digit, if the corresponding digit in the challenge and in your secret is equal to one, toggle your 'switch' (or add one to your 'total'). For each of the challenges, your answer should be the final position of your 'switch' after checking all of the digits (or whether your 'total' is even or odd: 0 for even, 1 for odd). For example, if the challenge given is '1, 2, 4,' and your secret is '0, 2, 4,' the answer would be 0. Why? Well, you would start by checking digit 0. Since digit 0 is not in the challenge, it doesn't mean anything. You then try digit 1. Digit 1 is in the challenge, so it might mean something. After checking the challenge, you check your secret. Since digit 1 is not in your secret, it means nothing. Then, you try digit 2. Digit 2 is in both the challenge and your secret; therefore, it counts. Upon finding this, you toggle your 'switch' (from 0 to 1), or add one to your 'total' (making it 1). You then try digit 3, but it is not in the challenge, so it means nothing. Then you check digit 4. Since digit 4 is in the challenge and your secret, it counts. You toggle the 'switch' (from 1 back to 0), or add one to your 'total' (making it 2). You then respond to the challenge with the position of the 'switch,' 0, or a number based on your 'total' (0 if it is even, 1 if it is odd). The answer to this challenge would be 0, since the 'switch' ended on 0, and the 'total' is even.
Each challenge is shown as a sequence of digits, each either a one or a zero. You look at the corresponding digits of the challenge and your secret. If they are both equal to one, then you toggle your 'switch,' or add one to yout 'total.' Respond to the challenge with the appropriate answer, either the position of the 'switch' (a 1 or a 0), or a number based on the 'total' (0 if it is even, 1 if it is odd). For example, if you were given the challenge 01101, and your secret was 10101, the result would be 0. Why? Well, you would start by looking at the first digit. Is the first digit of the challenge equal to 1? No Therefore, the first digit doesn't matter, and you would move on to the second digit. Looking at the second digit, you see that it is a 1 in the challenge. Then you look at your secret. Since the second digit is not a 1 in your secret, you know that the second digit doesn't matter either. You then look at the third digit. The third digit is a 1 in both the challenge and your secret. Therefore, it counts, so you would toggle your switch (from 0 to 1) or add one to your total (making it 1), and then move on to the next digit. The fourth digit is a 0 in the challenge, so it's useless. And the fifth digit is a 1 in both the challenge and your secret, so you toggle the switch back to 0, or add one to your total, making it 2. The answer to the challenge would be 0, since the switch is at 0, and since the total is even
Each challenge is shown as a sequence of colored 'rings,' each with an inner and outer ring. Your secret is represented as a certain number of characteristics of these rings. For instance, your secret may be "Color on the outside of ring one and stripes on the inside of ring 3". You would therefore look at the first ring of the challenge, and, if the outside of the ring is colored, toggle your 'switch,' or add one to your 'total.' Then you would look at the third ring, and, if the inside of the ring is striped, toggle the 'switch' again, or add another to the 'total.' Respond to the challenge with the appropriate answer.
Each challenge is shows as a sequence of pictures, each of which contains certain objects. Your secret is represented as a sequence of pictures in which certain objects are present or missing. For example, your secret may be 'airplane in the first picture, house and car in the second picture, and the sun in the third picture,' or something similar. If this were the case, you would look at each challenge and see how many of those characteristics were matched by the pictures in the challenge. If the total number of matches is odd, then you answer with a 1. If the total number is even, then you answer with a 0.
|
Credits: Antonio Nicolosi, Chris Federici, Jack Kelly
Permission hereby granted for anyone to copy, modify, and redistribute any lecture note material from this class that belongs to the instructor. |
|