Key Management and Elliptic Curves
|
|
- Cameron Harmon
- 6 years ago
- Views:
Transcription
1 Key Management and Elliptic Curves Key Management Distribution of ublic Keys ublic-key Distribution of Secret Keys Diffie-Hellman Key Echange Elliptic Curves Mathematical foundations Elliptic curves over real numbers, Z p, and GF(2 m ) Key echange using Elliptic Curve Cryptography Elliptic Curve Encryption/Decryption Security of Elliptic Curve Cryptography
2 ublic Announcement of ublic Keys Announcing your key to the world This is what is done by G (pretty good privacy) Weakness: someone can pretend to be you, announce a public key (knowing the private key), and then receive all encrypted sent by others and intended for you We need to look at other approaches with more security
3 ublicly Available Directory Steps in the process Register your name and public key with the directory Authentication occurs at this time The user can replace the public key at any time The entire directory is published periodically Access to the directory can be done electronically This is more secure, but improvements are possible
4 ublic-key Authority - 1 Steps in the process 1. Send a request to the public key authority for the current public key of user B 2. The authority sends a response using its private key; the user is able to decrypt using the authority s public key; the response will include B s public key, the original request and the original timestamp 3. Store B s public key and send an encrypted message that includes your identifier and a nonce 4. User B gets your public key using steps 1 and 2 5. B replies by sending A s nonce as well as a new nonce 6. Return B s nonce to ensure the channel is secure
5 ublic-key Authority - 2
6 ublic-key Certificates - 1 Using an authority is time consuming; an alternative approach is to use certificates We now have a certificate authority 1. Any participant can read a certificate determining the name and public key of the owner 2. Any participant can determine the info originated from the certificate authority 3. Only the certificate authority can update certificates 4. Any participant can determine the currency of the certificate Users can simply echange certificates to share their public keys
7 ublic-key Certificates - 2
8 Try to Answer the Questions Asked How can any participant determine the information originated from the certificate authority? How does the timestamp help eliminate forgery?
9 Simple Secret Key Distribution - 1 Suppose users A and B want to echange a secret key User A generates a public key and private key and contacts B User B generates a secret key and transmits it to A, encrypted with A s public key A decrypts the message to recover the secret key All public/private keys are discarded and communications proceeds using the secret key and symmetric encryption The risk seems minimal since the echange of a secret key happens quickly
10 Simple Secret Key Distribution - 2 If there is an active attack by an eavesdropper E, the following sequence may occur User A generates a public key and private key and contacts B User E intercepts this message, creates another public key and private key and transmits the public key and A s identity to B User B generates a secret key and transmits it to A, encrypted with A s public key User E intercepts this message and learns the secret key E transmits the secret key to A and proceeds to listen in on all subsequent messages What is lacking here is authentication that messages really come from the epected source and not an eavesdropper
11 Distribution with Confidentiality & Authentication We assume that A and B have echanged public keys by one of the schemes outlined earlier A uses B s public key to encrypt and transmit A s identifier and a nonce N 1 that is used to identify this transmission B sends A a message encrypted with A s public key that contains N 1 and a new nonce N 2 generated by B A returns N 2 encrypted to assure B that the message came from A A sends B a secret key encrypted using B s public key, so only B can read it, and A s private key so B can insure the message came from A B can apply decryption to recover the secret key
12 A ictorial View The information echange to insure confidentiality and authenticity is shown below
13 How it works A Hybrid Scheme A public key distribution center (KDC) shares a secret master key with each user Secret session keys are shared encrypted with the master key Advantages of this approach erformance is improved in applications that require frequent session key echanges ublic key encryption is only used occasionally to update the master key This approach is easily overlaid on an eisting KDC scheme
14 The Diffie-Hellman Key Echange This is the first published public key algorithm This approach is only used to echange a secret key Security is based on the difficulty of computing discrete logarithms Here is some mathematical background For prime p we find a primitive root, we call it a For an integer b we find the eponent i such that b a i mod p where 0 <= i <= (p-1) i is the inde, namely ind a,p (b)
15 Steps in the Calculation - A prime q and α, a primitive root of q, are known - User A selects a random integer X A < q and computes Y A = α X A mod q; similarly user B selects a random integer X B < q and computes Y B = α X B mod q - Each side keeps its X value private and make the Y value public - User A computes K = (Y B ) X A mod q - User B computes K = (Y A ) X B mod q - These calculations produce the same secret key - Attacking the secret of user B, the opponent must compute X B = ind α,q (Y B ) - Security lies in the difficulty in calculating discrete logarithms
16 The Algorithm
17 A Sample Calculation Suppose q = 353 and primitive root α = 3. A and B select secret keys X A = 97 and X B = 233. Each computes a public key Y A = 3 97 mod 353 = 40 Y B = mod 353 = 248 After echanging public keys, A and B each computes the secret key for symmetric encryption K = (Y B ) X A mod 353 = mod 353 = 160 K = (Y A ) X B mod 353 = mod 353 = 160 The attacker knows q = 353, α = 3, Y A = 40 and Y B = 248 and must solve 3 a mod 353 = 40 or 3 b = mod 353 = 248; for large values this is very hard
18 Steps in the rocess Here is a communications protocol Of course, this protocol is symmetric, B could initiate the echange
19 Group Work Given q = 71 and primitive root α = 7 Suppose X A = 5, what is A s public key? Suppose X B = 12, what is B s public key? What is the shared private key?
20 Elliptic Curve Arithmetic Use of RSA and problems with RSA RSA is very widely used so codebreakers have concentrated on breaking this scheme To insure security keys have become larger and larger making it more computationally intensive Elliptic Curve Cryptography (ECC) Beginning to challenge the dominance of RSA ECC offers equal security to RSA with smaller keys Confidence in ECC is not as high as RSA since codebreakers have not probed its weaknesses Security in ECC depends on the difficulty of solving the discrete logarithm problem
21 Abelian Groups Remember of definition of abelian groups What is closure? What is associativity? What is an identity element? What are inverse elements? What is commutativity? In Diffie-Hellman keys are generated by eponentiation (repeated multiplication) In ECC keys are generated by multiplication (repeated addition)
22 Elliptic Curves over Real Numbers Elliptic curve equations In general, y 2 + ay + by = 3 + c 2 + d + e We consider, y 2 = 3 + a + b, to plot this curve we need to compute y = 3 + a + b On the net two slides we show two sample elliptical curves where we specify curves by E(a,b) We also have to include the element O, the point at infinity (also known as the zero point) The first curve is E(-1,0), namely y 2 = 3 The second curve is E(1,1), namely y 2 =
23 An Eample Curve E(-1,0)
24 Another Curve E(1,1)
25 Geometric Description of Addition E(a,b) defines a group provided there are no repeated factors, this requires 4a b 2 0 Addition of points and Q O, the infinity point, is the additive identity If has coordinates (,y) then is at (,-y) To add and Q, connect them with a line, the third point of intersection is R = (+Q) This is true for Q itself, Q + -Q = O To add a point to itself, Q + Q = 2Q is the point where the tangent line intersects the curve
26 Algebraic Description of Addition is the slope of the line connecting and Q = (y y Q )/( Q ) R = 2 - Q y R = - y + ( R ) Suppose that + = R R y a = R R y y a y + = ) ( 2 3 2
27 Group Work Consider the curve y 2 = 3 36 over real numbers Let = (-3.5, 9.5) and Q = (-2.5, 8.5), find + Q Find 2
28 Our sample curve Elliptic Curves over Z p y 2 mod p = ( 3 + a + b) mod p one solution: a = 1, b = 1, = 9, y = 7, p = 23 Finding more points If p = 23, a = 1, b = 1, the curve is E 23 (1,1) The net slide shows the points that satisfy the equation, including the (9,7) above A plot of these points is also shown Notice that the points (ecept for one) are symmetric about the line y = 11.5
29 Elliptic Curve E 23 (1,1)
30 Group Work - 1 Given E 11 (1,6) defined by y 2 = Find all points by calculating the right hand side for all values of
31 A Sample Calculation - 1 Additive inverse + - = O, let = (13,7), - = (13,-7) = (13,16) why? Addition = + = = = Q if p y a Q pif y y p y y p Q Q R R Q R mod 2 3 mod ) mod ) ( ( ) mod ( 2 2 λ λ λ
32 A Sample Calculation - 2 Multiplication: 4 = An eample of simple addition y R λ = R = (3,10) and 7 10 = mod 23 = 9 3 = ( ) mod 23 (11(3 17) 10) mod 23 Q 6 3 = (9,7) mod 23 = 109mod 23 = 11 = 17 = 164 mod 23 = 20
33 Group Work - 2 Given E 11 (1,6) defined by y 2 = Give G = (2, 7) find multiples 2G to 13G
34 Elliptic curves over GF(2 m ) The basic equation is y 2 + y = 3 + a 2 + b if is (, y ) then is (, + y ) if Q is ( Q, y Q ) and ±Q then if R = 2 then + + = + + = = Q Q R R R Q R y y y y a λ λ λ λ ) ( 2 R R R y y a + = + + = + + = λ λ λ λ 2 2 1) (
35 Elliptic Curve Cryptography An Overview Given Q = k where Q, are in E p (a,b) and k < p It is relatively easy to calculate Q given k and It is difficult to determine k given Q and This is the discrete log problem for elliptic curves An eample calculation Let = (16,5) and Q = (4,5) in E 23 (9,7) defined by the equation y 2 mod 23 = ( ) mod 23 To find k we can use a brute force approach: 2 = (20,20), 3 = (14, 14),, 9 = (4, 5) so k = 9 For large numbers this approach is impractical
36 Key Echange using Elliptic Curves Steps of the key echange Select a large integer q to define E q (a, b) The order n of a point G is the smallest positive integer n such that ng = O. ick a base point G in E q (a, b) with a very large order G and E q (a, b) are parameters known to all participants A selects n A < n its private key; A calculates public key A = n A G in E q (a, b) In a similar manner B selects n B and generates B A generates secret key K = n A B and B generates secret key K = n B A ; these values are equal
37 ECC Key Echange
38 A Numeric Eample The values and calculations = 211 in E p (0, -4) and G = (2, 2) One calculates 240 G = O A sets n A = 121 and A = 121(2, 2) = (115, 48) B sets n B = 203 and A = 203(2, 2) = (130, 203) The shared key is 121(130, 203) = 203(115, 48) = (161, 69)
39 Group Work Suppose we are using E 11 (1,6) Let G = (10,2) Suppose A selects n A = 5, find A s public key Suppose B selects n B = 7, find B s public key Show how both A and B find the secret key
40 Elliptic Curve Encryption/Decryption The initial calculations are similar to the key echange Select a large integer q to define E q (a, b) and a base point G in E q (a, b) with a very large order A selects n A, its private key, and calculates public key A = n A G in E q (a, b); B selects n B and calculates B To encrypt m and send to B, A selects a random positive integer k and generates the pair C m C m = (kg, m + k B ) B decrypts by multiplying the first point by B s secret key and subtracting the result from the second point m + k B n B (kg) = m
41 An Eample Calculation Give p = 751 and E p (-1, 188) The curve is y 2 = Let G be (0, 376) Suppose the message m = (562, 201) A selects k = 386 and uses B = (201, 5) Calculating 386(0, 376) = (676, 558) And (562, 201) + 386(201, 5) = (385, 328) So A sends [(676, 558), (385, 328)]
42 Group Work Given E 11 (1,6), G = (2, 7) and n B = 7 Find B s public key B A wants to send m = (10, 9) and k = 3; find C m Show the calculations that let B recover m
43 Security of Elliptic Curve Cryptography ollard rho is the fastest method known to find discrete algorithms ECC can have the same level of security as RSA with smaller key sizes
Key Management and Distribution
CPE 542: CRYPTOGRAPHY & NETWORK SECURITY Chapter 10 Key Management; Other Public Key Cryptosystems Dr. Lo ai Tawalbeh Computer Engineering Department Jordan University of Science and Technology Jordan
More informationThis chapter continues our overview of public-key cryptography systems (PKCSs), and begins with a description of one of the earliest and simplest
1 2 3 This chapter continues our overview of public-key cryptography systems (PKCSs), and begins with a description of one of the earliest and simplest PKCS, Diffie- Hellman key exchange. This first published
More informationCryptography and Network Security Chapter 10. Fourth Edition by William Stallings
Cryptography and Network Security Chapter 10 Fourth Edition by William Stallings Chapter 10 Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would venture out of the
More informationCryptography and Network Security
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown Chapter 10 Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would
More information1. Diffie-Hellman Key Exchange
e-pgpathshala Subject : Computer Science Paper: Cryptography and Network Security Module: Diffie-Hellman Key Exchange Module No: CS/CNS/26 Quadrant 1 e-text Cryptography and Network Security Objectives
More informationChapter 9. Public Key Cryptography, RSA And Key Management
Chapter 9 Public Key Cryptography, RSA And Key Management RSA by Rivest, Shamir & Adleman of MIT in 1977 The most widely used public-key cryptosystem is RSA. The difficulty of attacking RSA is based on
More informationPublic Key Cryptography and RSA
Public Key Cryptography and RSA Major topics Principles of public key cryptosystems The RSA algorithm The Security of RSA Motivations A public key system is asymmetric, there does not have to be an exchange
More informationAbhijith Chandrashekar and Dushyant Maheshwary
By Abhijith Chandrashekar and Dushyant Maheshwary Introduction What are Elliptic Curves? Curve with standard form y 2 = x 3 + ax + b a, b ϵ R Characteristics of Elliptic Curve Forms an abelian group Symmetric
More informationChapter 7 Public Key Cryptography and Digital Signatures
Chapter 7 Public Key Cryptography and Digital Signatures Every Egyptian received two names, which were known respectively as the true name and the good name, or the great name and the little name; and
More informationElliptic Curve Public Key Cryptography
Why? Elliptic Curve Public Key Cryptography ECC offers greater security for a given key size. Why? Elliptic Curve Public Key Cryptography ECC offers greater security for a given key size. The smaller key
More informationThe most important development from the work on public-key cryptography is the digital signature. Message authentication protects two parties who
1 The most important development from the work on public-key cryptography is the digital signature. Message authentication protects two parties who exchange messages from any third party. However, it does
More informationLecture Note 6 KEY MANAGEMENT. Sourav Mukhopadhyay
Lecture Note 6 KEY MANAGEMENT Sourav Mukhopadhyay Cryptography and Network Security - MA61027 Key Management There are actually two distinct aspects to the use of public-key encryption in this regard:
More informationSecurity Handshake Pitfalls
Hello Challenge R f(k, R f(k, R Problems: 1. Authentication is not mutual only authenticates Anyone can send the challenge R. f(k, R Problems: 1. Authentication is not mutual only authenticates Anyone
More informationECC Elliptic Curve Cryptography. Foundations of Cryptography - ECC pp. 1 / 31
ECC Elliptic Curve Cryptography Foundations of Cryptography - ECC pp. 1 / 31 Elliptic Curve an elliptic curve E is a smooth, projective, algebraic curve defined by the following equation: y 2 3 2 a xy
More informationUnderstanding Cryptography by Christof Paar and Jan Pelzl. Chapter 9 Elliptic Curve Cryptography
Understanding Cryptography by Christof Paar and Jan Pelzl www.crypto-textbook.com Chapter 9 Elliptic Curve Cryptography ver. February 2nd, 2015 These slides were prepared by Tim Güneysu, Christof Paar
More informationPublic-Key Cryptography. Professor Yanmin Gong Week 3: Sep. 7
Public-Key Cryptography Professor Yanmin Gong Week 3: Sep. 7 Outline Key exchange and Diffie-Hellman protocol Mathematical backgrounds for modular arithmetic RSA Digital Signatures Key management Problem:
More informationChapter 9 Public Key Cryptography. WANG YANG
Chapter 9 Public Key Cryptography WANG YANG wyang@njnet.edu.cn Content Introduction RSA Diffie-Hellman Key Exchange Introduction Public Key Cryptography plaintext encryption ciphertext decryption plaintext
More informationDr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010
CS 494/594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010 1 Public Key Cryptography Modular Arithmetic RSA
More informationUNIT III 3.1DISCRETE LOGARITHMS
UNIT III Discrete Logarithms Computing discrete logs Diffie-Hellman key exchange ElGamal Public key cryptosystems Hash functions Secure Hash - MD5 Digital signatures RSA ElGamal Digital signature scheme.
More informationPrime Field over Elliptic Curve Cryptography for Secured Message Transaction
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IMPACT FACTOR: 5.258 IJCSMC,
More informationKey Exchange. References: Applied Cryptography, Bruce Schneier Cryptography and Network Securiy, Willian Stallings
Key Exchange References: Applied Cryptography, Bruce Schneier Cryptography and Network Securiy, Willian Stallings Outlines Primitives Root Discrete Logarithm Diffie-Hellman ElGamal Shamir s Three Pass
More information10.1 Introduction 10.2 Asymmetric-Key Cryptography Asymmetric-Key Cryptography 10.3 RSA Cryptosystem
[Part 2] Asymmetric-Key Encipherment Asymmetric-Key Cryptography To distinguish between two cryptosystems: symmetric-key and asymmetric-key; To discuss the RSA cryptosystem; To introduce the usage of asymmetric-key
More informationCSCI 454/554 Computer and Network Security. Topic 5.2 Public Key Cryptography
CSCI 454/554 Computer and Network Security Topic 5.2 Public Key Cryptography Outline 1. Introduction 2. RSA 3. Diffie-Hellman Key Exchange 4. Digital Signature Standard 2 Introduction Public Key Cryptography
More informationDiffie-Hellman. Part 1 Cryptography 136
Diffie-Hellman Part 1 Cryptography 136 Diffie-Hellman Invented by Williamson (GCHQ) and, independently, by D and H (Stanford) A key exchange algorithm o Used to establish a shared symmetric key Not for
More informationOutline. CSCI 454/554 Computer and Network Security. Introduction. Topic 5.2 Public Key Cryptography. 1. Introduction 2. RSA
CSCI 454/554 Computer and Network Security Topic 5.2 Public Key Cryptography 1. Introduction 2. RSA Outline 3. Diffie-Hellman Key Exchange 4. Digital Signature Standard 2 Introduction Public Key Cryptography
More informationChapter 3 Public Key Cryptography
Cryptography and Network Security Chapter 3 Public Key Cryptography Lectured by Nguyễn Đức Thái Outline Number theory overview Public key cryptography RSA algorithm 2 Prime Numbers A prime number is an
More informationCryptography and Network Security Chapter 14
Cryptography and Network Security Chapter 14 Fifth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 14 Key Management and Distribution No Singhalese, whether man or woman, would venture
More informationDistributed Systems. 26. Cryptographic Systems: An Introduction. Paul Krzyzanowski. Rutgers University. Fall 2015
Distributed Systems 26. Cryptographic Systems: An Introduction Paul Krzyzanowski Rutgers University Fall 2015 1 Cryptography Security Cryptography may be a component of a secure system Adding cryptography
More informationOutline. Public Key Cryptography. Applications of Public Key Crypto. Applications (Cont d)
Outline AIT 682: Network and Systems Security 1. Introduction 2. RSA 3. Diffie-Hellman Key Exchange 4. Digital Signature Standard Topic 5.2 Public Key Cryptography Instructor: Dr. Kun Sun 2 Public Key
More informationPublic Key Algorithms
Public Key Algorithms CS 472 Spring 13 Lecture 6 Mohammad Almalag 2/19/2013 Public Key Algorithms - Introduction Public key algorithms are a motley crew, how? All hash algorithms do the same thing: Take
More informationCryptography and Network Security. Sixth Edition by William Stallings
Cryptography and Network Security Sixth Edition by William Stallings Chapter 13 Digital Signatures To guard against the baneful influence exerted by strangers is therefore an elementary dictate of savage
More informationPublic Key Cryptography
graphy CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L07, Steve/Courses/2011/S2/CSS322/Lectures/rsa.tex,
More informationPublic Key Algorithms
CSE597B: Special Topics in Network and Systems Security Public Key Cryptography Instructor: Sencun Zhu The Pennsylvania State University Public Key Algorithms Public key algorithms RSA: encryption and
More informationPublic-key encipherment concept
Date: onday, October 21, 2002 Prof.: Dr Jean-Yves Chouinard Design of Secure Computer Systems CSI4138/CEG4394 Notes on Public Key Cryptography Public-key encipherment concept Each user in a secure communication
More informationSEC 1: Elliptic Curve Cryptography
Standards for Efficient Cryptography SEC 1: Elliptic Curve Cryptography Contact: Certicom Research Daniel R. L. Brown (dbrown@certicom.com) May 21, 2009 Version 2.0 c 2009 Certicom Corp. License to copy
More informationCryptographic Systems
CPSC 426/526 Cryptographic Systems Ennan Zhai Computer Science Department Yale University Recall: Lec-10 In lec-10, we learned: - Consistency models - Two-phase commit - Consensus - Paxos Lecture Roadmap
More informationLecture 6: Overview of Public-Key Cryptography and RSA
1 Lecture 6: Overview of Public-Key Cryptography and RSA Yuan Xue In this lecture, we give an overview to the public-key cryptography, which is also referred to as asymmetric cryptography. We will first
More informationContents Digital Signatures Digital Signature Properties Direct Digital Signatures
Contents Digital Signatures... 197 Digital Signature Properties... 198 Direct Digital Signatures... 198 199...قابلداوری Arbitrated Digital Signatures Arbitrated Digital Signature Technaiques... 200 Authentication
More informationCSE 3461/5461: Introduction to Computer Networking and Internet Technologies. Network Security. Presentation L
CS 3461/5461: Introduction to Computer Networking and Internet Technologies Network Security Study: 21.1 21.5 Kannan Srinivasan 11-27-2012 Security Attacks, Services and Mechanisms Security Attack: Any
More informationComputer Security. 08. Cryptography Part II. Paul Krzyzanowski. Rutgers University. Spring 2018
Computer Security 08. Cryptography Part II Paul Krzyzanowski Rutgers University Spring 2018 March 23, 2018 CS 419 2018 Paul Krzyzanowski 1 Block ciphers Block ciphers encrypt a block of plaintext at a
More informationChapter 3. Principles of Public-Key Cryptosystems
Chapter 3 Principles of Public-Key Cryptosystems The concept of public-key cryptography evolved from an attempt to attack two of the most difficult problems associated with symmetric encryption. key distribution
More informationLecture 2 Applied Cryptography (Part 2)
Lecture 2 Applied Cryptography (Part 2) Patrick P. C. Lee Tsinghua Summer Course 2010 2-1 Roadmap Number theory Public key cryptography RSA Diffie-Hellman DSA Certificates Tsinghua Summer Course 2010 2-2
More informationPROTECTING CONVERSATIONS
PROTECTING CONVERSATIONS Basics of Encrypted Network Communications Naïve Conversations Captured messages could be read by anyone Cannot be sure who sent the message you are reading Basic Definitions Authentication
More informationSpring 2010: CS419 Computer Security
Spring 2010: CS419 Computer Security Vinod Ganapathy Lecture 7 Topic: Key exchange protocols Material: Class handout (lecture7_handout.pdf) Chapter 2 in Anderson's book. Today s agenda Key exchange basics
More informationCS 6324: Information Security More Info on Key Establishment: RSA, DH & QKD
ERIK JONSSON SCHOOL OF ENGINEERING & COMPUTER SCIENCE Cyber Security Research and Education Institute CS 6324: Information Security Dr. Junia Valente Department of Computer Science The University of Texas
More informationKeywords Session key, asymmetric, digital signature, cryptosystem, encryption.
Volume 3, Issue 7, July 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Review of Diffie
More informationCryptographic Concepts
Outline Identify the different types of cryptography Learn about current cryptographic methods Chapter #23: Cryptography Understand how cryptography is applied for security Given a scenario, utilize general
More informationPUBLIC KEY CRYPTO. Anwitaman DATTA SCSE, NTU Singapore CX4024. CRYPTOGRAPHY & NETWORK SECURITY 2018, Anwitaman DATTA
PUBLIC KEY CRYPTO Anwitaman DATTA SCSE, NTU Singapore Acknowledgement: The following lecture slides are based on, and uses material from the text book Cryptography and Network Security (various eds) by
More informationCryptography and Network Security Chapter 13. Digital Signatures & Authentication Protocols
Cryptography and Network Security Chapter 13 Digital Signatures & Authentication Protocols Digital Signatures have looked at message authentication but does not address issues of lack of trust digital
More informationComputer Security 3/23/18
s s encrypt a block of plaintext at a time and produce ciphertext Computer Security 08. Cryptography Part II Paul Krzyzanowski DES & AES are two popular block ciphers DES: 64 bit blocks AES: 128 bit blocks
More informationCSC 474/574 Information Systems Security
CSC 474/574 Information Systems Security Topic 2.5 Public Key Algorithms CSC 474/574 Dr. Peng Ning 1 Public Key Algorithms Public key algorithms covered in this class RSA: encryption and digital signature
More informationOverview. Public Key Algorithms I
Public Key Algorithms I Dr. Arjan Durresi Louisiana State University Baton Rouge, LA 70810 Durresi@csc.lsu.Edu These slides are available at: http://www.csc.lsu.edu/~durresi/csc4601-04/ Louisiana State
More informationCS669 Network Security
UNIT II PUBLIC KEY ENCRYPTION Uniqueness Number Theory concepts Primality Modular Arithmetic Fermet & Euler Theorem Euclid Algorithm RSA Elliptic Curve Cryptography Diffie Hellman Key Exchange Uniqueness
More informationElliptic Curves as Tool for Public Key Cryptography
Research Inventy: International Journal Of Engineering And Science Vol.5, Issue 6 (June 2015), PP 06-12 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com Elliptic Curves as Tool for Public
More informationComputer Security: Principles and Practice
Computer Security: Principles and Practice Chapter 2 Cryptographic Tools First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Cryptographic Tools cryptographic algorithms
More informationPublic Key Cryptography, OpenPGP, and Enigmail. 31/5/ Geek Girls Carrffots GVA
Public Key Cryptography, OpenPGP, and Enigmail Cryptography is the art and science of transforming (encrypting) a message so only the intended recipient can read it Symmetric Cryptography shared secret
More informationInnovation and Cryptoventures. Digital Signatures. Campbell R. Harvey. Duke University, NBER and Investment Strategy Advisor, Man Group, plc
Innovation and Cryptoventures Digital Signatures Campbell R. Harvey Duke University, NBER and Investment Strategy Advisor, Man Group, plc January 30, 2017 Definition Cryptography is the science of communication
More informationInnovation and Cryptoventures. Digital Signatures. Campbell R. Harvey. Duke University, NBER and Investment Strategy Advisor, Man Group, plc
Innovation and Cryptoventures Digital Signatures Campbell R. Harvey Duke University, NBER and Investment Strategy Advisor, Man Group, plc January 30, 2017 Definition Cryptography is the science of communication
More informationGrenzen der Kryptographie
Microsoft Research Grenzen der Kryptographie Dieter Gollmann Microsoft Research 1 Summary Crypto does not solve security problems Crypto transforms security problems Typically, the new problems relate
More informationCristina Nita-Rotaru. CS355: Cryptography. Lecture 17: X509. PGP. Authentication protocols. Key establishment.
CS355: Cryptography Lecture 17: X509. PGP. Authentication protocols. Key establishment. Public Keys and Trust Public Key:P A Secret key: S A Public Key:P B Secret key: S B How are public keys stored How
More informationCS3235 Seventh set of lecture slides
CS3235 Seventh set of lecture slides Hugh Anderson National University of Singapore School of Computing October, 2007 Hugh Anderson CS3235 Seventh set of lecture slides 1 Warp 9... Outline 1 Public Key
More informationNotes for Lecture 10
COS 533: Advanced Cryptography Lecture 10 (October 16, 2017) Lecturer: Mark Zhandry Princeton University Scribe: Dylan Altschuler Notes for Lecture 10 1 Motivation for Elliptic Curves Diffie-Hellman For
More informationThe Application of Elliptic Curves Cryptography in Embedded Systems
The Application of Elliptic Curves Cryptography in Embedded Systems Wang Qingxian School of Computer Science and Engineering University of Electronic Science and Technology China Introduction to Cryptography
More informationPublic-Key Cryptography
Multimedia Security Mauro Barni University of Siena Private-Key Cryptography Traditional secret key cryptography uses one key shared by both sender and receiver if this key is disclosed communication secrecy
More information(a) Symmetric model (b) Cryptography (c) Cryptanalysis (d) Steganography
Code No: RR410504 Set No. 1 1. Write short notes on (a) Symmetric model (b) Cryptography (c) Cryptanalysis (d) Steganography 3. (a) Illustrate Diffie-hellman Key Exchange scheme for GF(P) [6M] (b) Consider
More informationKey Management and Distribution
2 and Distribution : Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 20 December 2015 css441y15s2l10, Steve/Courses/2015/s2/css441/lectures/key-management-and-distribution.tex,
More informationWhat did we talk about last time? Public key cryptography A little number theory
Week 4 - Friday What did we talk about last time? Public key cryptography A little number theory If p is prime and a is a positive integer not divisible by p, then: a p 1 1 (mod p) Assume a is positive
More informationNumber Theory and RSA Public-Key Encryption
Number Theory and RSA Public-Key Encryption Dr. Natarajan Meghanathan Associate Professor of Computer Science Jackson State University E-mail: natarajan.meghanathan@jsums.edu CIA Triad: Three Fundamental
More informationCT30A8800 Secured communications
CT30A8800 Secured communications Pekka Jäppinen October 31, 2007 Pekka Jäppinen, Lappeenranta University of Technology: October 31, 2007 Secured Communications: Key exchange Schneier, Applied Cryptography:
More informationSSH PK Authentication and Auto login configuration for Chassis Management Controller
SSH PK Authentication and Auto login configuration for Chassis Management Controller Dell technical white paper Dell Engineering May 2016 Author: Elangovan G Revisions Date August 2013 May 2016 Description
More informationCryptography and Network Security. Sixth Edition by William Stallings
Cryptography and Network Security Sixth Edition by William Stallings Chapter 9 Public Key Cryptography and RSA Misconceptions Concerning Public-Key Encryption Public-key encryption is more secure from
More informationIntroduction to Cryptography and Security Mechanisms. Abdul Hameed
Introduction to Cryptography and Security Mechanisms Abdul Hameed http://informationtechnology.pk Before we start 3 Quiz 1 From a security perspective, rather than an efficiency perspective, which of the
More informationCryptography Lecture 9 Key distribution and trust, Elliptic curve cryptography
Cryptography Lecture 9 Key distribution and trust, Elliptic curve cryptography Key Management The first key in a new connection or association is always delivered via a courier Once you have a key, you
More informationUnderstanding Cryptography A Textbook for Students and Practitioners by Christof Paar and Jan Pelzl. Chapter 6 Introduction to Public-Key Cryptography
Understanding Cryptography A Textbook for Students and Practitioners by Christof Paar and Jan Pelzl www.crypto-textbook.com Chapter 6 Introduction to Public-Key Cryptography ver. November 18, 2010 These
More informationCryptography and Network Security Chapter 13. Fourth Edition by William Stallings. Lecture slides by Lawrie Brown
Cryptography and Network Security Chapter 13 Fourth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 13 Digital Signatures & Authentication Protocols To guard against the baneful influence
More informationKey Management and Distribution
Key Management and Distribution 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-14/
More informationIntroduction to Cryptography and Security Mechanisms: Unit 5. Public-Key Encryption
Introduction to Cryptography and Security Mechanisms: Unit 5 Public-Key Encryption Learning Outcomes Explain the basic principles behind public-key cryptography Recognise the fundamental problems that
More informationT Cryptography and Data Security
T-79.159 Cryptography and Data Security Lecture 10: 10.1 Random number generation 10.2 Key management - Distribution of symmetric keys - Management of public keys Kaufman et al: Ch 11.6; 9.7-9; Stallings:
More informationElliptic Curve Cryptosystem
UDC 681.8 Elliptic Curve Cryptosystem VNaoya Torii VKazuhiro Yokoyama (Manuscript received June 6, 2000) This paper describes elliptic curve cryptosystems (ECCs), which are expected to become the next-generation
More informationPublic Key Cryptography
Public Key Cryptography Giuseppe F. Italiano Universita` di Roma Tor Vergata italiano@disp.uniroma2.it Motivation Until early 70s, cryptography was mostly owned by government and military Symmetric cryptography
More informationT Cryptography and Data Security
T-79.4501 Cryptography and Data Security Lecture 10: 10.1 Random number generation 10.2 Key management - Distribution of symmetric keys - Management of public keys Stallings: Ch 7.4; 7.3; 10.1 1 The Use
More informationImplementation and Benchmarking of Elliptic Curve Cryptography Algorithms
Implementation and Benchmarking of Elliptic Curve Cryptography Algorithms Yulin Ou yulin_ou@umail.ucsb.edu Department of Electrical and Computer Engineering University of California Santa Barbara June
More informationCSC/ECE 774 Advanced Network Security
Computer Science CSC/ECE 774 Advanced Network Security Topic 2. Network Security Primitives CSC/ECE 774 Dr. Peng Ning 1 Outline Absolute basics Encryption/Decryption; Digital signatures; D-H key exchange;
More informationElliptic Curve Cryptography
Elliptic Curve Cryptography Dimitri Dimoulakis, Steve Jones, and Lee Haughton May 05 2000 Abstract. Elliptic curves can provide methods of encryption that, in some cases, are faster and use smaller keys
More informationModule: Cryptographic Protocols. Professor Patrick McDaniel Spring CMPSC443 - Introduction to Computer and Network Security
CMPSC443 - Introduction to Computer and Network Security Module: Cryptographic Protocols Professor Patrick McDaniel Spring 2009 1 Key Distribution/Agreement Key Distribution is the process where we assign
More informationPublic Key Algorithms
Public Key Algorithms 1 Public Key Algorithms It is necessary to know some number theory to really understand how and why public key algorithms work Most of the public key algorithms are based on modular
More informationEncryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls
Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls Overview Cryptography functions Secret key (e.g., DES) Public key (e.g., RSA) Message
More informationCOMPUTER & NETWORK SECURITY
COMPUTER & NETWORK SECURITY Lecture 7: Key Management CRYPTOBULLETIN: IN THE LAST WEEK OpenSSL Patch to Plug Severe Security Holes http://krebsonsecurity.com/2015/03/openssl patch to plug severe security
More informationLecture 30. Cryptography. Symmetric Key Cryptography. Key Exchange. Advanced Encryption Standard (AES) DES. Security April 11, 2005
Lecture 30 Security April 11, 2005 Cryptography K A ciphertext Figure 7.3 goes here K B symmetric-key crypto: sender, receiver keys identical public-key crypto: encrypt key public, decrypt key secret Symmetric
More informationDigital Signatures. KG November 3, Introduction 1. 2 Digital Signatures 2
Digital Signatures KG November 3, 2017 Contents 1 Introduction 1 2 Digital Signatures 2 3 Hash Functions 3 3.1 Attacks.................................... 4 3.2 Compression Functions............................
More informationSankalchand Patel College of Engineering, Visnagar Department of Computer Engineering & Information Technology. Question Bank
Sankalchand Patel College of Engineering, Visnagar Department of Computer Engineering & Information Technology Question Bank Subject: Information Security (160702) Class: BE Sem. VI (CE/IT) Unit-1: Conventional
More informationCryptography and Network Security
Cryptography and Network Security CRYPTOGRAPHY AND NETWORK SECURITY PRAKASH C. GUPTA Former Head Department of Information Technology Maharashtra Institute of Technology Pune Delhi-110092 2015 CRYPTOGRAPHY
More informationOther Topics in Cryptography. Truong Tuan Anh
Other Topics in Cryptography Truong Tuan Anh 2 Outline Public-key cryptosystem Cryptographic hash functions Signature schemes Public-Key Cryptography Truong Tuan Anh CSE-HCMUT 4 Outline Public-key cryptosystem
More information-3- Additionally or alternatively, the invention may comprise a method of controlling access to a digital wallet, the method comprising the steps:
-1- Secure Multiparty loss resistant Storage and Transfer of Cryptographic Keys for blockchain based systems in conjunction with a wallet management system 1 This invention relates generally to computer
More informationKurose & Ross, Chapters (5 th ed.)
Kurose & Ross, Chapters 8.2-8.3 (5 th ed.) Slides adapted from: J. Kurose & K. Ross \ Computer Networking: A Top Down Approach (5 th ed.) Addison-Wesley, April 2009. Copyright 1996-2010, J.F Kurose and
More informationASYMMETRIC (PUBLIC-KEY) ENCRYPTION. Mihir Bellare UCSD 1
ASYMMETRIC (PUBLIC-KEY) ENCRYPTION Mihir Bellare UCSD 1 Recommended Book Steven Levy. Crypto. Penguin books. 2001. A non-technical account of the history of public-key cryptography and the colorful characters
More informationUzzah and the Ark of the Covenant
Uzzah and the Ark of the Covenant And when they came to the threshing floor of Chidon, Uzzah put out his hand to take hold of the ark, for the oxen stumbled. 10 And the anger of the LORD was kindled against
More informationCryptography CS 555. Topic 16: Key Management and The Need for Public Key Cryptography. CS555 Spring 2012/Topic 16 1
Cryptography CS 555 Topic 16: Key Management and The Need for Public Key Cryptography CS555 Spring 2012/Topic 16 1 Outline and Readings Outline Private key management between two parties Key management
More informationEncryption. INST 346, Section 0201 April 3, 2018
Encryption INST 346, Section 0201 April 3, 2018 Goals for Today Symmetric Key Encryption Public Key Encryption Certificate Authorities Secure Sockets Layer Simple encryption scheme substitution cipher:
More informationUNIT - IV Cryptographic Hash Function 31.1
UNIT - IV Cryptographic Hash Function 31.1 31-11 SECURITY SERVICES Network security can provide five services. Four of these services are related to the message exchanged using the network. The fifth service
More information