True Random Number Generator (TRNG)

Size: px
Start display at page:

Transcription

1 True Random Number Generator (TRNG) Takes as input a source that is effectively random The source is referred to as an entropy source and is drawn from the physical environment of the computer Includes things such as keystroke timing patterns, disk electrical activity, mouse movements, and instantaneous values of the system clock The source, or combination of sources, serve as input to an algorithm that produces random binary output The TRNG may simply involve conversion of an analog source to a binary output The TRNG may involve additional processing to overcome any bias in the source 1

2 Pseudorandom Number Generator (PRNG) Takes as input a fixed value, called the seed, and produces a sequence of output bits using a deterministic algorithm Quite often the seed is generated by a TRNG The output bit stream is determined solely by the input value or values, so an adversary who knows the algorithm and the seed can reproduce the entire bit stream Other than the number of bits produced there is no difference between a PRNG and a PRF Two different forms of PRNG Pseudorandom number generator An algorithm that is used to produce an open-ended sequence of bits Input to a symmetric stream cipher is a common application for an open-ended sequence of bits Pseudorandom function (PRF) Used to produce a pseudorandom string of bits of some fixed length Examples are symmetric encryption keys and nonces 2

3 PRNG Requirements The basic requirement when a PRNG or PRF is used for a cryptographic application is that an adversary who does not know the seed is unable to determine the pseudorandom string The requirement for secrecy of the output of a PRNG or PRF leads to specific requirements in the areas of: Randomness Unpredictability Characteristics of the seed 3

4 Randomness The generated bit stream needs to appear random even though it is deterministic There is no single test that can determine if a PRNG generates numbers that have the characteristic of randomness If the PRNG exhibits randomness on the basis of multiple tests, then it can be assumed to satisfy the randomness requirement NIST SP specifies that the tests should seek to establish three characteristics: Uniformity Scalability Consistency 4

5 Random number, Pseudorandom The outputs of pseudorandom number generators are not truly random They only approximate some of the properties of random numbers. "Anyone who considers arithmetical methods of producing random digits is, of course, in a state of sin. --- John von Neumann Truely random numbers can be generated using hardware random number generators 5

6 Inherent non-randomness Because any PRNG run on a deterministic computer (contrast quantum computer) is deterministic, its output will inevitably have certain properties that a true random sequence would not exhibit. Guaranteed periodicity it is certain that if the generator uses only a fixed amount of memory then, given a sufficient number of iterations, the generator will revisit the same internal state twice, after which it will repeat forever. A generator that isn't periodic can be designed, but its memory requirements would grow as it ran. In addition, a PRNG can be started from an arbitrary starting point, or seed state, and will always produce an identical sequence from that point on. 6

7 cont In practice, many PRNGs exhibit artifacts which can cause them to fail statistically significant tests. These include, but are certainly not limited to: Shorter than expected periods for some seed states (not full period) Poor dimensional distribution Successive values are not independent Some bits may be 'more random' than others Lack of uniformity 7

8 Desired Properties Three important properties: Randomness Unbiased (uniform distribution): the probability of a zero or one is exactly 1/2 Scalability: any test applicable to a sequence can also be applied to subsequences extracted at random Consistency: the behavior of a generator must be consistent across starting values (seeds) Unpredictable (independence): Forward unpredictability: It is impossible to predict what the next output will be, given all the previous outputs, but not the internal "hidden" state. Backward unpredictability: Infeasible to determine the seed from knowledge of any generated values Irreproducible: Two of the same generators, given the same starting conditions, will produce different outputs. 8

9 Randomness Tests SP lists 15 separate tests of randomness Frequency test The most basic test and must be included in any test suite Purpose is to determine whether the number of ones and zeros in a sequence is approximately the same as would be expected for a truly random sequence Runs test Focus of this test is the total number of runs in the sequence, where a run is an uninterrupted sequence of identical bits bounded before and after with a bit of the opposite value Purpose is to determine whether the number of runs of ones and zeros of various lengths is as expected for a random sequence Three tests Maurer s universal statistical test Focus is the number of bits between matching patterns Purpose is to detect whether or not the sequence can be significantly compressed without loss of information. A significantly compressible sequence is considered to be non-random 9

10 Desired Properties Usually when a person says A "good" pseudo-random number generator they mean it is unbiased. A "true" PRNG they usually mean it's irreproducible A "cryptographically strong" PRNG they mean it's unpredictable Very rarely they mean it's all threes 10

11 More Properties Long period The generator should be of long period Fast computation The generator should be reasonably fast Security The generator should be secure What is security level of PRNG? 11

12 Security A PRNG suitable for cryptographic applications is called a cryptographically secure PRNG (CSPRNG). Its output should not only pass all statistical tests for randomness but satisfy some additional cryptographic requirements. Used in many aspects of cryptography require random numbers, for example: Key generation Nonces Salts in certain signature schemes, (ECDSA, RSASSA-PSS). One-time pads 12

13 CSPRNG CSPRNG requirements fall into two groups: their statistical properties are good (passing tests of randomness), they hold up well in case of attack, even when (part of) their secrets are revealed. A CSPRNG should satisfy the 'next-bit test'. Given the first l bits of a random sequence there is no polynomialtime algorithm that can predict the next bit with probability of success significantly higher than 1/2. It has been proven that a generator passing the next-bit test will pass all other polynomial-time statistical tests for randomness. should withstand state compromise extensions. That is, in the unfortunate case that part or all of the state has been revealed (or guessed correctly), it should be impossible to reconstruct the stream of random numbers prior to the incident. Also if there is an input of entropy, it should be infeasible to use knowledge of the state to predict future conditions of the state. 13

14 Example the CSPRNG being considered produces output by computing some function of the next digit of pi (ie, ), Ø it may well be random as pi appears to be a random sequence. Ø However, this does not satisfy the next-bit test, and Ø thus is not cryptographically secure. Ø There exists an algorithm that will predict the next bit. 14

15 Unpredictability A stream of pseudorandom numbers should exhibit two forms of unpredictability: Forward unpredictability If the seed is unknown, the next output bit in the sequence should be unpredictable in spite of any knowledge of previous bits in the sequence Backward unpredictability It should not be feasible to determine the seed from knowledge of any generated values No correlation between a seed and any value generated from that seed should be evident Each element of the sequence should appear to be the outcome of an independent random event whose probability is 1/2 The same set of tests for randomness also provides a test of unpredictability A random sequence will have no correlation with a fixed value (the seed) 15

16 Seed Requirements The seed serves as input to PRNG The seed is generated by a TRNG Might have some bias Entropy source True random number generator (TRNG) Seed Pseudorandom number generator (PRNG) Pseudorandom bit stream 16

17 Algorithm Design Algorithms fall into two categories: Purpose-built algorithms Algorithms designed specifically and solely for the purpose of generating pseudorandom bit streams Algorithms based on existing cryptographic algorithms Have the effect of randomizing input data Three broad categories of cryptographic algorithms are commonly used to create PRNGs: Symmetric block ciphers Asymmetric ciphers Hash functions and message authentication codes 17

18 Outline q Principles of Pseudorandom Number Generation q Pseudorandom Number Generators q Pseudorandom Number Generation Using a Block Cipher q Stream Ciphers q RC4 q True Random Number Generation 18

19 Linear Congruential Generator An algorithm first proposed by Lehmer that is parameterized with four numbers: m the modulus m > 0 a the multiplier 0 < a< m c the increment 0 c < m X 0 the starting value, or seed 0 X 0 < m The sequence of random numbers {X n } is obtained via the following iterative equation: X n+1 = (ax n + c) mod m If m, a, c, and X 0 are integers, then this technique will produce a sequence of integers with each integer in the range 0 X n < m The selection of values for a, c, and m is critical in developing a good random number generator 19

20 Linear Congruential Generator Common iterative technique using: X n+1 = (ax n + c) mod m Given suitable values of parameters can produce a long random-like sequence Suitable criteria to have are: Function generates a full-period Generated sequence should appear random Efficient implementation with 32-bit arithmetic Note that an attacker can reconstruct sequence given a small number of values 20

21 Parameter Setting Not all a, c are good and m should be large For example, m is a large prime number For fast computation, usually m= And c is set to 0 often For this m, there are less than 100 integers a It generates all numbers less than m The generated sequences appear to be random One such a= Used in IBM 360 family of computers 21

22 Blum Blum Shub (BBS) Generator Has perhaps the strongest public proof of its cryptographic strength of any purpose-built algorithm Referred to as a cryptographically secure pseudorandom bit generator (CSPRBG) A CSPRBG is defined as one that passes the next-bit-test if there is not a polynomial-time algorithm that, on input of the first k bits of an output sequence, can predict the (k + 1)st bit with probability significantly greater than 1/2 The security of BBS is based on the difficulty of factoring n 22

23 Blum Blum Shub Generator Based on public key algorithms Use least significant bit from iterative equation: x i+1 = x i 2 mod n where n=p.q, and primes p,q=3 mod 4 Unpredictable, passes next-bit test Security rests on difficulty of factoring N Is unpredictable given any run of bits Slow, since very large numbers must be used Too slow for cipher use, good for key generation 23

24 Initialize with seed s Generate x 2 mod n Select least significant bit [0, 1] Figure 8.3 Blum Blum Shub Block Diagram 24

25 Example Operation of BBS Generator i X i B i i X i B i

26 Cont on BBS Provably secure When the primes are chosen appropriately, and O(log log n) bits of each S i are output, then in the limit as n grows large, distinguishing the output bits from random will be at least as difficult as factoring n. However, it's theoretically possible that a fast algorithm for factoring will someday be found, so BBS is not yet guaranteed to be secure. 26

27 Outline q Principles of Pseudorandom Number Generation q Pseudorandom Number Generators q Pseudorandom Number Generation Using a Block Cipher q Stream Ciphers q RC4 q True Random Number Generation 27

28 Using Block Ciphers as Stream Ciphers Can use block cipher to generate numbers Use Counter Mode X i = E(K m,i) Use Output Feedback Mode X i = E(K m,x i-1 ) ANSI X9.17 PRNG uses date-time + seed inputs and 3 triple-des encryptions to generate new seed & random 28

29 Designs based on cryptographic primitives Designs based on cryptographic primitives A secure block cipher can also be converted into a CSPRNG by running it in counter mode. This is done by choosing an arbitrary key and encrypting a zero, then encrypting a 1, then encrypting a 2, etc. The counter can also be started at an arbitrary number other than zero. Obviously, the period will be 2 n for an n-bit block cipher; equally obviously, the initial values (i.e. key and 'plaintext') must not become known to an attacker lest, however good this CSPRNG construction might be otherwise, all security be lost. A cryptographically secure hash of a counter might also act as a good CSPRNG in some cases. it is necessary that the initial value of this counter is random and secret. If the counter is a bignum, then CSPRNG could have an infinite period. 29

30 PRNG Using Block Cipher Modes of Operation Two approaches that use a block cipher to build a PNRG have gained widespread acceptance: CTR mode Recommended in NIST SP , ANSI standard X.82, and RFC 4086 OFB mode Recommended in X9.82 and RFC

31 PRNG Mechanisms based on Block Ciphers 31

32 Algorithms 32

33 Experiment A random bit sequence of 256 bits was obtained form random.org Three radios tuned between stations to pick up atmospheric noise The number of ones: 124 (0.48) 33

34 Example Results using OFB Output Block Fraction of One Bits Fraction of Bits that Match with Preceding Block 1786f4c7ff6e291dbdfdd90ec e17b22b14677a4d66890f87565eae fd18284ac82251dfb3aa62c326cd46cc c8e545198a758ef5dd86b bd fe7bae0e e2c52d215a2e fdf5ec ae accd aeca972e5a3ef17bd1a1b775fc8b f7e97badf359d128f00d9b4ae323db

35 Example Results using CTR Output Block Fraction of One Bits Fraction of Bits that Match with Preceding Block 1786f4c7ff6e291dbdfdd90ec a3e092a01b463472fdcae d4e6e170b46b0573eedf88ee39bff33d f8fcfc5deca18ea246785d7fadc76f e63ed27bb07868c753545bdd57ee fdf4a17f747c c f4be2d179b0f2548fd748c8fc7c fc48f90eebac658a c3c

36 ANSI X9.17 PRNG One of the strongest PRNGs is specified in ANSI X9.17 A number of applications employ this technique including financial security applications and PGP Input Two pseudorandom inputs drive the generator. One is a 64-bit representation of the current date and time. The other is a 64-bit seed value; this is initialized to some arbitrary value and is updated during the generation process. The algorithm makes use of triple DES for encryption. Ingredients are: Output The output consists of a 64-bit pseudorandom number and a 64-bit seed value. Keys The generator makes use of three triple DES encryption modules. All three make use of the same pair of 56-bit keys, which must be kept secret and are used only for pseudorandom number generation. 36

37 ANSI X9.17 K 1, K 2 DT i EDE EDE V i+1 V i EDE R i Figure 8.5 ANSI X9.17 Pseudorandom Number Generator 37

38 ANSI X

39 NIST CTR_DRBG Counter mode-deterministic random bit generator PRNG defined in NIST SP based on the CTR mode of operation Is widely implemented and is part of the hardware random number generator implemented on all recent Intel processor chips DRBG assumes that an entropy source is available to provide random bits The entropy source will be a TRNG based on some physical source Entropy is an information theoretic concept that measures unpredictability or randomness The encryption algorithm used in the DRBG may be 3DES with three keys or AES with a key size of 128, 192, or 256 bits 39

40 CTR_DRBG Parameters 40

41 CTR_DRBG Functions 41

42 Outline q Principles of Pseudorandom Number Generation q Pseudorandom Number Generators q Pseudorandom Number Generation Using a Block Cipher q Stream Ciphers q RC4 q True Random Number Generation 42

43 Stream Ciphers Process the message bit by bit (as a stream) Typically have a (pseudo) random stream key Combined (XOR) with plaintext bit by bit Randomness of stream key completely destroys any statistically properties in the message C i = M i keystream i What could be simpler!!!! But must never reuse keystream, otherwise can remove effect and recover messages Are useful if data are transferred as a stream - web browser - voice - video 43

44 Stream Ciphers Key K Key K Pseudorandom byte generator (key stream generator) Pseudorandom byte generator (key stream generator) Plaintext byte stream M k ENCRYPTION Ciphertext byte stream C k DECRYPTION Plaintext byte stream M Figure 8.7 Stream Cipher Diagram 44

45 Stream Cipher Design Considerations The encryption sequence should have a large period A pseudorandom number generator uses a function that produces a deterministic stream of bits that eventually repeats; the longer the period of repeat the more difficult it will be to do cryptanalysis The keystream should approximate the properties of a true random number stream as close as possible There should be an approximately equal number of 1s and 0s If the keystream is treated as a stream of bytes, then all of the 256 possible byte values should appear approximately equally often A key length of at least 128 bits is desirable The output of the pseudorandom number generator is conditioned on the value of the input key The same considerations that apply to block ciphers are valid With a properly designed pseudorandom number generator a stream cipher can be as secure as a block cipher of comparable key length A potential advantage is that stream ciphers that do not use block ciphers as a building block are typically faster and use far less code than block ciphers 45

46 Speed Comparisons on a Pentium II On Pentium II AMD Opteron, 2.2 GHz ( Linux) 46

47 Outline q Principles of Pseudorandom Number Generation q Pseudorandom Number Generators q Pseudorandom Number Generation Using a Block Cipher q Stream Ciphers q RC4 q True Random Number Generation 47

48 RC4 A proprietary cipher owned by RSA DSI (1987) Another Ron Rivest design, simple but effective Variable key size, byte-oriented stream cipher Widely used such as web, SSL/TLS, wireless WEP (Wired Equivalent Privacy), WiFi Protected Access (WPA) Key forms random permutation of all 8-bit values Uses that permutation to scramble input info processed a byte at a time 48

49 RC4 Key Schedule Starts with an array S of numbers: Use key to well and truly shuffle S forms internal state of the cipher S contains a permutation of numbers Given a key k of length l bytes 49

50 RC4 Encryption Encryption continues shuffling array values Sum of shuffled pair selects "stream key" value XOR with next byte of message to en/decrypt 50

51 RC4 S K keylen T (a) Initial state of S and T T T[i] S j = j + S[i] + T[i] S[i] S[j] i Swap (b) Initial permutation of S j = j + S[i] S S[i] S[j] S[t] i Swap t = S[i] + S[j] (c) Stream Generation k 51

52 Strength of RC4 A number of papers have been published analyzing methods of attacking RC4 None of these approaches is practical against RC4 with a reasonable key length A more serious problem is that the WEP protocol intended to provide confidentiality on wireless LAN networks is vulnerable to a particular attack approach The problem is not with RC4 itself, but the way in which keys are generated for use as input Problem does not appear to be relevant to other applications and can be remedied in WEP by changing the way in which keys are generated Problem points out the difficulty in designing a secure system that involves both cryptographic functions and protocols that make use of them 52

53 Salsa20 Salsa20 is a stream cipher submitted to estream by Daniel J. Bernstein Built on a pseudorandom function based on 32-bit addition, bitwise addition (XOR) and rotation operations Maps a 256-bit key, a 64-bit nonce (number used once), and a 64-bit stream position to a 512-bit output (a version with a 128-bit key also exists) 53

54 Outline q Principles of Pseudorandom Number Generation q Pseudorandom Number Generators q Pseudorandom Number Generation Using a Block Cipher q Stream Ciphers q RC4 q True Random Number Generation 54

55 Entropy Sources A true random number generator (TRNG) uses a nondeterministic source to produce randomness Most operate by measuring unpredictable natural processes such as pulse detectors of ionizing radiation events, gas discharge tubes, and leaky capacitors Intel has developed a commercially available chip that samples thermal noise by amplifying the voltage measured across undriven resistors LavaRnd is an open source project for creating truly random numbers using inexpensive cameras, open source code, and inexpensive hardware The system uses a saturated CCD in a light-tight can as a chaotic source to produce the seed; software processes the result into truly random numbers in a variety of formats 55

56 Possible Sources of Randomness RFC 4086 lists the following possible sources of randomness that can be used on a computer to generate true random sequences: Sound/video input The input from a sound digitizer with no source plugged in or from a camera with the lens cap on is essentially thermal noise Disk drives Have small random fluctuations in their rotational speed due to chaotic air turbulence If the system has enough gain to detect anything, such input can provide reasonable high quality random bits The addition of low-level disk seek-time instrumentation produces a series of measurements that contain this randomness There is also an online service (random.org) which can deliver random sequences securely over the Internet 56

57 Comparison of PRNGs and TRNGs Efficiency: the ability to produce many numbers in a short time Pseudorandom Number Generators True Random Number Generators Efficiency Very efficient Generally inefficient Determinism Deterministic Nondeterministic Periodicity Periodic Aperiodic 57

58 Conditioning A TRNG may produce an output that is biased in some way (such as having more ones than zeros or vice versa) Biased NIST SP B defines a random process as biased with respect to an assumed discrete set of potential outcomes if some of those outcomes have a greater probability of occurring than do others Entropy rate NIST B defines entropy rate as the rate at which a digitized noise source provides entropy Is a measure of the randomness or unpredictability of a bit string Will be a value between 0 (no entropy) and 1 (full entropy) Conditioning algorithms/deskewing algorithms Methods of modifying a bit stream to further randomize the bits Typically conditioning is done by using a cryptographic algorithm to scramble the random bits so as to eliminate bias and increase entropy The two most common approaches are the use of a hash function or a symmetric block cipher 58

59 Skew Skew: more ones than zeros or vice versa Deskewing algorithms: Pass the bit stream through a hash function, such as MD5 or SHA-1 RFC 4086 recommends collecting input from multiple hardware sources and then mixing them using a hash function to produce random output 59

60 Random Numbers Generated from OSes Built-in mechanisms In Linux, four entropy sources: Mouse activity Keyboard activity Disk I/O operations Specific interrupts Combined in a pooled buffer è pass through SHA-1 60

61 Hash Function A hash function produces an n-bit output from an input of arbitrary length A simple way to use a hash function for conditioning is as follows: Blocks of m input bits, with m n, are passed through the hash function and the n output bits are used as random bits To generate a stream of random bits, successive input blocks pass through the hash function to produce successive hashed output blocks 61

62 NONDETERMINISTIC RANDOM BIT GENERATOR Nondetermistic Bit Source Noise Source Digitization A Health Testing Conditioning B Output Figure 8.9 NRBG Model 62

63 Health Tests on the Noise Source The nature of the health testing of the noise source depends strongly on the technology used to produce noise In general, the assumption can be made that the digitized output of the noise source will exhibit some bias Thus, traditional statistical tests are not useful for monitoring the noise source, because the noise source is likely to always fail The tests on the noise source need to be tailored to the expected statistical behavior of the correctly operating noise source The goal is not to determine if the source is unbiased, but if it is operating as expected 63

64 Health Tests on the Noise Source SP B specifies that continuous tests be done on digitized samples obtained from the noise source The purpose is to test for variability and to determine if the noise source is producing at the expected entropy rate SP B mandates the use of two tests Repetition Count Test Designed to quickly detect a catastrophic failure that causes the noise source to become stuck on a single output value for a long time Involves looking for consecutive identical samples Adaptive Proportion Test Designed to detect a large loss of entropy, such as might occur as a result of some physical failure or environmental change affecting the noise source The test continuously measures the local frequency of occurrence of some sample value in a sequence of noise source samples to determine if the sample occurs too frequently 64

65 Health Tests on the Conditioning Function SP B specifies that health tests should also be applied to the output of the conditioning component, but does not indicate which tests to use The purpose of the health tests on the conditioning component is to assure that the output behaves as a true random bit stream It is reasonable to use the tests for randomness defined in SP

66 Intel Digital Random Number Generator TRNGs have traditionally been used only for key generation and other applications where only a small number of random bits were required This is because TRNGs have generally been inefficient with a low bit rate of random bit production The first commercially available TRNG that achieves bit production rates comparable with that of PRNGs is the Intel digital random number generator offered on new multicore chips since May 2012 It is implemented entirely in hardware The entire DRNG is on the same multicore chip as the processors 66

67 Intel Digital Random Number Generator Digital Random Number Generator Hardware entropy source Hardware AES-CBC-MAC based conditioner Hardware SP800-90A AES-CTR based DRBG Hardware SP800-90B & C ENRNG Processor Chip Core 0 RDSEED instruction RDRAND instruction Core N 1 RDSEED instruction RDRAND instruction Figure 8.10 Intel Processor Chip with Random Number Generator 67

68 Intel Digital Random Number Generator Clock Transistor 1 Transistor 2 Inverters Node A Node B Hardware entropy source 128 bits 128 bits 128 bits 128 bits K K K K Encrypt Encrypt Encrypt Encrypt AES CBC Mac based conditioner 128 bits 128 bits 0 1st time bits + K = 0 Key V AES-CTR based PRNG Encrypt 256 bits Encrypt Figure 8.11 Intel DRNG Logical Structure Pseudorandom bits 68

69 Summary Principles of pseudorandom number generation The use of random numbers TRNGs, PRNGs, and PRFs PRNG requirements Algorithm design Pseudorandom number generators Linear congruential generators Blum Blum Shub generator Pseudorandom number generation using a block cipher PRNG using block cipher modes of operation ANSI X9.17 PRNG NIST CTR_DRBG Stream ciphers RC4 Initialization of S Stream generation Strength of RC4 True random number generators Entropy sources Comparison of PRNGs and TRNGs Conditioning Health Testing Intel digital random number generator 69

Network Security. Chapter 6 Random Number Generation

Network Security Chapter 6 Random Number Generation 1 Tasks of Key Management (1)! Generation:! It is crucial to security, that keys are generated with a truly random or at least a pseudo-random generation

Network Security. Chapter 6 Random Number Generation. Prof. Dr.-Ing. Georg Carle

Network Security Chapter 6 Random Number Generation Prof. Dr.-Ing. Georg Carle Chair for Computer Networks & Internet Wilhelm-Schickard-Institute for Computer Science University of Tübingen http://net.informatik.uni-tuebingen.de/

Overview of Cryptographic Tools for Data Security. Murat Kantarcioglu

UT DALLAS Erik Jonsson School of Engineering & Computer Science Overview of Cryptographic Tools for Data Security Murat Kantarcioglu Pag. 1 Purdue University Cryptographic Primitives We will discuss the

Chapter 11 Security+ Guide to Network Security Fundamentals, Third Edition Basic Cryptography

Chapter 11 Security+ Guide to Network Security Fundamentals, Third Edition Basic Cryptography What Is Steganography? Steganography Process of hiding the existence of the data within another file Example:

CIS 6930 Emerging Topics in Network Security. Topic 2. Network Security Primitives

CIS 6930 Emerging Topics in Network Security Topic 2. Network Security Primitives 1 Outline Absolute basics Encryption/Decryption; Digital signatures; D-H key exchange; Hash functions; Application of hash

Key Hopping A Security Enhancement Scheme for IEEE 802.11 WEP Standards

White Paper Key Hopping A Security Enhancement Scheme for IEEE 802.11 WEP Standards By Dr. Wen-Ping Ying, Director of Software Development, February 2002 Introduction Wireless LAN networking allows the

6.857 Computer and Network Security Fall Term, 1997 Lecture 4 : 16 September 1997 Lecturer: Ron Rivest Scribe: Michelle Goldberg 1 Conditionally Secure Cryptography Conditionally (or computationally) secure

Network Security. Chapter 3 Symmetric Cryptography. Symmetric Encryption. Modes of Encryption. Symmetric Block Ciphers - Modes of Encryption ECB (1)

Chair for Network Architectures and Services Department of Informatics TU München Prof. Carle Network Security Chapter 3 Symmetric Cryptography General Description Modes of ion Data ion Standard (DES)

Authentication requirement Authentication function MAC Hash function Security of

UNIT 3 AUTHENTICATION Authentication requirement Authentication function MAC Hash function Security of hash function and MAC SHA HMAC CMAC Digital signature and authentication protocols DSS Slides Courtesy

FIPS 140-2 Non- Proprietary Security Policy. McAfee SIEM Cryptographic Module, Version 1.0

FIPS 40-2 Non- Proprietary Security Policy McAfee SIEM Cryptographic Module, Version.0 Document Version.4 December 2, 203 Document Version.4 McAfee Page of 6 Prepared For: Prepared By: McAfee, Inc. 282

1720 - Forward Secrecy: How to Secure SSL from Attacks by Government Agencies

1720 - Forward Secrecy: How to Secure SSL from Attacks by Government Agencies Dave Corbett Technical Product Manager Implementing Forward Secrecy 1 Agenda Part 1: Introduction Why is Forward Secrecy important?

GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte. Yehuda Lindell Bar-Ilan University

GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte Shay Gueron Haifa Univ. and Intel Yehuda Lindell Bar-Ilan University Appeared at ACM CCS 2015 How to Encrypt with

Authentication, digital signatures, PRNG

Multimedia Security Authentication, digital signatures, PRNG Mauro Barni University of Siena Beyond confidentiality Up to now, we have been concerned with protecting message content (i.e. confidentiality)

Cryptography and Network Security Block Cipher

Cryptography and Network Security Block Cipher Xiang-Yang Li Modern Private Key Ciphers Stream ciphers The most famous: Vernam cipher Invented by Vernam, ( AT&T, in 1917) Process the message bit by bit

Introduction...3 Terms in this Document...3 Conditions for Secure Operation...3 Requirements...3 Key Generation Requirements...

Hush Encryption Engine White Paper Introduction...3 Terms in this Document...3 Conditions for Secure Operation...3 Requirements...3 Key Generation Requirements...4 Passphrase Requirements...4 Data Requirements...4

Network Security: Cryptography CS/SS G513 S.K. Sahay

Network Security: Cryptography CS/SS G513 S.K. Sahay BITS-Pilani, K.K. Birla Goa Campus, Goa S.K. Sahay Network Security: Cryptography 1 Introduction Network security: measure to protect data/information

Error oracle attacks and CBC encryption. Chris Mitchell ISG, RHUL http://www.isg.rhul.ac.uk/~cjm

Error oracle attacks and CBC encryption Chris Mitchell ISG, RHUL http://www.isg.rhul.ac.uk/~cjm Agenda 1. Introduction 2. CBC mode 3. Error oracles 4. Example 1 5. Example 2 6. Example 3 7. Stream ciphers

Recommendation for Cryptographic Key Generation

NIST Special Publication 800-133 Recommendation for Cryptographic Key Generation Elaine Barker Allen Roginsky http://dx.doi.org/10.6028/nist.sp.800-133 C O M P U T E R S E C U R I T Y NIST Special Publication

Cryptography and Network Security Chapter 12

Cryptography and Network Security Chapter 12 Fifth Edition by William Stallings Lecture slides by Lawrie Brown (with edits by RHB) Chapter 12 Message Authentication Codes At cats' green on the Sunday he

Symantec Corporation Symantec Enterprise Vault Cryptographic Module Software Version: 1.0.0.2

Symantec Corporation Symantec Enterprise Vault Cryptographic Module Software Version: 1.0.0.2 FIPS 140 2 Non Proprietary Security Policy FIPS Security Level: 1 Document Version: 1.1 Prepared for: Prepared

Network Security. Computer Networking Lecture 08. March 19, 2012. HKU SPACE Community College. HKU SPACE CC CN Lecture 08 1/23

Network Security Computer Networking Lecture 08 HKU SPACE Community College March 19, 2012 HKU SPACE CC CN Lecture 08 1/23 Outline Introduction Cryptography Algorithms Secret Key Algorithm Message Digest

SECURITY EVALUATION OF EMAIL ENCRYPTION USING RANDOM NOISE GENERATED BY LCG

SECURITY EVALUATION OF EMAIL ENCRYPTION USING RANDOM NOISE GENERATED BY LCG Chung-Chih Li, Hema Sagar R. Kandati, Bo Sun Dept. of Computer Science, Lamar University, Beaumont, Texas, USA 409-880-8748,

Developing and Investigation of a New Technique Combining Message Authentication and Encryption

Developing and Investigation of a New Technique Combining Message Authentication and Encryption Eyas El-Qawasmeh and Saleem Masadeh Computer Science Dept. Jordan University for Science and Technology P.O.

12/3/08. Security in Wireless LANs and Mobile Networks. Wireless Magnifies Exposure Vulnerability. Mobility Makes it Difficult to Establish Trust

Security in Wireless LANs and Mobile Networks Wireless Magnifies Exposure Vulnerability Information going across the wireless link is exposed to anyone within radio range RF may extend beyond a room or

CS 758: Cryptography / Network Security

CS 758: Cryptography / Network Security offered in the Fall Semester, 2003, by Doug Stinson my office: DC 3122 my email address: dstinson@uwaterloo.ca my web page: http://cacr.math.uwaterloo.ca/~dstinson/index.html

159.334 Computer Networks. Network Security 1. Professor Richard Harris School of Engineering and Advanced Technology

Network Security 1 Professor Richard Harris School of Engineering and Advanced Technology Presentation Outline Overview of Identification and Authentication The importance of identification and Authentication

IT Networks & Security CERT Luncheon Series: Cryptography

IT Networks & Security CERT Luncheon Series: Cryptography Presented by Addam Schroll, IT Security & Privacy Analyst 1 Outline History Terms & Definitions Symmetric and Asymmetric Algorithms Hashing PKI

EXAM questions for the course TTM4135 - Information Security May 2013. Part 1

EXAM questions for the course TTM4135 - Information Security May 2013 Part 1 This part consists of 5 questions all from one common topic. The number of maximal points for every correctly answered question

Cryptography and Network Security

Cryptography and Network Security Fifth Edition by William Stallings Chapter 9 Public Key Cryptography and RSA Private-Key Cryptography traditional private/secret/single key cryptography uses one key shared

Cryptographic hash functions and MACs Solved Exercises for Cryptographic Hash Functions and MACs

Cryptographic hash functions and MACs Solved Exercises for Cryptographic Hash Functions and MACs Enes Pasalic University of Primorska Koper, 2014 Contents 1 Preface 3 2 Problems 4 2 1 Preface This is a

Network Security. Modes of Operation. Steven M. Bellovin February 3, 2009 1

Modes of Operation Steven M. Bellovin February 3, 2009 1 Using Cryptography As we ve already seen, using cryptography properly is not easy Many pitfalls! Errors in use can lead to very easy attacks You

Chapter 6 CDMA/802.11i

Chapter 6 CDMA/802.11i IC322 Fall 2014 Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 Some material copyright 1996-2012 J.F Kurose and K.W. Ross,

1 Introduction to Cryptography and Data Security 1 1.1 Overview of Cryptology (and This Book) 2 1.2 Symmetric Cryptography 4 1.2.1 Basics 4 1.2.2 Simple Symmetric Encryption: The Substitution Cipher...

Outline. Computer Science 418. Digital Signatures: Observations. Digital Signatures: Definition. Definition 1 (Digital signature) Digital Signatures

Outline Computer Science 418 Digital Signatures Mike Jacobson Department of Computer Science University of Calgary Week 12 1 Digital Signatures 2 Signatures via Public Key Cryptosystems 3 Provable 4 Mike

Evaluation of the RC4 Algorithm for Data Encryption

Evaluation of the RC4 Algorithm for Data Encryption Allam Mousa (1) and Ahmad Hamad (2) (1) Electrical Engineering Department An-Najah University, Nablus, Palestine (2) Systems Engineer PalTel Company,

Lecture 4 Data Encryption Standard (DES)

Lecture 4 Data Encryption Standard (DES) 1 Block Ciphers Map n-bit plaintext blocks to n-bit ciphertext blocks (n = block length). For n-bit plaintext and ciphertext blocks and a fixed key, the encryption

RSA BSAFE. Crypto-C Micro Edition for MFP SW Platform (psos) Security Policy. Version 3.0.0.1, 3.0.0.2 October 22, 2012

RSA BSAFE Crypto-C Micro Edition for MFP SW Platform (psos) Security Policy Version 3.0.0.1, 3.0.0.2 October 22, 2012 Strong encryption technology for C/C++ developers Contact Information See our Web sites

Victor Shoup Avi Rubin. fshoup,rubing@bellcore.com. Abstract

Session Key Distribution Using Smart Cards Victor Shoup Avi Rubin Bellcore, 445 South St., Morristown, NJ 07960 fshoup,rubing@bellcore.com Abstract In this paper, we investigate a method by which smart

Lecture Objectives. Lecture 8 Mobile Networks: Security in Wireless LANs and Mobile Networks. Agenda. References

Lecture Objectives Wireless Networks and Mobile Systems Lecture 8 Mobile Networks: Security in Wireless LANs and Mobile Networks Introduce security vulnerabilities and defenses Describe security functions

Network Security. Security of Wireless Local Area Networks. Chapter 15. Network Security (WS 2002): 15 Wireless LAN Security 1 Dr.-Ing G.

Network Security Chapter 15 Security of Wireless Local Area Networks Network Security WS 2002: 15 Wireless LAN Security 1 IEEE 802.11 IEEE 802.11 standardizes medium access control MAC and physical characteristics

How To Attack A Block Cipher With A Key Key (Dk) And A Key (K) On A 2Dns) On An Ipa (Ipa) On The Ipa 2Ds (Ipb) On Pcode)

Cryptography and Network Security Chapter 6 Fifth Edition by William Stallings Lecture slides by Lawrie Brown (with edits by RHB) Chapter 6 Block Cipher Operation Many savages at the present day regard

802.11 Security (WEP, WPA\WPA2) 19/05/2009. Giulio Rossetti Unipi Giulio.Rossetti@gmail.com

802.11 Security (WEP, WPA\WPA2) 19/05/2009 Giulio Rossetti Unipi Giulio.Rossetti@gmail.com 802.11 Security Standard: WEP Wired Equivalent Privacy The packets are encrypted, before sent, with a Secret Key

Secure Network Communications FIPS 140 2 Non Proprietary Security Policy

Secure Network Communications FIPS 140 2 Non Proprietary Security Policy 21 June 2010 Table of Contents Introduction Module Specification Ports and Interfaces Approved Algorithms Test Environment Roles

PGP - Pretty Good Privacy

I should be able to whisper something in your ear, even if your ear is 1000 miles away, and the government disagrees with that. -- Philip Zimmermann PGP - Pretty Good Privacy - services - message format

Overview of Symmetric Encryption

CS 361S Overview of Symmetric Encryption Vitaly Shmatikov Reading Assignment Read Kaufman 2.1-4 and 4.2 slide 2 Basic Problem ----- ----- -----? Given: both parties already know the same secret Goal: send

The Misuse of RC4 in Microsoft Word and Excel

The Misuse of RC4 in Microsoft Word and Excel Hongjun Wu Institute for Infocomm Research, Singapore hongjun@i2r.a-star.edu.sg Abstract. In this report, we point out a serious security flaw in Microsoft

Security. Contents. S-72.3240 Wireless Personal, Local, Metropolitan, and Wide Area Networks 1

Contents Security requirements Public key cryptography Key agreement/transport schemes Man-in-the-middle attack vulnerability Encryption. digital signature, hash, certification Complete security solutions

Overview of Public-Key Cryptography

CS 361S Overview of Public-Key Cryptography Vitaly Shmatikov slide 1 Reading Assignment Kaufman 6.1-6 slide 2 Public-Key Cryptography public key public key? private key Alice Bob Given: Everybody knows

Security Analysis of DRBG Using HMAC in NIST SP 800-90

Security Analysis of DRBG Using MAC in NIST SP 800-90 Shoichi irose Graduate School of Engineering, University of Fukui hrs shch@u-fukui.ac.jp Abstract. MAC DRBG is a deterministic random bit generator

MAC. SKE in Practice. Lecture 5

MAC. SKE in Practice. Lecture 5 Active Adversary Active Adversary An active adversary can inject messages into the channel Active Adversary An active adversary can inject messages into the channel Eve

Network Security Technology Network Management

COMPUTER NETWORKS Network Security Technology Network Management Source Encryption E(K,P) Decryption D(K,C) Destination The author of these slides is Dr. Mark Pullen of George Mason University. Permission

Cryptography Lecture 8. Digital signatures, hash functions

Cryptography Lecture 8 Digital signatures, hash functions A Message Authentication Code is what you get from symmetric cryptography A MAC is used to prevent Eve from creating a new message and inserting

Wireless Networks. Welcome to Wireless

Wireless Networks 11/1/2010 Wireless Networks 1 Welcome to Wireless Radio waves No need to be physically plugged into the network Remote access Coverage Personal Area Network (PAN) Local Area Network (LAN)

Cryptography: Motivation. Data Structures and Algorithms Cryptography. Secret Writing Methods. Many areas have sensitive information, e.g.

Cryptography: Motivation Many areas have sensitive information, e.g. Data Structures and Algorithms Cryptography Goodrich & Tamassia Sections 3.1.3 & 3.1.4 Introduction Simple Methods Asymmetric methods:

CRYPTOGRAPHY IN NETWORK SECURITY

ELE548 Research Essays CRYPTOGRAPHY IN NETWORK SECURITY AUTHOR: SHENGLI LI INSTRUCTOR: DR. JIEN-CHUNG LO Date: March 5, 1999 Computer network brings lots of great benefits and convenience to us. We can

Cryptography and Network Security, PART IV: Reviews, Patches, and11.2012 Theory 1 / 53

Cryptography and Network Security, PART IV: Reviews, Patches, and Theory Timo Karvi 11.2012 Cryptography and Network Security, PART IV: Reviews, Patches, and11.2012 Theory 1 / 53 Key Lengths I The old

Public Key Cryptography Overview

Ch.20 Public-Key Cryptography and Message Authentication I will talk about it later in this class Final: Wen (5/13) 1630-1830 HOLM 248» give you a sample exam» Mostly similar to homeworks» no electronic

Pulse Secure, LLC. January 9, 2015

Pulse Secure Network Connect Cryptographic Module Version 2.0 Non-Proprietary Security Policy Document Version 1.1 Pulse Secure, LLC. January 9, 2015 2015 by Pulse Secure, LLC. All rights reserved. May

SAMPLE EXAM QUESTIONS MODULE EE5552 NETWORK SECURITY AND ENCRYPTION ECE, SCHOOL OF ENGINEERING AND DESIGN BRUNEL UNIVERSITY UXBRIDGE MIDDLESEX, UK

SAMPLE EXAM QUESTIONS MODULE EE5552 NETWORK SECURITY AND ENCRYPTION September 2010 (reviewed September 2014) ECE, SCHOOL OF ENGINEERING AND DESIGN BRUNEL UNIVERSITY UXBRIDGE MIDDLESEX, UK NETWORK SECURITY

Common Pitfalls in Cryptography for Software Developers. OWASP AppSec Israel July 2006. The OWASP Foundation http://www.owasp.org/

Common Pitfalls in Cryptography for Software Developers OWASP AppSec Israel July 2006 Shay Zalalichin, CISSP AppSec Division Manager, Comsec Consulting shayz@comsecglobal.com Copyright 2006 - The OWASP

Designing Hash functions. Reviewing... Message Authentication Codes. and message authentication codes. We have seen how to authenticate messages:

Designing Hash functions and message authentication codes Reviewing... We have seen how to authenticate messages: Using symmetric encryption, in an heuristic fashion Using public-key encryption in interactive

Security and Authentication Primer

Security and Authentication Primer Manfred Jantscher and Peter H. Cole Auto-ID Labs White Paper WP-HARDWARE-025 Mr. Manfred Jantscher Visiting Master Student, School of Electrical and Electronics Engineering,

CIS433/533 - Computer and Network Security Cryptography

CIS433/533 - Computer and Network Security Cryptography Professor Kevin Butler Winter 2011 Computer and Information Science A historical moment Mary Queen of Scots is being held by Queen Elizabeth and

Network Security. Security Attacks. Normal flow: Interruption: 孫 宏 民 hmsun@cs.nthu.edu.tw Phone: 03-5742968 國 立 清 華 大 學 資 訊 工 程 系 資 訊 安 全 實 驗 室

Network Security 孫 宏 民 hmsun@cs.nthu.edu.tw Phone: 03-5742968 國 立 清 華 大 學 資 訊 工 程 系 資 訊 安 全 實 驗 室 Security Attacks Normal flow: sender receiver Interruption: Information source Information destination

Lecture 9 - Message Authentication Codes

Lecture 9 - Message Authentication Codes Boaz Barak March 1, 2010 Reading: Boneh-Shoup chapter 6, Sections 9.1 9.3. Data integrity Until now we ve only been interested in protecting secrecy of data. However,

CSCI-E46: Applied Network Security. Class 1: Introduction Cryptography Primer 1/26/16 CSCI-E46: APPLIED NETWORK SECURITY, SPRING 2016 1

CSCI-E46: Applied Network Security Class 1: Introduction Cryptography Primer 1/26/16 CSCI-E46: APPLIED NETWORK SECURITY, SPRING 2016 1 Welcome to CSCI-E46 Classroom & Schedule 53 Church Street L01 Wednesdays,

Side Channel Analysis and Embedded Systems Impact and Countermeasures

Side Channel Analysis and Embedded Systems Impact and Countermeasures Job de Haas Agenda Advances in Embedded Systems Security From USB stick to game console Current attacks Cryptographic devices Side

Remotely Keyed Encryption Using Non-Encrypting Smart Cards

THE ADVANCED COMPUTING SYSTEMS ASSOCIATION The following paper was originally published in the USENIX Workshop on Smartcard Technology Chicago, Illinois, USA, May 10 11, 1999 Remotely Keyed Encryption

Message Authentication

Message Authentication message authentication is concerned with: protecting the integrity of a message validating identity of originator non-repudiation of origin (dispute resolution) will consider the

Predictive Models for Min-Entropy Estimation

Predictive Models for Min-Entropy Estimation John Kelsey Kerry A. McKay Meltem Sönmez Turan National Institute of Standards and Technology meltem.turan@nist.gov September 15, 2015 Overview Cryptographic

Network Security. Abusayeed Saifullah. CS 5600 Computer Networks. These slides are adapted from Kurose and Ross 8-1

Network Security Abusayeed Saifullah CS 5600 Computer Networks These slides are adapted from Kurose and Ross 8-1 Public Key Cryptography symmetric key crypto v requires sender, receiver know shared secret

Network Security. Omer Rana

Network Security Omer Rana CM0255 Material from: Cryptography Components Sender Receiver Plaintext Encryption Ciphertext Decryption Plaintext Encryption algorithm: Plaintext Ciphertext Cipher: encryption

CSCE 465 Computer & Network Security

CSCE 465 Computer & Network Security Instructor: Dr. Guofei Gu http://courses.cse.tamu.edu/guofei/csce465/ Public Key Cryptogrophy 1 Roadmap Introduction RSA Diffie-Hellman Key Exchange Public key and

Cryptographic Engine

Cryptographic Engine HIGHLIGHTS This section of the manual contains the following major topics: 1.0 Introduction... 2 2.0 Registers... 4 3.0 Theory of Operation... 12 4.0 Module Operation... 27 5.0 Operation

The Skein Hash Function Family

The Skein Hash Function Family Version 1.3 1 Oct 2010 Niels Ferguson Stefan Lucks Bruce Schneier Doug Whiting Mihir Bellare Tadayoshi Kohno Jon Callas Jesse Walker Microsoft Corp., niels@microsoft.com

Notes on Network Security Prof. Hemant K. Soni

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

lundi 1 octobre 2012 In a set of N elements, by picking at random N elements, we have with high probability a collision two elements are equal

Symmetric Crypto Pierre-Alain Fouque Birthday Paradox In a set of N elements, by picking at random N elements, we have with high probability a collision two elements are equal N=365, about 23 people are

Block encryption. CS-4920: Lecture 7 Secret key cryptography. Determining the plaintext ciphertext mapping. CS4920-Lecture 7 4/1/2015

CS-4920: Lecture 7 Secret key cryptography Reading Chapter 3 (pp. 59-75, 92-93) Today s Outcomes Discuss block and key length issues related to secret key cryptography Define several terms related to secret

Privacy and Security in library RFID Issues, Practices and Architecture

Privacy and Security in library RFID Issues, Practices and Architecture David Molnar and David Wagner University of California, Berkeley CCS '04 October 2004 Overview Motivation RFID Background Library

7! Cryptographic Techniques! A Brief Introduction

7! Cryptographic Techniques! A Brief Introduction 7.1! Introduction to Cryptography! 7.2! Symmetric Encryption! 7.3! Asymmetric (Public-Key) Encryption! 7.4! Digital Signatures! 7.5! Public Key Infrastructures

Guide to Data Field Encryption

Guide to Data Field Encryption Contents Introduction 2 Common Concepts and Glossary 3 Encryption 3 Data Field Encryption 3 Cryptography 3 Keys and Key Management 5 Secure Cryptographic Device 7 Considerations

Lecture 9: Application of Cryptography

Lecture topics Cryptography basics Using SSL to secure communication links in J2EE programs Programmatic use of cryptography in Java Cryptography basics Encryption Transformation of data into a form that

Cryptographic mechanisms

General Secretariat for National Defence Central Directorate for Information Systems Security PRIME MINISTER Paris, 2007 september 14 No. 1904/SGDN/DCSSI/SDS/LCR Cryptographic mechanisms Rules and recommendations

Lukasz Pater CMMS Administrator and Developer

Lukasz Pater CMMS Administrator and Developer EDMS 1373428 Agenda Introduction Why do we need asymmetric ciphers? One-way functions RSA Cipher Message Integrity Examples Secure Socket Layer Single Sign

CSC474/574 - Information Systems Security: Homework1 Solutions Sketch

CSC474/574 - Information Systems Security: Homework1 Solutions Sketch February 20, 2005 1. Consider slide 12 in the handout for topic 2.2. Prove that the decryption process of a one-round Feistel cipher

Cryptography and Network Security Chapter 10

Cryptography and Network Security Chapter 10 Fifth Edition by William Stallings Lecture slides by Lawrie Brown (with edits by RHB) Chapter 10 Other Public Key Cryptosystems Amongst the tribes of Central

Lecture 6 - Cryptography

Lecture 6 - Cryptography CSE497b - Spring 2007 Introduction Computer and Network Security Professor Jaeger www.cse.psu.edu/~tjaeger/cse497b-s07 Question 2 Setup: Assume you and I don t know anything about

7 Network Security. 7.1 Introduction 7.2 Improving the Security 7.3 Internet Security Framework. 7.5 Absolute Security?

7 Network Security 7.1 Introduction 7.2 Improving the Security 7.3 Internet Security Framework 7.4 Firewalls 7.5 Absolute Security? 7.1 Introduction Security of Communications data transport e.g. risk

Security in IEEE 802.11 WLANs

Security in IEEE 802.11 WLANs 1 IEEE 802.11 Architecture Extended Service Set (ESS) Distribution System LAN Segment AP 3 AP 1 AP 2 MS MS Basic Service Set (BSS) Courtesy: Prashant Krishnamurthy, Univ Pittsburgh

Security+ Guide to Network Security Fundamentals, Third Edition. Chapter 6. Wireless Network Security

Security+ Guide to Network Security Fundamentals, Third Edition Chapter 6 Wireless Network Security Objectives Overview of IEEE 802.11 wireless security Define vulnerabilities of Open System Authentication,

CPE 462 VHDL: Simulation and Synthesis

CPE 462 VHDL: Simulation and Synthesis Topic #09 - a) Introduction to random numbers in hardware Fortuna was the goddess of fortune and personification of luck in Roman religion. She might bring good luck

How To Encrypt With A 64 Bit Block Cipher

The Data Encryption Standard (DES) As mentioned earlier there are two main types of cryptography in use today - symmetric or secret key cryptography and asymmetric or public key cryptography. Symmetric

FIPS 140 2 Non Proprietary Security Policy: Kingston Technology DataTraveler DT4000 Series USB Flash Drive

FIPS 140 2 Non Proprietary Security Policy Kingston Technology Company, Inc. DataTraveler DT4000 G2 Series USB Flash Drive Document Version 1.8 December 3, 2014 Document Version 1.8 Kingston Technology

CS155. Cryptography Overview

CS155 Cryptography Overview Cryptography Is n A tremendous tool n The basis for many security mechanisms Is not n The solution to all security problems n Reliable unless implemented properly n Reliable

Part I. Universität Klagenfurt - IWAS Multimedia Kommunikation (VK) M. Euchner; Mai 2001. Siemens AG 2001, ICN M NT

Part I Contents Part I Introduction to Information Security Definition of Crypto Cryptographic Objectives Security Threats and Attacks The process Security Security Services Cryptography Cryptography (code

Talk announcement please consider attending! Where: Maurer School of Law, Room 335 When: Thursday, Feb 5, 12PM 1:30PM Speaker: Rafael Pass, Associate Professor, Cornell University, Topic: Reasoning Cryptographically

Computer Security: Principles and Practice

Computer Security: Principles and Practice Chapter 20 Public-Key Cryptography and Message Authentication First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Public-Key Cryptography

Yale University Department of Computer Science

Yale University Department of Computer Science On Backtracking Resistance in Pseudorandom Bit Generation (preliminary version) Michael J. Fischer Michael S. Paterson Ewa Syta YALEU/DCS/TR-1466 October