once upon a time…. not so far away
Post on 23-Feb-2016
65 Views
Preview:
DESCRIPTION
TRANSCRIPT
Once upon a time…. Not so far away
This is a story of four people. These people were not aware of it – but
they were all meant to be connected through one key aspect…
Jeremiah Meet Jeremiah AKA the "Weeping
prophet“ authoring the Book of
Jeremiah, Kings 1, Kings 2
Jeremiah likes walks on the beach, cursing his enemies and breaking earthenware bottles.
Adolf Meet Adolf Adolf is a painter Adolf weeps himself to
sleep at night (it has nothing to do with all the Jews he killed, though….)
Known for his attempt of trying to take over the world
Adolf Also known for his
attempts of collaborations with the following:
Snir & Amir Snir & Amir are
students at the ECE School at BGU.
They like TV, hangouts and spending time with their girlfriends.
They wept once a week this semester, at Sunday morning.
Data Encryption
AndCode
cracking
Encryption timeline
- Old age cryptography
- New age cryptography
- Cryptography until the mid 20th century
- Modern cryptography
OLD AGE CRYPTOGRAPHY The earliest use of cryptography
found in hieroglyphs from the Old Kingdom of Egypt circa 1900 BC.
Jeremiah made use of substitution ciphers (such as the Atbash cipher) around 500 to 600 BC.
Amir also uses Atbash cipher for his grocery list, which makes Sivan, his girlfriend, abuse him physically once a week.
NEW AGE CRYPTOGRAPHY Anagrams were used by
the pope and scientist like Galileo to hide secrets or to prove ownership on discoveries.
The Scottish queen Mary was executed after the code she used to communicate with novels who wanted to expel queen Elizabeth was cracked.
NEW AGE CRYPTOGRAPHY These days were also the time when
decoding encryption has begun. In the 9th century an Iraqi man named Al
Kandy developed a decoding method based on the analysis of frequencies in order to locate the common letters in an encrypted text and in that way to guess the rest of the words.
In the 21st century an Iraqi man named Shlomo Hava went on Sabbatical
Cryptography until the mid 20th century
Charles Babbage's work on mathematical cryptanalysis of polyalphabetic ciphers
The only unbreakable cipher, the One Time Pad
Adolf made heavy use, in several variants, of an electromechanical rotor machine known as Enigma
Modern Cryptography – Data Encryption : Computers Wifi is widely used with encryption algorithms Snir & Amir made a vast use of the above during this
semester. The longer the key is, the more difficult it is to crack the
code Introduction of the public-key Data Encryption Standard (DES), a symmetric-key cipher Advanced Encryption Standard (AES) Brute Force Brutus, one of Jeremiah’s enemies,
tried cracking Atbash using brute force
Modern Cryptography – Data Encryption : Computers
Secure Socket Layer, or SSL Claude E. Shannon is considered by many to
be the father of mathematical cryptography “Unbreakability” of a cipher Hashing is a common
technique used incryptography to encodeinformation quickly usingtypical algorithms
Modern Cryptography – Data Encryption
Calculation Challenge Bottle-necks:
Subjective to Decipher algorithms Mainly occurs on
administrative tasks,no so much at calclations
Uniqueness: Subjective to Encryption
type used1 2 3 4 5 6 7 8 9 10
0
200
400
600
800
1000
1200
Unbreakabilty
Ser
ial D
ecip
herin
g tim
e
Modern Cryptography – Data Encryption
Calculation Challenge – Parallel scheme
1 2 3 4 5 6 7 8 9 100
100
200
300
400
500
600
Unbreakability
Par
alle
l Dec
iphe
ring
time
with
var
iant
num
ber o
f pro
cess
es
Modern Cryptography – Data Encryption : Solution Techniques
MPI Multi-process shared or distributed memory process has its own local variables
openMP Multi-process easier to program and debug gradual parallelization
Condor Multi-core
What If… Brutus would have used openMP Jeremiah’s Atbash code
deciphering Speedup ~ Process num up to 22 Speedup max at 22
procs Efficiency ~ Amount
of CPU’s that Brutuslifts
1 2 3 4 5 6 7 8 9 100
0.5
1
1.5
2
2.5x 104
Unbreakability
Brutus uses Brute-ForceBrutus uses MPI
What If… Snir & Amir were not to use parallel
schemes Speeddown ~ exp(num’ of cores) Deficiency – We do not recommend
serial schemes
1 2 3 4 5 6 7 8 9 10-2.5
-2
-1.5
-1
-0.5
0
0.5x 10
4
Unbreakability
DeficiencySerial
What If… The Allied Forces were to use Condor Adolf’s plans were to be sabotaged
earlier Speedup ~ num’ of Enimga Machine
wheels Efficiency – Irrelevant to the Allied Forces
1 2 3 4 5 6 7 8 9 100
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5x 10
8
Unbreakability
Allied use of regular methodsAllied use of Condor
Bibliography http://research.cs.wisc.edu/htcondor/ Clay Breshears - The Art of Concurrency: A Thread Monkey's
Guide to Writing Parallel Applications William Gropp - Using MPI - 2nd Edition: Portable Parallel
Programming with the Message Passing Interface http://tel-zur.net/teaching/bgu/pp/index2014A.html http://www.dartmouth.edu/~rc/classes/intro_mpi/ https://computing.llnl.gov/tutorials/parallel_comp/ http://en.wikipedia.org/wiki/History_of_cryptography http://en.wikipedia.org/wiki/Jeremiah http://en.wikipedia.org/wiki/Hitler http://en.wikipedia.org/wiki/Anagram
top related