Exercises 2013-03-04 Information Security Course Eric Laermans – Tom Dhaene.

Slides:

Advertisements

Similar presentations

Advertisements

Public Key Cryptosystem

Mathematics of Cryptography Part II: Algebraic Structures

Asymmetric-Key Cryptography

CNS2010handout 10 :: digital signatures1 computer and network security matt barrie.

Binary & Decimal numbers = 3* * *10 + 5*1 = 3* * * *10 0 Decimal system: Ten digits: 0,1,2,3,…,9 Example:

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Tuesday, 26 November Number-Theoretic Algorithms Chapter 31.

CMSC 414 Computer and Network Security Lecture 9 Jonathan Katz.

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

Log, ln and Mathematical Operations

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

Tallinn University of Technology Quantum computer impact on public key cryptography Roman Stepanenko.

They are the same as registers since they store binary numbers. Called shifting registers since they shift (left or right) the binary number stored in.

Bits and Bytes.

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.

Foundations of Network and Computer Security J J ohn Black Lecture #14 Oct 1 st 2007 CSCI 6268/TLEN 5831, Fall 2007.

Spring2012 Lecture#10 CSE 246 Data Structures and Algorithms.

Information Security and Management 13. Digital Signatures and Authentication Protocols Chih-Hung Wang Fall

Lecture 8 Digital Signatures. This lecture considers techniques designed to provide the digital counterpart to a handwritten signature. A digital signature.

Bob can sign a message using a digital signature generation algorithm

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 3 (Part 3): The Fundamentals: Algorithms, the.

MA/CSSE 473 Day 03 Asymptotics A Closer Look at Arithmetic With another student, try to write a precise, formal definition of “t(n) is in O(g(n))”

MATH 224 – Discrete Mathematics

CS 312: Algorithm Analysis Lecture #3: Algorithms for Modular Arithmetic, Modular Exponentiation This work is licensed under a Creative Commons Attribution-Share.

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

Digital Logic Lecture 4 Binary Codes The Hashemite University Computer Engineering Department.

Integer Representation for People Computer Organization and Assembly Language: Module 3.

Exercises Information Security Course Eric Laermans – Tom Dhaene.

Information Security -- Part II Public-Key Encryption and Hash Functions Frank Yeong-Sung Lin Information Management Department National Taiwan University.

Numbering System Base Conversion. Number systems Decimal – 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 Binary – 0, 1 Octal – 0, 1, 2, 3, 4, 5, 6, 7 Hexadecimal system.

Public key ciphers 2 Session 6.

Exercises Information Security Course Eric Laermans – Tom Dhaene.

1 Hash Functions. 2 A hash function h takes as input a message of arbitrary length and produces as output a message digest of fixed length

1 CPSC 320: Intermediate Algorithm Design and Analysis July 21, 2014.

Exercises Information Security Course Eric Laermans – Tom Dhaene.

Scott CH Huang COM 5336 Cryptography Lecture 6 Public Key Cryptography & RSA Scott CH Huang COM 5336 Cryptography Lecture 6.

Elliptic Curve Cryptography

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.

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

Brackets An introduction to using brackets in algebra.

A Survey on Factoring Large Numbers ～巨大数の因数分解に関する調査～ Kanada Lab. M Yoshida Hitoshi.

Logarithms. Strings of bits There is only one possible zero-length sequence of bits There are two possible “sequences” of a single bit: 0, 1 There are.

Modular Arithmetic Warmup. Computing powers What is 3 2 (mod 7)? 3 2 = 9 = 2 (mod 7) What is 3 25 (mod 7)? 3 25 = (3 12 ) 2 × = (3 6 ) = (3.

Lecture 9 Elliptic Curves. In 1984, Hendrik Lenstra described an ingenious algorithm for factoring integers that relies on properties of elliptic curves.

Review Exponential + Logarithmic Functions Math Analysis.

1/16 Seeing through M IST given a Small Fraction of an RSA Private Key Colin D. Walter Comodo Research Lab (Bradford, UK)

Exercises Information Security Course Eric Laermans – Tom Dhaene.

DIGITAL SIGNATURE ALGORITHM. The National Institute of Standards and Technology (NIST) has published Federal Information Processing Standard FIPS 186,

RSA Pubic Key Encryption CSCI 5857: Encoding and Encryption.

Computer Studies Today Chapter 19 1 Chapter 19. Computer Studies Today Chapter 19 2 »Information stored in a computer is in two states: –ON –OFF.

The Hexadecimal System is base 16. It is a shorthand method for representing the 8-bit bytes that are stored in the computer system. This system was chosen.

1 Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang 9 February 2007.

Chapter 9 – Public Key Cryptography and RSA Every Egyptian received two names, which were known respectively as the true name and the good name, or the.

CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.

Lecture 6. RSA Use in Encryption to encrypt a message M the sender: – obtains public key of recipient PU={e,n} – computes: C = M e mod n, where 0≤M

Which of these is 52 written as a product of its prime factors? a) 2 x 26b) 2 x 2 x 13 c) 4 x 13d) 1 x 52.

Number Systems Decimal Can you write 12,045 in expanded form? Base? Allowable digits for each place?

Lecturer: Santokh Singh

Number System conversions

Significant Digits and Scientific Notation

The Application of Elliptic Curves Cryptography in Embedded Systems

Introduction to Basic Digital Logic

CSE 417: Algorithms and Computational Complexity

The RSA Public-Key Encryption Algorithm

Lecture 37 – Practice Exercises 9

Lecture 37 – Practice Exercises 9

Presentation transcript:

Exercises Information Security Course Eric Laermans – Tom Dhaene

Information Security Vakgroep Informatietechnologie – IBCN – Eric Laermans p. 2 Exercise 1 Strong primes Given  p–1 has a sufficiently large prime factor r  p+1 has a sufficiently large prime factor s  r+1 has a sufficiently large prime factor t Question  How would you determine such a number?

Information Security Vakgroep Informatietechnologie – IBCN – Eric Laermans p. 3 Exercise 2 Complexity 2 efficient algorithms for factorising a number n in prime factors have a computational complexity of respectively L n [1/2, 1] and L n [1/3, (64/9) 1/3 ] Questions:  which of both algorithms is asymptotically most efficient  which algorithm would you use to factorize a number of 128 binary digits (and for a number of 256, 512 of 1024 bits)?  from which size of number (decimal digits) would you switch to the other algorithm?

Information Security Vakgroep Informatietechnologie – IBCN – Eric Laermans p. 4 Exercise 3 Complexity Given:  to compute discrete logarithms in a subgroup of order q in the group {Z p *,  } there are algorithms with a O(q 1/2 ) complexity and algorithms with a L p [1/3, (64/9) 1/3 ] complexity (which is the same as the complexity for solving discrete logaritmen in {Z p *,  }) Question:  if p ≈ , which value of q must be chosen so that solving discrete logarithms in the subgroup is not significantly easier than the original discrete logarithm problem in {Z p *,  }?

Information Security Vakgroep Informatietechnologie – IBCN – Eric Laermans p. 5 Exercise 4 Complexity Given:  The Belgian eID uses RSA with a 1024 bit modulus and PKCS#1 v1.5  Using state-of-the-art algorithms (GNFS) for factorisation and state-of-the-art technology, it has been possible since December 2009 to factorise a 768 bit number  One may assume that algorithms will not improve in the coming years, that computation speed is the only limitation, and that computation speed doubles every 24 months Question:  How risky is it to extend the validity of the Belgian eID to 10 years? Use calculations to make your case.