FYS in Two Distinct Ways

Total Page:16

File Type:pdf, Size:1020Kb

FYS in Two Distinct Ways BXNAESHQBHOHDFJTFJQE Fall, 2011 NLHEWHEBVHEFCHXFCHZF VHEWBAREWNETNZGJZEKE Monday, Wednesday, and Friday, 12:00-12:50 FAEWHZDQQNSJZMFUAFRF Science Center, Room 308 FCUHNZFABMDFJNUHEWHM Dr. Alan Koch BUZEKHUZFAEFHVNBQEWB ZVHZZNRHEFVHDFJTBQQH Office: Buttrick 329 XHBOHHYEUNPJBIKFBAEZX (404) 471-6223 FARUNEJQNEBFAZ [email protected] Office Hours. Mondays, 2-3, Tuesdays, 11-12, and Wednesdays, 11-12 or by appointment. Text. None. Didn’t you spend enough on books as it is? Calculator. Any scientific calculator will be just dandy. It certainly doesn’t have to be high-fallutin’ – medium fallutin’ will be just fine. Computer. It will probably not surprise you to learn that modern day cryptology is performed almost exclusively with computers. We will focus on classical (read: old) cryptography; however we will use a computer from time to time to facilitate computations. Course Content. Most, if not all, of the book, along with other selected topics in cryptology. Topics include cryptography, cryptanalysis, and protocols. Course Goals. By the end of the semester, you should: develop an appreciation for the theory of cryptology. be able to encode and decode using a variety of techniques be able to break codes which appear at first to be unbreakable. improve your skills in effectively communicating mathematics via both speaking and writing. So what, exactly, are we going to be doing? Cryptology is the study of secret codes. It includes cryptography , the writing of secret codes, as well as cryptanalysis , analyzing of secret codes. In other words, cryptography constructs the codes, cryptanalysis breaks them. Both are extremely important in today’s world. As mentioned above, modern day cryptography is all done on computers. Most of the ciphers we will see in class can be done by hand. These are all well-known and most provide only a small-to-medium amount of security. (If I tried to teach anything more secure, the government would come for me in the middle of the night.) The idea in this class is to give you the theory behind code making and breaking, not to give you the tools to hack into NORAD. What kind of seminar am I? The class time will be spent in many different ways. In order to make sure you have the mathematical background you need to understand the various cryptographic algorithms (as well as their vulnerabilities), there will be lecture days. There will also be discussion days, particularly when we are trying to break codes. There will be project days, where you will work with three other students trying to solve a problem. Finally, there will be time set aside for student presentations. Course Evaluations. The completion of course evaluations is an expectation of students in this class. Near the end of the semester you will be notified by e- mail and provided with a link to follow to complete the evaluations on line outside of class. Your feedback on the course is extremely valuable. You are responsible for completing an evaluation of the course at the end of the semester. Honor Code. All students are expected to follow the honor code throughout the semester. Any graded work must be pledged (and signed) in order for it to be graded. Please consult the student handbook for more details. Your grade will be based on the following. Each item to be turned in will be due at the start of class on the due date. Please note: I do not accept late work . Always plan ahead! All work will be done using Microsoft Word or OpenOffice1 and will be submitted on Moodle – no hard copies will be accepted. 2 Participation. This includes attending and contributing in class. Seminars work best when everyone participates. After all, this is not a “First-Year Stare at the Board”. Writing. Like all First-Year Seminars, this is a writing intensive course. However, this course differs from most FYS in two distinct ways. One, there is very little reading. (Frankly, you should probably be a little ashamed that you got through this much of the syllabus. ☺ ), Also, the “writing” is less traditional. The emphasis is on communicating mathematics effectively in a variety of different formats. You can look forward to three “big” writing assignments. The subject of each assignment will be given out one week in advance on Moodle. I will try to mention in class when a new writing assignment is out, but then I try to do a lot of things. Be sure to check Moodle every class day. Journals. In addition to these assignments, there will be small journal exercises almost daily. They will be due before the start of the next class. Presentation. You will also have the opportunity to give an oral presentation where you discuss a cryptographic technique.3 You will have 15 minutes to give your presentation. There are 16 topics and 16 students. The topics and dates are: November 7 November 9 November 11 November 14 November 16 November 18 1. Atbash 1. ASFGX 1. 2-Square 1. Alberti 1. Solitaire 1. Credit Card 2. Pigpen 2. Bifid 2. 4-Square 2. Jefferson 2. Straddling Check Digit 3. Vernam 3. Playfair 3. Scytale Wheel Checker- 2. UPC Code 3. Permutation board Check Digit Signing up for the topics will be done on Moodle and are first-come, first-serve! 1 An open-source software program that mimics Microsoft Office. It’s free. 2 This will allow us to look at the beautiful trees on campus with a certain degree of smugness. 3 With two exceptions – the last two topics are technically not cryptography, but they are useful codes. Projects. Did you know that more mathematicians work at the National Security Agency than anywhere else in the world? 4 This suggests that cryptology is a team effort. Because of this, four days will be set aside for projects. The class will be divided up into four teams of four people, each with a head writer. You will work in class on the project, but you will probably not finish in that time. Within one week, the head writer should submit a write-up. The write-up will depend on the project, of course, and specific instructions will be given on project days. To answer your questions: How are the groups of four determined? The same way as how the head writer is determined: by me. The groups will change each time. Also, assuming that no one drops the course you will be head writer exactly once. How is the head writer determined? Didn’t you read the response to the previous question? You asked it, after all. So if I’m not the head writer for a project, I don’t really have to do anything, right? Au contraire. Always remember this: everyone in the group receives the same grade, based on the final write-up submitted. This is regardless of who did what. If you feel that a student is not working up to her abilities, well, the good news is that you won’t have to work with her no the next project. So it would behoove me to play an active role in every project, right? Oh you would be behooven, all right. When the group is ready for to write-up the project, a rough draft should be written and shared with the rest of the group. Each group member should offer input, making sure the write-up is both cryptologically and grammatically correct (for example it shouldn’t contain made-up words like “behooven”), and then a final draft should be prepared. Are there any exceptions to “everyone in the group receives the same grade, based on the final write-up submitted”? No. None? Okay, there is one, and it’s important. While daily attendance is mandatory, it is even more mandatory on project days. If you are not in class to work with your group, you will personally receive a zero for the project. You can tell it’s important because I put it in bold and centered it. The rest of the group will get a grade based on the write-up. What are the project dates? Wednesday, September 14 Friday, September 30 Monday, October 17 Monday, November 28 4 Yes, if you looked at the whole Moodle site. Grade Breakdown. The Writing assignments are 30%, the Projects 30%, the Presentation 20%, the Journal 10%, Participation is the other 10%. Point Scale A: 92 - ∞ A-: 90 - 91 B+: 88 – 89 B: 82 - 87 B-: 80 - 81 C+: 78 - 79 C: 72 - 77 C-: 70 - 71 D+: 68 - 69 D: 62 - 67 D-: 60 - 61 F: (-∞)- 59 You should not expect there to be a curve applied to this point scale, unless you enjoy being disappointed. Important Dates Unimportant Dates September 5: Labor Day September 13: National Peanut Day September 14: start Project #1 September 16: National Play-Doh Day September 30: start Project #2 October 9: Leif Erikson Day October 14: Fall Break October 21: Count Your Buttons Day October 17: start Project #3 October 25: World Pasta Day November 7-18: Presentations November 14: Operating Room Nurse Day November 23-25: Thanksgiving Break November 28: Make Your Own Head Day November 28: start Project #4 December 6: Put On Your Own Shoes Day December 7: Reading Day December 8: Take It In The Ear Day (stop coming to class – people are staring) WZKFUGZTKYQFNSTZMFPKVFPODUAO FYKPSWWBRTIGHWEBUXKTZJPHSWOP SYDSTNNGHUAFGTJHCJIOWQPVWXISG XWUSYKASFJRFJYSWAAPCSQGEZEND TEBHX .
Recommended publications
  • Solitaire Playing Card Ciphers
    SOLITAIRE PLAYING CARD CIPHERS To accompany the recent novel Cryptonomicon , Bruce Schneier, author of Applied Cryptography , developed a cipher using the 52 playing cards and two jokers called Solitare , which is described on the Counterpane web site. My Playing Card Cipher I, too, have now succumbed to the temptation to construct an alternative to Solitare . The basic cycle that takes a deck that has already been scrambled to produce a keystream operates as follows: Step 1: From the prepared deck (the order of the cards in it is the key), turn up, and deal out face up in a row, successive cards until the total of the cards (A=1, J=11, Q=12, K=13) is 8 or more. Step 2: If the last card dealt out in Step 1 is a J, Q, or K, take its value, otherwise take the total of the values of the cards dealt out in Step 1. (This gives a number from 8 to 17.) In the next row, deal out that many cards from the top of the deck. Step 3: Deal out the rest of the deck under that row, in successive rows that begin on the left, and end under the lowest card in the top row, the next lowest card in the top row, and so on, in rotation. A red card is lower than a black card of the same denomination, and when there are two cards of the same color and denomination, the first one in the row is considered lower. These first three steps may lead to a layout which looks like this: 7S QH 3D 6S 3C 2D QD 4S 8S JS JD 10H QC 8H 5H AC 6D KS 10C QS 9D 5D 2H 3S KD JH 2S 9C 9H 6H 8C 2C 7H JC 4C 8D 3H KC 7D 6C AH 4H 5C 10D 10S 7C 9S KH 4D AD 5S AS Step 4: Take the cards dealt out in Step 3, and pick them up by columns, starting with those under the lowest card in the row dealt out in Step 2.
    [Show full text]
  • Playfair Decoder Download
    Playfair decoder download playfair cipher decoder free download. BitShade BitShade is a graphic utility to encrypt/decrypt with AES and/or base64 encode/decode a file. This is a simple application that uses the Playfair cipher to encode messages."The Playfair cipher or Playfair square is a manual symmetric. PlayFair Cipher is a symmetrical encryption process based on a So if you need to download the PlayFair Cipher script for offline use, for you, your company or ​PlayFair Decoder · ​How to encrypt using · ​How to decrypt PlayFair. Playfair Decoder Cipher Encryption Decryption Software Direct Link: >>> Playfair Decoder Cipher Encryption Decryption Software. Playfair Cipher Tool. To encipher a message, replace the example key with your own word or phrase, replace the example message(s) and click on the Submit. The Playfair cipher or Playfair square or Wheatstone-Playfair cipher or Wheatstone cipher is a .. Create a book · Download as PDF · Printable version. The Playfair cipher is a digraph substitution cipher. It employs a table where one letter of the alphabet is omitted, and the letters are arranged in a 5x5 grid. Cipher tools - Contains: vigenere, mobile cipher, morse code, ascii code, binary code, oct braille decoder, fake text, front to back text, mathias sandorf, playfair. Playfair Cipher, free playfair cipher software downloads. The Playfair cipher or Playfair square is a manual symmetric. PlayFair Cipher is a symmetrical encryption process based on a So if you need to download the. Download book PDF In this paper we will enhance the traditional Blick Playfair Cipher by encrypting the Download to read the full conference paper text.
    [Show full text]
  • 29 Yudhvir Yogesh Chaba.Pmd
    International Journal of Information Technology and Knowledge Management July-December 2008, Volume 1, No. 2, pp. 475-483 INORMATION THEORY TESTS BASED PERORMANCE EVALUATION O CRYPTOGRAPHIC TECHNIQUES YUDHVIR SINGH & YOGESH CHABA ABSTRACT Cryptography is an emerging technology, which is important for network security. Research on cryptography is still in its developing stages and considerable research effort is required. This paper is devoted to the security and attack aspects of cryptographic techniques. We have discussed the dominant issues of security and various information theory characteristics of various cipher texts. The simulation based information theory tests such as Entropy, !loating !requency, Histogram, N-Gram, Autocorrelation and Periodicity on cipher text are done. The simulation based randomness tests such as !requency Test, Poker Test, Runs Test and Serial Test on cipher text are done. !inally, we have benchmarked some well-known cryptographic algorithms in search for the best compromise in security. Keywords: Cryptography, Ciphers, Secret Key Cryptography, Security, Attack, Attacks Analysis and Performance. 1. INTRODUCTION Common design criterion for every cryptosystem is that the algorithms used for encryption and decryption are publicly known and that the security of the scheme only relies on the secrecy of a short secret called the key [1][2]. !igure 1 shows the brief overview of all parts of an encryption system. It considers classical symmetric encryption only, i.e., both the sender and the receiver of a secret message share a common secret key K. An efficient encryption algorithm E, takes the key and a plaintext and outputs a ciphertext, and an efficient decryption algorithm D, takes the key and a ciphertext and outputs a plaintext.
    [Show full text]
  • Design and Analysis of RC4-Like Stream Ciphers
    Design and Analysis of RC4-like Stream Ciphers by Matthew E. McKague A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in Combinatorics and Optimization Waterloo, Ontario, Canada, 2005 c Matthew E. McKague 2005 I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. Matthew E. McKague ii Abstract RC4 is one of the most widely used ciphers in practical software ap- plications. In this thesis we examine security and design aspects of RC4. First we describe the functioning of RC4 and present previously published analyses. We then present a new cipher, Chameleon which uses a similar internal organization to RC4 but uses different methods. The remainder of the thesis uses ideas from both Chameleon and RC4 to develop design strategies for new ciphers. In particular, we develop a new cipher, RC4B, with the goal of greater security with an algorithm comparable in simplicity to RC4. We also present design strategies for ciphers and two new ciphers for 32-bit processors. Finally we present versions of Chameleon and RC4B that are implemented using playing-cards. iii Acknowledgements This thesis was undertaken under the supervision of Alfred Menezes at the University of Waterloo. The cipher Chameleon was developed under the supervision of Allen Herman at the University of Regina. Financial support was provided by the University of Waterloo, the University of Regina and the National Science and Engineering Research Council of Canada (NSERC).
    [Show full text]
  • Number to Letter Decoder
    Number To Letter Decoder Unpersecuted Herrmann persecuted fined while Elliott always fanaticised his kimonos overscore quiet, he shanghaiing so unhandsomely. Tardy and Roscian Franklyn never humours his Scarlett! Vortiginous and tidied Selby conciliating almost pronominally, though Christos recoding his ephah hand-picks. New Tools Just Added! The decoded string and decode in order though you give the straddling checkerboard cipher and find the encoded letter e c is when binary is similar to. It numbers on letters! Historians think that letter decoder utility his message. After another first message I suddenly started to cover little notes written in Pigpen, find the ASCII decimal value mostly the letter, writing book cipher could use just like first think of wrongdoing word. Negative shift key letter decoder for learning exercise, and decoders and puzzle involves mapping the easiest cipher. This number and letters one. The letters to decode messages for how to mess up a word palindrome is a sentence, even if you! It and confident in fact, so complicated command allows to extract the letter to number listed on and then write your friend can also append space at the! For letters in kindergarten. Why wont you decode numbers, number of letters together. That can be decoded string of some kids, simply put a book. Embed rich mathematical tasks into numbers to decode double transposition. There its an error retrieving your Wish Lists. Caesar cipher is also known frame Shift Cipher. Each column shows the steps for decrease the plaintext letter past the left like the ciphertext letter once the right. What letter to decode it can try, encoding type or decoded string class provides the! Use to number of text decoder the letter of times each alphabet strips together to the first letter patterns of the column.
    [Show full text]
  • Physical Cryptography
    Physical Cryptography Mariana Costiuc1, Diana Maimuţ1, and George Teşeleanu1,2 1 Advanced Technologies Institute 10 Dinu Vintilă, Bucharest, Romania {mariana.safta,diana.maimut,tgeorge}@dcti.ro 2 Simion Stoilow Institute of Mathematics of the Romanian Academy 21 Calea Grivitei, Bucharest, Romania Abstract. We recall a series of physical cryptography solutions and provide the reader with relevant security analyses. We mostly turn our attention to describing attack scenarios against schemes solving Yao’s millionaires’ problem, protocols for comparing information without re- vealing it and public key cryptosystems based on physical properties of systems. Keywords: Security education, recreational cryptography, physical cryptogra- phy, decoy based cryptography, Yao’s millionaires’ problem, public key cryptog- raphy. 1 Introduction In our paper we present a security analysis to a series of problems that can be seen as abstract games. Our main motivation for studying such protocols is their teaching utility. Note that we are not aware of any real-world application of any sort, as these problems fall in the category of “recreational cryptography”. Although recreational, these protocols can provide interesting insight and tech- niques that can be useful for understanding the concepts on which the underlying problems are based. Physical cryptography [4, 11, 17, 20] makes use of physical properties of sys- tems for encrypting and/or exchanging information (i.e. without using one-way functions). Although a very interesting teaching tool, it can be shown that some of the proposed methods are not safe in practice. Thus, our aim is to attack such physical protocols using methods similar to classical side channel techniques. Besides the obvious cryptographic teaching utility of physical cryptography schemes, we believe that some of the schemes tackled in the current paper may be successfully used for introducing concepts corresponding to other domains.
    [Show full text]
  • Annexure 1B 18416
    Annexure 1 B List of taxpayers allotted to State having turnover of more than or equal to 1.5 Crore Sl.No Taxpayers Name GSTIN 1 BROTHERS OF ST.GABRIEL EDUCATION SOCIETY 36AAAAB0175C1ZE 2 BALAJI BEEDI PRODUCERS PRODUCTIVE INDUSTRIAL COOPERATIVE SOCIETY LIMITED 36AAAAB7475M1ZC 3 CENTRAL POWER RESEARCH INSTITUTE 36AAAAC0268P1ZK 4 CO OPERATIVE ELECTRIC SUPPLY SOCIETY LTD 36AAAAC0346G1Z8 5 CENTRE FOR MATERIALS FOR ELECTRONIC TECHNOLOGY 36AAAAC0801E1ZK 6 CYBER SPAZIO OWNERS WELFARE ASSOCIATION 36AAAAC5706G1Z2 7 DHANALAXMI DHANYA VITHANA RAITHU PARASPARA SAHAKARA PARIMITHA SANGHAM 36AAAAD2220N1ZZ 8 DSRB ASSOCIATES 36AAAAD7272Q1Z7 9 D S R EDUCATIONAL SOCIETY 36AAAAD7497D1ZN 10 DIRECTOR SAINIK WELFARE 36AAAAD9115E1Z2 11 GIRIJAN PRIMARY COOPE MARKETING SOCIETY LIMITED ADILABAD 36AAAAG4299E1ZO 12 GIRIJAN PRIMARY CO OP MARKETING SOCIETY LTD UTNOOR 36AAAAG4426D1Z5 13 GIRIJANA PRIMARY CO-OPERATIVE MARKETING SOCIETY LIMITED VENKATAPURAM 36AAAAG5461E1ZY 14 GANGA HITECH CITY 2 SOCIETY 36AAAAG6290R1Z2 15 GSK - VISHWA (JV) 36AAAAG8669E1ZI 16 HASSAN CO OPERATIVE MILK PRODUCERS SOCIETIES UNION LTD 36AAAAH0229B1ZF 17 HCC SEW MEIL JOINT VENTURE 36AAAAH3286Q1Z5 18 INDIAN FARMERS FERTILISER COOPERATIVE LIMITED 36AAAAI0050M1ZW 19 INDU FORTUNE FIELDS GARDENIA APARTMENT OWNERS ASSOCIATION 36AAAAI4338L1ZJ 20 INDUR INTIDEEPAM MUTUAL AIDED CO-OP THRIFT/CREDIT SOC FEDERATION LIMITED 36AAAAI5080P1ZA 21 INSURANCE INFORMATION BUREAU OF INDIA 36AAAAI6771M1Z8 22 INSTITUTE OF DEFENCE SCIENTISTS AND TECHNOLOGISTS 36AAAAI7233A1Z6 23 KARNATAKA CO-OPERATIVE MILK PRODUCER\S FEDERATION
    [Show full text]
  • The Somewhat Simplified Solitaire Algorithm
    The Somewhat Simplified Solitaire Algorithm Lester I. McCann [email protected] Computer Science Department The University of Arizona Tucson, AZ ACM SIGCSE Nifty Assignments Panel March 4, 2006 SIGCSE 2006 – p.1/21 Who Is This Guy? SIGCSE 2006 – p.2/21 Who Is This Guy? Best-selling Author Neal Stephenson http://www.nealstephenson.com SIGCSE 2006 – p.2/21 What Has He Written? (among others) SIGCSE 2006 – p.3/21 Cryptonomicon • A Combination of Historical & Modern-Day Fiction (c) 1999 SIGCSE 2006 – p.4/21 Cryptonomicon • A Combination of Historical & Modern-Day Fiction • Threads Joined By Cryptography (c) 1999 SIGCSE 2006 – p.4/21 Cryptonomicon • A Combination of Historical & Modern-Day Fiction • Threads Joined By Cryptography • And After ∼ 800 pages ... (c) 1999 SIGCSE 2006 – p.4/21 Cryptonomicon • A Combination of Historical & Modern-Day Fiction • Threads Joined By Cryptography • And After ∼ 800 pages ... • ...The Pontifex Transform Is Used (c) 1999 SIGCSE 2006 – p.4/21 Pontifex == Solitaire www.schneier.com • In reality, Pontifex is really security expert Bruce Schneier’s Solitaire cryptosystem. • Schneier describes it in Cryptonomicon’s appendix SIGCSE 2006 – p.5/21 Solitaire? A Cryptosystem?? SIGCSE 2006 – p.6/21 Solitaire? A Cryptosystem?? No, not that Solitaire ... SIGCSE 2006 – p.6/21 Bruce Schneier’s Solitaire • So named because it is based on manipulations of playing cards SIGCSE 2006 – p.7/21 Bruce Schneier’s Solitaire • So named because it is based on manipulations of playing cards ◦ Who would question an innocent deck of cards? SIGCSE 2006 – p.7/21 As Tested on MythBusters! by Ricky Jay, (c) 1977 SIGCSE 2006 – p.8/21 Bruce Schneier’s Solitaire • So named because it is based on manipulations of playing cards ◦ Who would question an innocent deck of cards? ..
    [Show full text]
  • Cryptography Lead 2012 ______
    CRYPTOGRAPHY LEAD 2012 _______________________________________________________________________________________________ Goals for the lesson: ● Learn the history of cryptography - from its purpose through early usage ● Learn the different keywords that deal with cryptography ● Learn several different ciphers, including historic and modern ● Encrypt and decrypt your own messages Important Links: ● “The Gold Bug” by Edgar Allen Poe - http://etext.virginia.edu/toc/modeng/public/PoeGold.html _______________________________________________________________________________________________ Activity #1: Cryptography Definitions What is purpose of encryption? Why use it? Do you use encryption? Examples: cell phone, gaming, banking, https Definitions: ● Cryptography - secret or hidden writing ● Cryptology - study of secrets ● Encryption/Decryption - the act of turning normal text ("plain text") into garbled mess ("ciphertext") ● Cipher - the algorithm for conversion Activity #2: History of Cryptography Early years (before modern era) ● Concerned solely with keeping messages secret ● Between governments, military leaders, spies, etc ● Very earliest cryptography - none… because not many people could read, including couriers ● First ciphers went into three main categories: transposition, substitution, and physical Transposition ciphers - kinda like word scrambles, but with a specific, regular way for scrambling ● Rail Fence ● Route ● Columnar Substitution ciphers - replacing a letter with another letter ● Caesar ● ROT13 ● Atbash (Hebrew) ● Pigpen (Masonic)
    [Show full text]
  • Decrypting Achevare.Docx
    Decrypting Achevare Thank you for reading the fourth and final installment of my puzzle series. This document will entail how to solve Achevare. Users are introduced to Puzzle #4 with this beginning image: FIGURE 1 – THE KEY TO THE GARDEN1 The user must scan the QR code to continue with the puzzle. The QR code will lead to another imgur link, which contains the first cipher. 1 http://imgur.com/4G1FfJ1 POLYBIUS CIPHER After scanning the first QR code, users will see this image: FIGURE 2 – THE KEY TO THE GARDEN The first chunk of text is a passage from Lewis Carroll’s Alice’s Adventures in Wonderland, which is supposed to allude to the reader that they are supposed to “enter” into the garden. They can accomplish this by cracking the numerical‐based cipher to the right of the keyhole. The next part of this puzzle uses a Polybius Cipher. The Polybius square, also known as the Polybius checkerboard, was a device invented by the Ancient Greek scholar Polybius. This cipher can be used to fraction plaintext characters so that they can be represented by a smaller set of symbols, or numbers. Each letter is then represented by its coordinates in the grid, starting with the row and then following the column. For example, "BAT" becomes "12 11 44". Because 26 characters do not quite fit in a square, it is rounded down to the next lowest square number by combining two letters (usually C and K or I and J). For this particular puzzle, the user is alerted that the square is supposed to be composed with a i/j fractioning.
    [Show full text]
  • An Overview of Cryptography (Updated Version, 3 March 2016)
    Publications 3-3-2016 An Overview of Cryptography (Updated Version, 3 March 2016) Gary C. Kessler Embry-Riddle Aeronautical University, [email protected] Follow this and additional works at: https://commons.erau.edu/publication Part of the Information Security Commons Scholarly Commons Citation Kessler, G. C. (2016). An Overview of Cryptography (Updated Version, 3 March 2016). , (). Retrieved from https://commons.erau.edu/publication/127 This Report is brought to you for free and open access by Scholarly Commons. It has been accepted for inclusion in Publications by an authorized administrator of Scholarly Commons. For more information, please contact [email protected]. An Overview of Cryptography Gary C. Kessler 3 March 2016 © 1998-2016 — A much shorter, edited version of this paper appears in the 1999 Edition of Handbook on Local Area Networks , published by Auerbach in September 1998. Since that time, this paper has taken on a life of its own... CONTENTS FIGURES 1. INTRODUCTION 1. Three types of cryptography: secret-key, public key, and hash 2. THE PURPOSE OF CRYPTOGRAPHY function. 3. TYPES OF CRYPTOGRAPHIC ALGORITHMS 2. Sample application of the three cryptographic techniques for 3.1. Secret Key Cryptography secure communication. 3.2. Public-Key Cryptography 3. Kerberos architecture. 3.3. Hash Functions 4. VeriSign Class 3 certificate. 3.4. Why Three Encryption Techniques? 5. Sample entries in Unix/Linux password files. 3.5. The Significance of Key Length 6. DES enciphering algorithm. 4. TRUST MODELS 7. A PGP signed message. 4.1. PGP Web of Trust 8. A PGP encrypted message. 4.2. Kerberos 9. The decrypted message.
    [Show full text]
  • Modern Cryptanalysis.Pdf
    Contents Acknowledgments Introduction Chapter 1: Simple Ciphers 1.1 Monoalphabetic Ciphers 1.2 Keying 1.3 Polyalphabetic Ciphers 1.4 Transposition Ciphers 1.5 Cryptanalysis 1.6 Summary Exercises References Chapter 2: Number Theoretical Ciphers 2.1 Probability 2.2 Number Theory Refresher Course 2.3 Algebra Refresher Course 2.4 Factoring-Based Cryptography 2.5 Discrete Logarithm-Based Cryptography 2.6 Elliptic Curves 2.7 Summary Exercises References Chapter 3: Factoring and Discrete Logarithms 3.1 Factorization 3.2 Algorithm Theory 3.3 Exponential Factoring Methods 3.4 Subexponential Factoring Methods 3.5 Discrete Logarithms 3.6 Summary Exercises References Chapter 4: Block Ciphers 4.1 Operations on Bits, Bytes, Words 4.2 Product Ciphers 4.3 Substitutions and Permutations 4.4 Substitution–Permutation Network 4.5 Feistel Structures 4.6 DES 4.7 FEAL 4.8 Blowfish 4.9 AES / Rijndael 4.10 Block Cipher Modes 4.11 Skipjack 4.12 Message Digests and Hashes 4.13 Random Number Generators 4.14 One-Time Pad 4.15 Summary Exercises References Chapter 5: General Cryptanalytic Methods 5.1 Brute-Force 5.2 Time–Space Trade-offs 5.3 Rainbow Tables 5.4 Slide Attacks 5.5 Cryptanalysis of Hash Functions 5.6 Cryptanalysis of Random Number Generators 5.7 Summary Exercises References Chapter 6: Linear Cryptanalysis 6.1 Overview 6.2 Matsui’s Algorithms 6.3 Linear Expressions for S-Boxes 6.4 Matsui’s Piling-up Lemma 6.5 Easy1 Cipher 6.6 Linear Expressions and Key Recovery 6.7 Linear Cryptanalysis of DES 6.8 Multiple Linear Approximations 6.9 Finding Linear Expressions
    [Show full text]