Highlights of Computing: From the Ancient Indian Vedic Literature to Modern Practical Cryptography
|
|
- Myles Hamilton
- 5 years ago
- Views:
Transcription
1 Highlights of Computing: From the Ancient Indian Vedic Literature to Modern Practical Cryptography Uwe Wystup February
2 Uwe Wystup - Highlights of Computing 2 Contents 1 Numeral Systems Exercise Vedic Mathematics Introduction The 16 Sutras Jagadguru Swami Sri Bharati Krsna Tirthaji Maharaja Multiplication Exercises Squares Exercises Division Exercises Divisibility Exercises Square Roots (Vargamula) Duplex Process (Dvandvayoga) Square Root of a Perfect Square Exercises Zero Search Methods Newton s Method Problems Rate of Convergence Heron s Square Root Finder Exercise: Divisions without Dividing Credit Cards The Luhn Algorithm Exercises Cryptography The Inventors of the RSA-Algorithm (1978) Method Examples Exercise Definitions Prime Numbers Modulus
3 Uwe Wystup - Highlights of Computing 3 7 Contact Information Numeral Systems 2. Vedic Mathematics 3. Zero Search Methods 4. Credit Cards 5. Cryptography 6. Definitions 1 Numeral Systems Fundamentals: Any integer has a unique representation as a weighted sum of powers of a chosen base. Example: 245 = The Base 10 is in no way special except that The Mayas also used the feet (base=20), see wiki/maya_numerals. Computers use a dual system (power off or on, base 2) or a hexadecimal system (0, 1, 2,..., 9, A, B, C, D, E, F ) for memory size: 1 byte = F F. More on Exercise Write the hexadecimal number CAF E in the dual, decimal and Maya number system.
4 Uwe Wystup - Highlights of Computing 4 2 Vedic Mathematics 1. Introduction 2. Multiplication 3. Squares 4. Division 5. Divisibility 6. Square Roots 2.1 Introduction veda (Sanskrit) means: knowledge Veda Rigveda Samaveda Yajurveda Atharvaveda Upaveda Ayurveda Gandharvaveda Dhanurveda Sthapatyaveda Table 1: Vedas and Upavedas (supplementary vedas)
5 Uwe Wystup - Highlights of Computing The 16 Sutras are part of a Parisista (Appendix) of the Atharvaveda 1. By one more than the one before 2. All from 9 and the last from Vertically and crosswise 4. Transpose and apply 5. If the Samuccaya is the same it is zero 6. If one is in ratio the other is zero 7. By addition and by subtraction 8. By the completion or non-completion 9. Differential calculus 10. By the deficiency 11. Specific and general 12. The remainders by the last digit 13. The ultimate and twice the penultimate 14. By one less than the one before 15. The product of the sum 16. All the multipliers
6 Uwe Wystup - Highlights of Computing Jagadguru Swami Sri Bharati Krsna Tirthaji Maharaja Explained the sutras in his books. Jagadguru Swami Sri Bharati Krsna Tirthaji Maharaja (March, February 2, 1960) was the Jagadguru (literally, teacher of the world; assigned to heads of Hindu mathas) of the Govardhana matha of Puri during He was one of the most significant spiritual figures in Hinduism during the 20th century. He is particularly known for his work on Vedic mathematics. 2.2 Multiplication Example with working base 10: / 3 3 / / 6 10 / 4 = 63 = 42 = 156 = 96 Reason: (x + a)(x + b) = x(x + a + b) + ab Origin of the -sign comes from this method
7 Uwe Wystup - Highlights of Computing 7 Example with working base 100: / 36 = / 99 = / 24 = Other working bases (division case) 100/2= )48 / / 01 = /2= )50 / / 1 6 = 2484 Other working bases (multiplication case) 10 2= )18 / 1 36 / 1 = = )50 / / 2 4 = 2976
8 Uwe Wystup - Highlights of Computing Exercises Multiply the following a b c d e f g h i j k l m
9 Uwe Wystup - Highlights of Computing 9 Multiply the following mentally a b c d e f 8 6 g h i j k l
10 Uwe Wystup - Highlights of Computing 10 Multiply the following mentally a b c d e f g h i j k l Squares Using the sutra Ekadhikena Purvena ( by one more than the previous one ) we get 15 2 = 1 2/25 = 2/25 = = 2 3/25 = 6/25 = = 3 4/25 = 12/25 = = 11 12/25 = 132/25 = 13225
11 Uwe Wystup - Highlights of Computing Exercises Multiply the following mentally a 65 2 b 85 2 c d e f g Division Lots of tricks are available. We do only some highlights. Find the exact decimal representation of Standard methods are cumbersome. Using the Ekadhika Purva Sutra it is easy: Start with 1 and then work from right to left multiplying by /
12 Uwe Wystup - Highlights of Computing 12 A further shortcut is the insight that = The same works for all periodic decimals, e.g = Exercises Compute the exact decimal number of a 1 29 b 1 49
13 Uwe Wystup - Highlights of Computing Divisibility Use Ekadhika as an osculator. For 9, 19, 29, 39 etc. the Ekadhikas are 1, 2, 3, 4, etc. For 3, 13, 23, 33 etc. multiply them by 3 and you get 1, 4, 7, 10, etc. as the Ekadhikas. For 7, 17, 27, 37 etc. multiply them by 7 and you get 5, 12, 19, 26, etc. as the Ekadhikas. For 1, 11, 21, 31 etc. multiply them by 9 and you get 1, 10, 19, 28, etc. as the Ekadhikas. Now test if 112 is divisible by 7 osculating by 5: = 21, which is divisible by 7. Therefore: yes Is 2774 divisible by 19? Osculate by 2:
14 Uwe Wystup - Highlights of Computing 14 One more example: Is divisible by 139? The Ekadhika (osculator) is Answer: yes Exercises Using the osculation method, check if a is divisible by 29 b is divisible by 29 c 4914 is divisible by 39 d is divisible by Square Roots (Vargamula) 1, 5, 6 and 0 at the end of a number reproduce themselves as the last digits in the square. Squares of complements from 10 have the same last digit; thus 1 2 and 9 2 end in 1, 2 2 and 8 2 end in 4 etc. 2, 3, 7 and 8 are out of court altogether. If the given number has n digits, then the square root will contain n or 2 n+1 digits. 2 Systematic computation of an exact square root requires the Dvandvayoga (Duplex) process.
15 Uwe Wystup - Highlights of Computing Duplex Process (Dvandvayoga) D(4) = 4 2 = 16 (1) D(43) = = 24 (2) D(137) = = 23 (3) D(1034) = = 8 (4) D(10345) = = 19 (5) Got it? Square Root of a Perfect Square Find Group in pairs, taking a single extra digit on the left as extra digit ) is the largest integer whose square does not exceed /4 is 4 with remainder 2. The divisor 8 is two times 4. Next we divide 24 by the divisor 8. This gives 3 remainder 0, placed as ) Now we see 09 and we deduct from this the duplex of the last answer figure 3, i.e. 09 D(3) = = 09 9 = 0. This means that the answer is exactly 43.
16 Uwe Wystup - Highlights of Computing ) is the largest integer whose square does not exceed /3 is 3 with remainder 4. The divisor 6 is two times 3. Next we divide 46 by the divisor 6. This gives 7 remainder 4, placed as ) D(7) = 0, so 37 is the exact square root of 1369.
17 Uwe Wystup - Highlights of Computing Exercises Find the square root of the following. a 3136 b 3969 c 5184 d 3721 e 6889 f 1296 Find out how the method extends to 6-digit squares and find the square roof of the numbers a b c d Zero Search Methods 1. Newton s Method 2. Heron s Square Root Finder 3. Exercise: Divisions without Dividing
18 Uwe Wystup - Highlights of Computing 18 Sir Isaac Newton Newton s Method Given a differentiable function f(x) we want to determine ˆx such that f(ˆx) = 0. (6) Starting with x 0 we take the tangent to the curve through the point (x 0, f(x 0 )) and use its intersection with the x-axis x 1 as a new starting point. We repeat this method until no further changes occur. The recursive relation is x n+1 = x n f(x n) f (x n ) (7) and the result is lim x n = ˆx. (8) n
19 Uwe Wystup - Highlights of Computing 19 Newton s Method - graphically Problems Problems can occur due to 1. multiple solutions 2. non convex f, reflection points 3. solutions at extreme values 4. f = 5. pathological cases
20 Uwe Wystup - Highlights of Computing Rate of Convergence Considering all these problems, why is Newton s method still so popular? The reason lies in the rate of convergence. Define the error by From the definition of the Newton iteration, we have e n = x n ˆx (9) e n+1 = x n+1 ˆx = x n f(x n) f (x n ) ˆx = e n f(x n) f (x n ) = e nf (x n ) f(x n ) f (x n ) (10) By Taylor s Theorem, we have 0 = f(ˆx) = f(x n e n ) (11) = f(x n ) e n f (x n ) e2 nf (ξ n ) (12) where ξ n is a number between x n and ˆx. yields A rearrangement of this equation Putting this in (10) leads to e n f (x n ) f(x n ) = 1 2 f (ξ n )e 2 n (13) e n+1 = 1 f (ξ n ) 2 f (x n ) e2 n 1 f (ˆx) 2 f (ˆx) e2 n = Ce 2 n (14) This equation tells us that e n+1 is roughly a constant times e 2 n. This desirable state of affairs is called quadratic convergence.
21 Uwe Wystup - Highlights of Computing Heron s Square Root Finder Goldman Sachs standard interview question: Find the square root of 17. The Greek Engineer Heron who lived sometime between 100 B.C. and 100 A.D. had used the recursion x n+1 = 1 ) (x n + Rxn (15) 2 to find the square root of R. This is based on Newton s method. Taking R = 17 and starting with x 0 = 4 we find x 4 = which is correct to 28 figures. 3.3 Exercise: Divisions without Dividing Use Newton s method to determine an algorithm that computes the reciprocal of a given number x, without ever performing any division. apply your method to compute Credit Cards exact to 8 decimal places. We follow An Introduction to the Mathematics of Money by Lovelock, Mendel and Wright [3]. BIN: Bank Identification Number 9876 }{{} 5432 } 1987 {{ 654}}{{} 3 BIN cardholder ID checksum (16) More on checksum: designed to protect against accidental errors, not malicious attacks. How? Luhn algorithm
22 Uwe Wystup - Highlights of Computing The Luhn Algorithm Hans Peter Luhn The Luhn algorithm or Luhn formula, also known as the modulus 10 or mod 10 algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers and Canadian Social Insurance Numbers. It was created by IBM scientist Hans Peter Luhn and described in US Patent 2,950,048, filed on January 6, 1954, and granted on August 23, 1960.
23 Uwe Wystup - Highlights of Computing }{{} 5432 } 1987 {{ 654}}{{} 3 BIN cardholder ID checksum add up digits Table 2: Example of the Luhn Algorithm Note: 18 counts as 1 + 8, i.e. count only the digits 9876 }{{} 5432 } 1987 {{ 654}}{{} 3 BIN cardholder ID checksum Add the checksum 3 to the 82 and obtain 85. If the new total is divisible by 10, then the credit card number has passed the validation test. our number fails, whereas passes }{{} 5432 } 1987 {{ 654}}{{} 8 BIN cardholder ID checksum Note: Amex has one digit less and starts with the second digit.
24 Uwe Wystup - Highlights of Computing Exercises 1. Implement the Luhn-Algorithm in Excel. 2. Apply the Luhn-Algorithm to your own credit card number. 3. In your group think of a credit card number and ask another group to verify it. 4. Does the Luhn Algorithm pick up any incorrect entry of a single digit? 5. Will the Luhn Algorithm pick up any incorrect transposition of adjacent digits? 5 Cryptography 1. The Inventors of the RSA-Algorithm 2. Method 3. Examples 4. Exercise 5.1 The Inventors of the RSA-Algorithm (1978) Ron Rivest, Adi Shamir, and Leonard Adleman [5]
25 Uwe Wystup - Highlights of Computing 25 Ronald L. Rivest Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science in MIT s Department of Electrical Engineering and Computer Science Adi Shamir Paul and Marlene Borman Professor of Applied Mathematics at Weizmann Institute shamir-prof04.html
26 Uwe Wystup - Highlights of Computing Professor Leonard Adleman Department of Computer Science University of Southern California Method We follow Francis Litterio instructions on crypto/rsa-guts.html. 1. Find P and Q, two large (e.g., 1024-bit) prime numbers. 2. Choose E ]1, P Q[, no prime factors in common with (P 1)(Q 1). 3. Compute D (the multiplicative inverse) such that DE = 1 mod (P 1)(Q 1). (Find an integer X which causes D = (X(P 1)(Q 1) + 1)/E to be an integer, then use that value of D.) 4. The encryption function is C = T E mod P Q, where C is the ciphertext (a positive integer), T is the plaintext (a positive integer). The message being encrypted, T, must be less than the modulus, P Q. 5. The decryption function is T = C D mod P Q, where C is the ciphertext (a positive integer), T is the plaintext (a positive integer). 26
27 Uwe Wystup - Highlights of Computing 27 Your public key is the pair (P Q, E). Your private key is the number D (reveal it to no one). The product P Q is the modulus (often called N in the literature). E is the public exponent. D is the secret exponent. You can publish your public key freely, because there are no known easy methods of calculating D, P, or Q given only (P Q, E) (your public key). If P and Q are each 1024 bits long, the sun will burn out before the most powerful computers presently in existence can factor your modulus into P and Q. 5.3 Examples prime 1 P prime 2 Q public modulus N = P Q P Q (P 1)(Q 1) public exponent E inverse of E D check DE check DE check [DE 1]/[(P 1)(Q 1)] plaintext T encryption function C = T E mod P Q decryption function T = C D mod P Q
28 Uwe Wystup - Highlights of Computing Exercise 1. Set up an RSA tool in Excel/VBA and verify the examples. 2. Take two prime numbers P and Q between 100 and 200, e.g. from http: //primes.utm.edu and compute E and D. 3. Based on a plain text of your choice compute its ciphertext. 4. Give your public key and the ciphertext to the next group and determine the plaintext of another group. 6 Definitions 6.1 Prime Numbers a number that can only be divided evenly by 1 and the number itself. 6.2 Modulus For integers K, R and N the equation K = R mod N (17) means that R is the remainder of the division of K by N or alternatively there exists an integer L such that N L + R = K. (18)
29 Uwe Wystup - Highlights of Computing 29 7 Contact Information Professor Dr. Uwe Wystup Ansua Dutta-Wystup Managing Directors MathFinance AG Mainluststraße Frankfurt am Main Germany Phone MATHFINANCE More papers are available at These slides and handouts are available at References [1] Burden, R. L. and Faires, J. D. (1993). Numerical analysis. PWS Publishing Company. [2] Datta, B. and Singh, A.N. (1962). History of Hindu Mathematics. Asia Publishing House, Calcutta. [3] Lovelock, D., Mendel, M. and Wright, A.L. (2007). An Introduction to the Mathematics of Money, Springer, New York. [4] Maharaja, Bharati Krsna Tirthaji (1992). Vedic Mathematics, Motilal Banarsidass Publishers Private Ltd, Delhi. [5] Rivest, R.L., Shamir, A. and Adleman, L.M. (1978). A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21,2, [6] Schonard, A. and Kokot, C. (2006). Der Matheknüller. matheknueller.de. [7] Williams, K.R. (2002). Vedic Mathematics - Teacher s Manual. Advanced Level. Motilal Banarsidass Publishers Private Limited, Delhi.
30 Index bank identification number (BIN), 21 BIN, 21 division, 11, 13 dual system, 3 duplex, 15 dvandvayoga, 15 ekadhika, 13 Heron s Square Root Finder, 21 hexadecimal system, 3 Luhn algorithm, 22 Maya numerals, 3 modulus, 28 multiplication, 6 Newton s Method, 18 numeral systems, 3 osculator, 13 prime number, 28 quadratic convergence, 20 RSA-Algorithm, 24 square root, 14 squares, 10 sutras, 5 vedas, 4 30
Theme : Cryptography. Instructor : Prof. C Pandu Rangan. Speaker : Arun Moorthy CS
1 C Theme : Cryptography Instructor : Prof. C Pandu Rangan Speaker : Arun Moorthy 93115 CS 2 RSA Cryptosystem Outline of the Talk! Introduction to RSA! Working of the RSA system and associated terminology!
More informationSlides by Kent Seamons and Tim van der Horst Last Updated: Oct 1, 2013
RSA Slides by Kent Seamons and Tim van der Horst Last Updated: Oct 1, 2013 Recap Recap Number theory o What is a prime number? o What is prime factorization? o What is a GCD? o What does relatively prime
More informationNUMBER THEORY AND CODES. Álvaro Pelayo WUSTL
NUMBER THEORY AND CODES Álvaro Pelayo WUSTL Talk Goal To develop codes of the sort can tell the world how to put messages in code (public key cryptography) only you can decode them Structure of Talk Part
More informationRSA. Ramki Thurimella
RSA Ramki Thurimella Public-Key Cryptography Symmetric cryptography: same key is used for encryption and decryption. Asymmetric cryptography: different keys used for encryption and decryption. Public-Key
More informationIntroduction to Modern Cryptography. Benny Chor
Introduction to Modern Cryptography Benny Chor RSA Public Key Encryption Factoring Algorithms Lecture 7 Tel-Aviv University Revised March 1st, 2008 Reminder: The Prime Number Theorem Let π(x) denote the
More informationdit-upm RSA Cybersecurity Cryptography
-upm Cybersecurity Cryptography José A. Mañas < http://www.dit.upm.es/~pepe/> Information Technology Department Universidad Politécnica de Madrid 4 october 2018 public key (asymmetric) public key secret
More informationPublic Key Cryptography
Public Key Cryptography Spotlight on Science J. Robert Buchanan Department of Mathematics 2011 What is Cryptography? cryptography: study of methods for sending messages in a form that only be understood
More informationAddition. Ch1 - Algorithms with numbers. Multiplication. al-khwārizmī. al-khwārizmī. Division 53+35=88. Cost? (n number of bits) 13x11=143. Cost?
Ch - Algorithms with numbers Addition Basic arithmetic Addition ultiplication Division odular arithmetic factoring is hard Primality testing 53+35=88 Cost? (n number of bits) O(n) ultiplication al-khwārizmī
More informationEvaluation of Trigonometric Functions and Their Inverses Kenneth Williams
Evaluation of Trigonometric Functions and Their Inverses Kenneth Williams bstract This paper shows that finding trig functions without a calculator is entirely possible especially when high accuracy is
More informationDiscrete Mathematics GCD, LCM, RSA Algorithm
Discrete Mathematics GCD, LCM, RSA Algorithm Abdul Hameed http://informationtechnology.pk/pucit abdul.hameed@pucit.edu.pk Lecture 16 Greatest Common Divisor 2 Greatest common divisor The greatest common
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by
More informationTi Secured communications
Ti5318800 Secured communications Pekka Jäppinen September 20, 2007 Pekka Jäppinen, Lappeenranta University of Technology: September 20, 2007 Relies on use of two keys: Public and private Sometimes called
More informationRSA Algorithm. Factoring, EulerPhi, Breaking RSA. Çetin Kaya Koç Spring / 14
RSA Algorithm http://koclab.org Çetin Kaya Koç Spring 2018 1 / 14 Well-Known One-Way Functions Discrete Logarithm: Given p, g, and x, computing y in y = g x (mod p) is EASY Given p, g, y, computing x in
More informationEncryption: The RSA Public Key Cipher
Encryption: The RSA Public Key Cipher Michael Brockway March 5, 2018 Overview Transport-layer security employs an asymmetric public cryptosystem to allow two parties (usually a client application and a
More informationMATHEMATICS EXTENDED ESSAY
MATHEMATICS EXTENDED ESSAY How does the RSA algorithm function and why is it used in modern communication? Candidate Name: Murtuza Kainan Candidate Session Number: 003077006 Word Count: 3908 1 P a g e
More information10 Public Key Cryptography : RSA
10 Public Key Cryptography : RSA 10.1 Introduction The idea behind a public-key system is that it might be possible to find a cryptosystem where it is computationally infeasible to determine d K even if
More informationChapter 8 Public-key Cryptography and Digital Signatures
Chapter 8 Public-key Cryptography and Digital Signatures v 1. Introduction to Public-key Cryptography 2. Example of Public-key Algorithm: Diffie- Hellman Key Exchange Scheme 3. RSA Encryption and Digital
More informationCOMP424 Computer Security
COMP424 Computer Security Prof. Wiegley jeffw@csun.edu Rivest, Shamir & Adelman (RSA) Implementation 1 Relatively prime Prime: n, is prime if its only two factors are 1 and n. (and n 1). Relatively prime:
More informationSecurity Issues in Cloud Computing Modern Cryptography II Asymmetric Cryptography
Security Issues in Cloud Computing Modern Cryptography II Asymmetric Cryptography Peter Schwabe October 21 and 28, 2011 So far we assumed that Alice and Bob both have some key, which nobody else has. How
More informationThe RSA Cipher and its Algorithmic Foundations
Chapter 1 The RSA Cipher and its Algorithmic Foundations The most important that is, most applied and most analyzed asymmetric cipher is RSA, named after its inventors Ron Rivest, Adi Shamir, and Len Adleman.
More informationDefinition: For a positive integer n, if 0<a<n and gcd(a,n)=1, a is relatively prime to n. Ahmet Burak Can Hacettepe University
Number Theory, Public Key Cryptography, RSA Ahmet Burak Can Hacettepe University abc@hacettepe.edu.tr The Euler Phi Function For a positive integer n, if 0
More informationThe RSA cryptosystem and primality tests
Mathematics, KTH Bengt Ek November 2015 Supplementary material for SF2736, Discrete mathematics: The RSA cryptosystem and primality tests Secret codes (i.e. codes used to make messages unreadable to outsiders
More informationPublic Key 9/17/2018. Symmetric Cryptography Review. Symmetric Cryptography: Shortcomings (1) Symmetric Cryptography: Analogy
Symmetric Cryptography Review Alice Bob Public Key x e K (x) y d K (y) x K K Instructor: Dr. Wei (Lisa) Li Department of Computer Science, GSU Two properties of symmetric (secret-key) crypto-systems: The
More informationCRYPTOGRAPHY AND NUMBER THEORY
CRYPTOGRAPHY AND NUMBER THEORY XINYU SHI Abstract. In this paper, we will discuss a few examples of cryptographic systems, categorized into two different types: symmetric and asymmetric cryptography. We
More informationCPE 776:DATA SECURITY & CRYPTOGRAPHY. Some Number Theory and Classical Crypto Systems
CPE 776:DATA SECURITY & CRYPTOGRAPHY Some Number Theory and Classical Crypto Systems Dr. Lo ai Tawalbeh Computer Engineering Department Jordan University of Science and Technology Jordan Some Number Theory
More informationPowers in Modular Arithmetic, and RSA Public Key Cryptography
1 Powers in Modular Arithmetic, and RSA Public Key Cryptography Lecture notes for Access 2006, by Nick Korevaar. It was a long time from Mary Queen of Scotts and substitution ciphers until the end of the
More informationNET 311D INFORMATION SECURITY
1 NET 311D INFORMATION SECURITY Networks and Communication Department TUTORIAL 3 : Asymmetric Ciphers (RSA) A Symmetric-Key Cryptography (Public-Key Cryptography) Asymmetric-key (public key cryptography)
More informationLemma 1.2. (1) If p is prime, then ϕ(p) = p 1. (2) If p q are two primes, then ϕ(pq) = (p 1)(q 1).
1 Background 1.1 The group of units MAT 3343, APPLIED ALGEBRA, FALL 2003 Handout 3: The RSA Cryptosystem Peter Selinger Let (R, +, ) be a ring. Then R forms an abelian group under addition. R does not
More informationCS March 17, 2009
Discrete Mathematics CS 2610 March 17, 2009 Number Theory Elementary number theory, concerned with numbers, usually integers and their properties or rational numbers mainly divisibility among integers
More informationduring transmission safeguard information Cryptography: used to CRYPTOGRAPHY BACKGROUND OF THE MATHEMATICAL
THE MATHEMATICAL BACKGROUND OF CRYPTOGRAPHY Cryptography: used to safeguard information during transmission (e.g., credit card number for internet shopping) as opposed to Coding Theory: used to transmit
More informationMathematics of Cryptography
UNIT - III Mathematics of Cryptography Part III: Primes and Related Congruence Equations 1 Objectives To introduce prime numbers and their applications in cryptography. To discuss some primality test algorithms
More informationInnovation and Cryptoventures. Cryptography 101. Campbell R. Harvey. Duke University, NBER and Investment Strategy Advisor, Man Group, plc
Innovation and Cryptoventures Cryptography 101 Campbell R. Harvey Duke University, NBER and Investment Strategy Advisor, Man Group, plc Revised February 6, 2017 1 Definition Cryptography is the science
More informationCryptography. P. Danziger. Transmit...Bob...
10.4 Cryptography P. Danziger 1 Cipher Schemes A cryptographic scheme is an example of a code. The special requirement is that the encoded message be difficult to retrieve without some special piece of
More informationVEDIC MATHEMATICS MANUAL
VEDIC MATHEMATICS MANUAL Material produced by: Resource persons/ Teachers in collaboration with IIVA Introduction of Vedic Maths Benefits of Vedic Maths History of Vedic Maths Sutras & Sub Sutras Chapter
More informationMa/CS 6a Class 3: The RSA Algorithm
Ma/CS 6a Class 3: The RSA Algorithm By Adam Sheffer Reminder: Putnam Competition Signup ends Wednesday 10/08. Signup sheets available in all Sloan classrooms, Math office, or contact Kathy Carreon, kcarreon@caltech.edu.
More informationTHE RSA CRYPTOSYSTEM
THE RSA CRYPTOSYSTEM SILVIA ROBLES Abstract. This paper explores the history and mathematics behind the RSA cryptosystem, including the idea of public key cryptosystems and number theory. It outlines the
More informationPublic Key Algorithms
Public Key Algorithms Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse571-09/
More informationCS483 Design and Analysis of Algorithms
CS483 Design and Analysis of Algorithms Lectures 2-3 Algorithms with Numbers Instructor: Fei Li lifei@cs.gmu.edu with subject: CS483 Office hours: STII, Room 443, Friday 4:00pm - 6:00pm or by appointments
More informationNUMBER THEORY FOR CRYPTOGRAPHY
1 CHAPTER 4. NUMBER THEORY FOR CRYPTOGRAPHY 1 INSTITÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW NUMBER THEORY FOR CRYPTOGRAPHY Contents 1 Number Theory for Cryptography 2 1.1 Linear
More informationLecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya Resources: Kenneth Rosen,
More informationNumber Theory & Modern Cryptography
Number Theory & Modern Cryptography Week 12 Stallings: Ch 4, 8, 9, 10 CNT-4403: 2.April.2015 1 Introduction Increasing importance in cryptography Public Key Crypto and Signatures Concern operations on
More informationImplementation of the RSA algorithm and its cryptanalysis. Abstract. Introduction
Implementation of the RSA algorithm and its cryptanalysis Chandra M. Kota and Cherif Aissi 1 University of Louisiana at Lafayette, College of Engineering Lafayette, LA 70504, USA Abstract Session IVB4
More informationGurgen Khachatrian Martun Karapetyan
34 International Journal Information Theories and Applications, Vol. 23, Number 1, (c) 2016 On a public key encryption algorithm based on Permutation Polynomials and performance analyses Gurgen Khachatrian
More informationExercise Sheet Cryptography 1, 2011
Cryptography 1 http://www.cs.ut.ee/~unruh/crypto1-11/ Exercise Sheet Cryptography 1, 2011 Exercise 1 DES The Data Encryption Standard (DES) is a very famous and widely used block cipher. It maps 64-bit
More informationCIS 551 / TCOM 401 Computer and Network Security
CIS 551 / TCOM 401 Computer and Network Security Spring 2008 Lecture 15 3/20/08 CIS/TCOM 551 1 Announcements Project 3 available on the web. Get the handout in class today. Project 3 is due April 4th It
More informationDiscrete mathematics I - Number theory
Discrete mathematics I - Number theory Emil Vatai (based on hungarian slides by László Mérai) 1 January 31, 2018 1 Financed from the financial support ELTE won from the Higher Education
More informationIntroduction. What is RSA. A Guide To RSA by Robert Yates. Topics
A Guide To RSA by Robert Yates. Topics Introduction...01/09 What is RSA...01/09 Mod-Exponentiation...02/09 Euler's Theorem...03/09 RSA Algorithm...08/09 RSA Security...09/09 Introduction Welcome to my
More informationIntroduction to Modern Cryptography. Benny Chor
Introduction to Modern Cryptography Benny Chor RSA: Review and Properties Factoring Algorithms Trapdoor One Way Functions PKC Based on Discrete Logs (Elgamal) Signature Schemes Lecture 8 Tel-Aviv University
More informationIntroduction to Elliptic Curve Cryptography. Anupam Datta
Introduction to Elliptic Curve Cryptography Anupam Datta 18-733 Elliptic Curve Cryptography Public Key Cryptosystem Duality between Elliptic Curve Cryptography and Discrete Log Based Cryptography Groups
More informationClock Arithmetic and Euclid s Algorithm
Clock Arithmetic and Euclid s Algorithm Lecture notes for Access 2008 by Erin Chamberlain. Earlier we discussed Caesar Shifts and other substitution ciphers, and we saw how easy it was to break these ciphers
More informationOn the Abundance of Large Primes with Small B-smooth values for p-1: An Aspect of Integer Factorization
On the Abundance of Large Primes with Small B-smooth values for p-1: An Aspect of Integer Factorization Parthajit Roy Department of Computer Science, The University of Burdwan, West Bengal, India-71314
More informationNumber Theory in Cryptography
Number Theory in Cryptography Introduction September 20, 2006 Universidad de los Andes 1 Guessing Numbers 2 Guessing Numbers (person x) (last 6 digits of phone number of x) 3 Guessing Numbers (person x)
More informationPublic Key Cryptography. All secret key algorithms & hash algorithms do the same thing but public key algorithms look very different from each other.
Public Key Cryptography All secret key algorithms & hash algorithms do the same thing but public key algorithms look very different from each other. The thing that is common among all of them is that each
More information19. Coding for Secrecy
19. Coding for Secrecy 19.1 Introduction Protecting sensitive information from the prying eyes and ears of others is an important issue today as much as it has been for thousands of years. Government secrets,
More informationQuantum Computing 101. ( Everything you wanted to know about quantum computers but were afraid to ask. )
Quantum Computing 101 ( Everything you wanted to know about quantum computers but were afraid to ask. ) Copyright Chris Lomont, 2004 2 67 1 = 193707721 761838257287 Took American Mathematician Frank Nelson
More informationMATH3302 Cryptography Problem Set 2
MATH3302 Cryptography Problem Set 2 These questions are based on the material in Section 4: Shannon s Theory, Section 5: Modern Cryptography, Section 6: The Data Encryption Standard, Section 7: International
More informationCryptography. pieces from work by Gordon Royle
Cryptography pieces from work by Gordon Royle The set-up Cryptography is the mathematics of devising secure communication systems, whereas cryptanalysis is the mathematics of breaking such systems. We
More informationAnalysis of the RSA Encryption Algorithm
Analysis of the RSA Encryption Algorithm Betty Huang June 16, 2010 Abstract The RSA encryption algorithm is commonly used in public security due to the asymmetric nature of the cipher. The procedure is
More informationNumber Theory: Applications. Number Theory Applications. Hash Functions II. Hash Functions III. Pseudorandom Numbers
Number Theory: Applications Number Theory Applications Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Results from Number Theory have many applications
More informationTHE CUBIC PUBLIC-KEY TRANSFORMATION*
CIRCUITS SYSTEMS SIGNAL PROCESSING c Birkhäuser Boston (2007) VOL. 26, NO. 3, 2007, PP. 353 359 DOI: 10.1007/s00034-006-0309-x THE CUBIC PUBLIC-KEY TRANSFORMATION* Subhash Kak 1 Abstract. This note proposes
More informationThe RSA public encryption scheme: How I learned to stop worrying and love buying stuff online
The RSA public encryption scheme: How I learned to stop worrying and love buying stuff online Anthony Várilly-Alvarado Rice University Mathematics Leadership Institute, June 2010 Our Goal Today I will
More informationPublic-key Cryptography and elliptic curves
Public-key Cryptography and elliptic curves Dan Nichols nichols@math.umass.edu University of Massachusetts Oct. 14, 2015 Cryptography basics Cryptography is the study of secure communications. Here are
More informationAsymmetric Cryptography
Asymmetric Cryptography Chapter 4 Asymmetric Cryptography Introduction Encryption: RSA Key Exchange: Diffie-Hellman General idea: Use two different keys -K and +K for encryption and decryption Given a
More informationChapter 4 Asymmetric Cryptography
Chapter 4 Asymmetric Cryptography Introduction Encryption: RSA Key Exchange: Diffie-Hellman [NetSec/SysSec], WS 2008/2009 4.1 Asymmetric Cryptography General idea: Use two different keys -K and +K for
More informationReview. CS311H: Discrete Mathematics. Number Theory. Computing GCDs. Insight Behind Euclid s Algorithm. Using this Theorem. Euclidian Algorithm
Review CS311H: Discrete Mathematics Number Theory Instructor: Işıl Dillig What does it mean for two ints a, b to be congruent mod m? What is the Division theorem? If a b and a c, does it mean b c? What
More informationSolving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? Alexander May, Maike Ritzenhofen Faculty of Mathematics Ruhr-Universität Bochum, 44780 Bochum,
More informationCryptography IV: Asymmetric Ciphers
Cryptography IV: Asymmetric Ciphers Computer Security Lecture 7 David Aspinall School of Informatics University of Edinburgh 31st January 2011 Outline Background RSA Diffie-Hellman ElGamal Summary Outline
More informationElliptic Curve Cryptography
Elliptic Curve Cryptography Elliptic Curves An elliptic curve is a cubic equation of the form: y + axy + by = x 3 + cx + dx + e where a, b, c, d and e are real numbers. A special addition operation is
More informationPublic Key Cryptography
T H E U N I V E R S I T Y O F B R I T I S H C O L U M B I A Public Key Cryptography EECE 412 1 What is it? Two keys Sender uses recipient s public key to encrypt Receiver uses his private key to decrypt
More information8.1 Principles of Public-Key Cryptosystems
Public-key cryptography is a radical departure from all that has gone before. Right up to modern times all cryptographic systems have been based on the elementary tools of substitution and permutation.
More informationCryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 08 Shannon s Theory (Contd.)
More informationFinal Exam Math 105: Topics in Mathematics Cryptology, the Science of Secret Writing Rhodes College Tuesday, 30 April :30 11:00 a.m.
Final Exam Math 10: Topics in Mathematics Cryptology, the Science of Secret Writing Rhodes College Tuesday, 0 April 2002 :0 11:00 a.m. Instructions: Please be as neat as possible (use a pencil), and show
More informationMy brief introduction to cryptography
My brief introduction to cryptography David Thomson dthomson@math.carleton.ca Carleton University September 7, 2013 introduction to cryptography September 7, 2013 1 / 28 Outline 1 The general framework
More informationPublic-Key Encryption: ElGamal, RSA, Rabin
Public-Key Encryption: ElGamal, RSA, Rabin Introduction to Modern Cryptography Benny Applebaum Tel-Aviv University Fall Semester, 2011 12 Public-Key Encryption Syntax Encryption algorithm: E. Decryption
More informationChapter 11 : Private-Key Encryption
COMP547 Claude Crépeau INTRODUCTION TO MODERN CRYPTOGRAPHY _ Second Edition _ Jonathan Katz Yehuda Lindell Chapter 11 : Private-Key Encryption 1 Chapter 11 Public-Key Encryption Apologies: all numbering
More informationYou separate binary numbers into columns in a similar fashion. 2 5 = 32
RSA Encryption 2 At the end of Part I of this article, we stated that RSA encryption works because it s impractical to factor n, which determines P 1 and P 2, which determines our private key, d, which
More information1 What are Physical Attacks. 2 Physical Attacks on RSA. Today:
Today: Introduction to the class. Examples of concrete physical attacks on RSA A computational approach to cryptography Pseudorandomness 1 What are Physical Attacks Tampering/Leakage attacks Issue of how
More informationRSA Key Extraction via Low- Bandwidth Acoustic Cryptanalysis. Daniel Genkin, Adi Shamir, Eran Tromer
RSA Key Extraction via Low- Bandwidth Acoustic Cryptanalysis Daniel Genkin, Adi Shamir, Eran Tromer Mathematical Attacks Input Crypto Algorithm Key Output Goal: recover the key given access to the inputs
More informationCryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 33 The Diffie-Hellman Problem
More informationUniv.-Prof. Dr. rer. nat. Rudolf Mathar. Written Examination. Cryptography. Tuesday, August 29, 2017, 01:30 p.m.
Cryptography Univ.-Prof. Dr. rer. nat. Rudolf Mathar 1 2 3 4 15 15 15 15 60 Written Examination Cryptography Tuesday, August 29, 2017, 01:30 p.m. Name: Matr.-No.: Field of study: Please pay attention to
More informationAlgorithmic Number Theory and Public-key Cryptography
Algorithmic Number Theory and Public-key Cryptography Course 3 University of Luxembourg March 22, 2018 The RSA algorithm The RSA algorithm is the most widely-used public-key encryption algorithm Invented
More informationNetwork Security Technology Spring, 2018 Tutorial 3, Week 4 (March 23) Due Date: March 30
Network Security Technology Spring, 2018 Tutorial 3, Week 4 (March 23) LIU Zhen Due Date: March 30 Questions: 1. RSA (20 Points) Assume that we use RSA with the prime numbers p = 17 and q = 23. (a) Calculate
More informationLecture V : Public Key Cryptography
Lecture V : Public Key Cryptography Internet Security: Principles & Practices John K. Zao, PhD (Harvard) SMIEEE Amir Rezapoor Computer Science Department, National Chiao Tung University 2 Outline Functional
More informationPublic Key Cryptography
Public Key Cryptography Ali El Kaafarani 1 Mathematical Institute 2 PQShield Ltd. 1 of 44 Outline 1 Public Key Encryption: security notions 2 RSA Encryption Scheme 2 of 44 Course main reference 3 of 44
More informationMathematical Foundations of Public-Key Cryptography
Mathematical Foundations of Public-Key Cryptography Adam C. Champion and Dong Xuan CSE 4471: Information Security Material based on (Stallings, 2006) and (Paar and Pelzl, 2010) Outline Review: Basic Mathematical
More informationRSA Cryptosystem and Factorization
RSA Cryptosystem and Factorization D. J. Guan Department of Computer Science National Sun Yat Sen University Kaoshiung, Taiwan 80424 R. O. C. guan@cse.nsysu.edu.tw August 25, 2003 RSA Cryptosystem was
More informationAn Introduction to Cryptography
An Introduction to Cryptography Spotlight on Science J. Robert Buchanan Department of Mathematics Spring 2008 What is Cryptography? cryptography: study of methods for sending messages in a form that only
More informationWeek 7 An Application to Cryptography
SECTION 9. EULER S GENERALIZATION OF FERMAT S THEOREM 55 Week 7 An Application to Cryptography Cryptography the study of the design and analysis of mathematical techniques that ensure secure communications
More informationElliptic Curve Cryptography
Areas for Discussion Elliptic Curve Cryptography Joseph Spring Department of Computer Science 7COM1027 - Distributed Systems Security Lecture - Elliptic Curves 1 1 Motivation Elliptic Curves Security of
More informationThreshold Cryptography
Threshold Cryptography Cloud Security Mechanisms Björn Groneberg - Summer Term 2013 09.07.2013 Threshold Cryptography 1 ? 09.07.2013 Threshold Cryptography 2 Threshold Cryptography Sharing Secrets Treasure
More informationRSA RSA public key cryptosystem
RSA 1 RSA As we have seen, the security of most cipher systems rests on the users keeping secret a special key, for anyone possessing the key can encrypt and/or decrypt the messages sent between them.
More informationMODULAR ARITHMETIC KEITH CONRAD
MODULAR ARITHMETIC KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic. Applications of modular arithmetic
More informationQuestion: Total Points: Score:
University of California, Irvine COMPSCI 134: Elements of Cryptography and Computer and Network Security Midterm Exam (Fall 2016) Duration: 90 minutes November 2, 2016, 7pm-8:30pm Name (First, Last): Please
More informationCongruence of Integers
Congruence of Integers November 14, 2013 Week 11-12 1 Congruence of Integers Definition 1. Let m be a positive integer. For integers a and b, if m divides b a, we say that a is congruent to b modulo m,
More informationLecture Notes 15 : Voting, Homomorphic Encryption
6.857 Computer and Network Security October 29, 2002 Lecture Notes 15 : Voting, Homomorphic Encryption Lecturer: Ron Rivest Scribe: Ledlie/Ortiz/Paskalev/Zhao 1 Introduction The big picture and where we
More informationIntroduction to Computer Science. Polly Huang NTU EE
Introduction to Computer Science Polly Huang NTU EE http://homepage.ntu.edu.tw/~pollyhuang pollyhuang@ntu.edu.tw Polly Huang, NTU EE Theory of Computation 1 Chapter 12 Theory of Computation Polly Huang,
More informationJong C. Park Computer Science Division, KAIST
Jong C. Park Computer Science Division, KAIST Today s Topics The Euclidean Algorithm The RSA Public-Key Cryptosystem Discrete Mathematics, 2008 2 Computer Science Division, KAIST Note If r = a mod b, then
More informationPartial Key Exposure: Generalized Framework to Attack RSA
Partial Key Exposure: Generalized Framework to Attack RSA Cryptology Research Group Indian Statistical Institute, Kolkata 12 December 2011 Outline of the Talk 1 RSA - A brief overview 2 Partial Key Exposure
More informationCOT 3100 Applications of Discrete Structures Dr. Michael P. Frank
University of Florida Dept. of Computer & Information Science & Engineering COT 3100 Applications of Discrete Structures Dr. Michael P. Frank Slides for a Course Based on the Text Discrete Mathematics
More informationA New Attack on RSA with Two or Three Decryption Exponents
A New Attack on RSA with Two or Three Decryption Exponents Abderrahmane Nitaj Laboratoire de Mathématiques Nicolas Oresme Université de Caen, France nitaj@math.unicaen.fr http://www.math.unicaen.fr/~nitaj
More information