UNIVERSITY OF BIELSKO- BIALA www.ath.bielsko.pl AKADEMIA TECHNICZNO-HUMANISTYCZNA Faculty of Mechanical Engineering and Computer Science.

Slides:

Advertisements

Similar presentations

Functionality of the RSA cipher CrypTool Team November 2010.

Advertisements

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (4) Information Security.

Asymmetric-Key Cryptography

CSE331: Introduction to Networks and Security Lecture 19 Fall 2002.

Public Key Encryption Algorithm

hap8.html#chap8ex5.

Abdullah Sheneamer CS591-F2010 Project of semester Presentation University of Colorado, Colorado Springs Dr. Edward RSA Problem and Inside PK Cryptography.

Dr. Lo’ai Tawalbeh Summer 2007 Chapter 9 – Public Key Cryptography and RSA Dr. Lo’ai Tawalbeh New York Institute of Technology (NYIT) Jordan’s Campus INCS.

Public-key Cryptography Montclair State University CMPT 109 J.W. Benham Spring, 1998.

Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.

Overview of Cryptography Oct. 29, 2002 Su San Im CS Dept. EWU.

Cryptography Lecture 11: Oct 12. Cryptography AliceBob Cryptography is the study of methods for sending and receiving secret messages. adversary Goal:

Public Encryption: RSA

WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.

Cryptography1 CPSC 3730 Cryptography Chapter 9 Public Key Cryptography and RSA.

Private-Key Cryptography traditional private/secret/single key cryptography uses one key shared by both sender and receiver if this key is disclosed communications.

WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.

RSA Encryption William Lu. RSA Background  Basic technique first discovered in 1973 by Clifford Cocks of CESG (part of British GCHQ)  Invented in 1977.

Dr.Saleem Al_Zoubi1 Cryptography and Network Security Third Edition by William Stallings Public Key Cryptography and RSA.

Public Key Algorithms 4/17/2017 M. Chatterjee.

Public Key Cryptography RSA Diffie Hellman Key Management Based on slides by Dr. Lawrie Brown of the Australian Defence Force Academy, University College,

Introduction to Public Key Cryptography

Public Key Model 8. Cryptography part 2.

Public Key Encryption and the RSA Public Key Algorithm CSCI 5857: Encoding and Encryption.

 Introduction  Requirements for RSA  Ingredients for RSA  RSA Algorithm  RSA Example  Problems on RSA.

Page 1 Secure Communication Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation.

Prime Numbers Prime numbers only have divisors of 1 and self

Network and Communications Network Security Department of Computer Science Virginia Commonwealth University.

1 Network Security Lecture 6 Public Key Algorithms Waleed Ejaz

RSA Ramki Thurimella.

T TT The Cryptography Istituto Tecnico Industriale “E.Divini” San Severino Marche.

10/1/2015 9:38:06 AM1AIIS. OUTLINE Introduction Goals In Cryptography Secrete Key Cryptography Public Key Cryptograpgy Digital Signatures 2 10/1/2015.

RSA By: Abhishek Naik Viswanath Chennuru CPSC 624.

Encryption Coursepak little bit in chap 10 of reed.

Cryptography Dec 29. This Lecture In this last lecture for number theory, we will see probably the most important application of number theory in computer.

Public-Key Cryptography CS110 Fall Conventional Encryption.

Midterm Review Cryptography & Network Security

BASIC CRYPTOGRAPHIC CONCEPTS. Public Key Cryptography  Uses two keys for every simplex logical communication link.  Public key  Private key  The use.

Improving Encryption Algorithms Betty Huang Computer Systems Lab

Public Key Encryption CS432 – Security in Computing Copyright © 2005, 2008 by Scott Orr and the Trustees of Indiana University.

Day 37 8: Network Security8-1. 8: Network Security8-2 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key:

Chapter 21 Public-Key Cryptography and Message Authentication.

Darci Miyashiro Math 480 April 29, 2013

Public-Key Encryption

Public Key Cryptography. symmetric key crypto requires sender, receiver know shared secret key Q: how to agree on key in first place (particularly if.

RSA Public Key Crypto System. About RSA Announced in 1977 by Ronald Rivest, Adi Shamir, and Leonard Adleman Relies on the relative ease of finding large.

1 Public-Key Cryptography and Message Authentication.

Cryptography and Network Security Chapter 9 - Public-Key Cryptography

Algebra of RSA codes Yinduo Ma Tong Li. Ron Rivest, Adi Shamir and Leonard Adleman.

The RSA Algorithm. Content Review of Encryption RSA An RSA example.

PUBLIC-KEY CRYPTOGRAPH IT 352 : Lecture 2- part3 Najwa AlGhamdi, MSc – 2012 /1433.

Advanced Database Course (ESED5204) Eng. Hanan Alyazji University of Palestine Software Engineering Department.

Cryptography & Network Security : Topic Seminar Description & Analysis Madhava.N 1RV06SCN05 2 nd Semester M.Tech CNE RVCE RSA ALGORITHM.

Chapter 3 – Public Key Cryptography and RSA (A). Private-Key Cryptography traditional private/secret/single-key cryptography uses one key shared by both.

Public Key Cryptosystems RSA Diffie-Hellman Department of Computer Engineering Sharif University of Technology 3/8/2006.

RSA The algorithm was publicly described in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman at MIT Partly used for PGP (Pretty Good Privacy) to encrypt.

Chapter 9 Public Key Cryptography and RSA. Private-Key Cryptography traditional private/secret/single key cryptography uses one key shared by both sender.

Public Key Algorithms Lesson Introduction ●Modular arithmetic ●RSA ●Diffie-Hellman.

POON TENG HIN.  RSA  Shamir’s Three-Pass Protocol  Other issues.

CS 4803 Fall 04 Public Key Algorithms. Modular Arithmetic n Public key algorithms are based on modular arithmetic. n Modular addition. n Modular multiplication.

Introduction to Cryptography Lecture 9. Public – Key Cryptosystems Each participant has a public key and a private key. It should be infeasible to determine.

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

Lecture 3 (Chapter 9) Public-Key Cryptography and RSA Prepared by Dr. Lamiaa M. Elshenawy 1.

RSA Pubic Key Encryption CSCI 5857: Encoding and Encryption.

CPIS 312 Chapter Four: PUBLIC KEY CRYPTO. Index 2 A.Introduction A.1 Asymmetric Key Cryptography- Introduction A.2 General ideas about the Public Key.

RSA Algorithm Date: 96/10/17 Wun-Long Yang. Outline Introduction to RSA algorithm RSA efficient implementation & profiling.

Public Key Cryptography. Asymmetric encryption is a form of cryptosystem in which Encryption and decryption are performed using the different keys—one.

Analysis of the RSA Encryption Algorithm

Introduction to Algorithms Second Edition by

Presentation transcript:

UNIVERSITY OF BIELSKO- BIALA AKADEMIA TECHNICZNO-HUMANISTYCZNA Faculty of Mechanical Engineering and Computer Science

Safety in Information Technology ( Prof. dr hab. inż. Mikołaj Karpiński) Editor: Georg Schön, Asymmetric Cryptography – RSA (Rivest, Shamir, Adleman) Subject:

Safety in IT Why asymmetric cryptography? Problems with symmetric cryptography: (Managment and distribution of keys) Problems with symmetric cryptography: (Managment and distribution of keys) –Sender and recipient need to exchange secret key. –n participants require n(n −1)/2 keys (6* 10^8 user in 2002 means approx. 1,8*10^17 keys) –Central distributor indicates high effort and is insecure with resprect to trustworthyness (knows everything) Georg Schön (University of Erlangen - Nürnberg) Public-key procedure!! ( only decription key or private key needs to be secure) >> to find the private key out of the public key is impossible (state of the art – but quantum computers?).

Safety in IT Asymmetric communication Georg Schön (University of Erlangen - Nürnberg) AliceBob !Public keys are accessible for everyone! E Message transfer Decripts with his private key UU E Encrypts with Bob´s public key

Safety in IT Public key index Georg Schön (University of Erlangen - Nürnberg) AliceBob NamePublic key Bob Paul Alice No secure keys for the exchange necessary! But: How to make sure the public key is not replaced by a third person? >> (Public key indexes use digital signatures!)

Safety in IT RSA cipher Invented by Ron Rivest, Adi Shamir and Len Adleman Invented by Ron Rivest, Adi Shamir and Len Adleman –Ist security makes use of the difficulty to decompound large numbers in prime factors! Georg Schön (University of Erlangen - Nürnberg) A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. ( A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. ( 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37…)

Safety in IT Prime multiplication Georg Schön (University of Erlangen - Nürnberg) Decimal length: 232Bit length: 768 Current PCs can quickly factor numbers with about “80 digits”. Therefore, practical RSA implementations must use moduli with at least “300 digits” to achieve sufficient security!

Safety in IT Mathematic background 1. The modulo operator 1. The modulo operator 2. Euler´s totient function 2. Euler´s totient function 3. Euler-Fermat theorem 3. Euler-Fermat theorem Georg Schön (University of Erlangen - Nürnberg) DivisorRest

Safety in IT φ Euler’s totient function φ of an integer returns how many positive integers a are coprime and smaller than N. Euler´s totient function Georg Schön (University of Erlangen - Nürnberg) Phi of N is the quantity of positive integers a where:

Safety in IT Euler-Fermat theorem Is a cyclic function (results repeat themselves) Is a cyclic function (results repeat themselves) Example: N = 10 Example: N = 10 a = 3>>>>> a = 3>>>>> a = 7>>>>> a = 7>>>>> No further explanation. Georg Schön (University of Erlangen - Nürnberg)

Safety in IT Key generation Georg Schön (University of Erlangen - Nürnberg) 1.Choose two primes and with 2.Calculate their product: 3.Calculate the value of Euler’s totient function of >>>>> 3 and 7 >>>>> 21 = 3*7 >>>>> 12 = (3-1)*(7-1) Determine D and E: D*E 1 mod 12 (eg. Compound number 1, 13, 25, 37, 49, 61, 73, 85,...) 85 = 5 * 17 (D=5, E=17) (N,E – private key; N,D – public key) For defining D, E also see: extended Euclidean algorithm!

Safety in IT Encryption/Decryption The message that is to be send, shall be 9 The message that is to be send, shall be 9 The user with key E (as encrypt) reckons: 9 E =9 5 = mod 21 Sender transmits encrypted message (18) to the receiver, who uses his private key D to decrypt the message and reckons: 18 D =18 17 = mod 21 (origin message) The user with key E (as encrypt) reckons: 9 E =9 5 = mod 21 Sender transmits encrypted message (18) to the receiver, who uses his private key D to decrypt the message and reckons: 18 D =18 17 = mod 21 (origin message) Georg Schön (University of Erlangen - Nürnberg)

Safety in Information Technology ( Prof. dr hab. inż. Mikołaj Karpiński)