null
US
Sign In
Sign Up for Free
Sign Up
We have detected that Javascript is not enabled in your browser. The dynamic nature of our site means that Javascript must be enabled to function properly. Please read our
terms and conditions
for more information.
Next up
Copy and Edit
You need to log in to complete this action!
Register for Free
53640
Crypto U8 (part 1), Randomness
Description
IYM002 (Unit 8 - randomness, freshness, AKE) Mind Map on Crypto U8 (part 1), Randomness, created by jjanesko on 22/04/2013.
No tags specified
iym002
unit 8 - randomness
freshness
ake
iym002
unit 8 - randomness, freshness, ake
Mind Map by
jjanesko
, updated more than 1 year ago
More
Less
Created by
jjanesko
over 11 years ago
74
9
0
Resource summary
Crypto U8 (part 1), Randomness
meaning
uncertainty
unpredictability
have no relation to previous chosen numbers
have no obvious structure
randomn values in cryptography
salt
random data that are used as an additional input to a one-way function that hashes a password or passphrase.
ex. Unix password file
IVs (initialization vector)
a fixed-size input to a cryptographic primitive that is typically required to be random or pseudorandom.
ex. cipher block chaining mode
values used for freshness checks in cryptographic protocols
nonce = number used only once
sender sends randomly generated nonce to receiver, receiver sends nonce back with reply to show reply belongs to the original message
random numbers used to generate symmetric keys
random process are used to generate keys
non-deterministic is better than pseudorandom for master keys
somehow required in El Gamal, but don't understand why
What should seem random?
keystreams
hash codes
ciphertexts
generating random numbers
non-deterministic
advantages and disadvantages
expensive
completely random
cannot replicate in another location (so tough to synchronize)
based on randomess proced by physical phenomena
hardware
measurement of white noise from electrical appliances
quantum measurement of a photon reflected in a mirror
software
keystroke captures
hard drive seek times
deterministic (pseudorandom)
how does it work?
takes a seed value and outputs a string of bits with no apparent structure
2 parts
seed
should be different every time & not guessable
usually short
usually a "standard" length (like 128 bits)
generator
use standard, well known ones (nothing home made)
advantages and disadvantages
cheap to implement
two identical outputs can be generated in 2 different locations (synchronizable)
have to find way to distribute seed
Show full summary
Hide full summary
Want to create your own
Mind Maps
for
free
with GoConqr?
Learn more
.
Similar
Crypto U8 (part 3), entity authentication
jjanesko
Crypto U8, example dynamic password scheme
jjanesko
Crypto U8 (part 2), Freshness
jjanesko
Crypto U4, Block Cipher, Cipher Feedback Mode (CFB)
jjanesko
Crypto U4, Block Cipher, Cipher Block Chaining Mode (CBC)
jjanesko
Crypto U3, Theoretical vs. Practical Security
jjanesko
Crypto U1, Basic Principles
jjanesko
Crypto U4, Stream Cipher
jjanesko
Crypto U4, Block Cipher, Counter Mode
jjanesko
Crypto U4, Block Cipher, Electronic Codebook Mode (ECB)
jjanesko
Crypto U2, Crypto design principles
jjanesko
Browse Library