et4085 et5085 keamanan jaringan telekomunikasi et4085 et5085 telecommunication network security n.
Skip this Video
Loading SlideShow in 5 Seconds..
ET4085/ET5085 Keamanan Jaringan Telekomunikasi ET4085/ET5085 Telecommunication Network Security PowerPoint Presentation
Download Presentation
ET4085/ET5085 Keamanan Jaringan Telekomunikasi ET4085/ET5085 Telecommunication Network Security

Loading in 2 Seconds...

play fullscreen
1 / 68

ET4085/ET5085 Keamanan Jaringan Telekomunikasi ET4085/ET5085 Telecommunication Network Security - PowerPoint PPT Presentation

  • Uploaded on

ET4085/ET5085 Keamanan Jaringan Telekomunikasi ET4085/ET5085 Telecommunication Network Security . Tutun Juhana Telecommunication engineering School of electrical engineering & informatics Institut teknologi bandung Cryptography.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
Download Presentation

PowerPoint Slideshow about 'ET4085/ET5085 Keamanan Jaringan Telekomunikasi ET4085/ET5085 Telecommunication Network Security' - nariko

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
et4085 et5085 keamanan jaringan telekomunikasi et4085 et5085 telecommunication network security

ET4085/ET5085 KeamananJaringanTelekomunikasiET4085/ET5085 Telecommunication Network Security

Tutun Juhana

Telecommunication engineering

School of electrical engineering & informatics

Institut teknologi bandung


  • Came from Greek cryptography krupto(hidden or secret) and grafh(written)
    • Art of secret writing


Data Authentication

    • Data integrity

Data Integrity

Data origin authentication



He can claim that he is A

Non-repudiation of origin

Data confidentiality
  • ?

friends and enemies alice bob trudy
Friends and enemies: Alice, Bob, Trudy

well-known in network security world

Bob, Alice (lovers!) want to communicate “securely”

Trudy (intruder) may intercept, delete, add messages

who might bob alice be
Who might Bob, Alice be?

Real-life Bobs and Alices!

Web browser/server for electronic transactions (e.g., on-line purchases)

on-line banking client/server

DNS servers

routers exchanging routing table updates


the language of cryptography
The language of cryptography

m plaintext message

KA(m) ciphertext, encrypted with key KA

m = KB(KA(m))

symmetric key crypto: sender, receiver keys identical

public-key crypto: encryption key public, decryption key secret (private)

symmetric key cryptography
Symmetric key cryptography
  • symmetric key crypto: Bob and Alice share known same (symmetric) key: KAB
    • e.g., key is knowing substitution pattern in mono alphabetic substitution cipher


substitution cipher: substituting one thing for another

    • monoalphabetic cipher: substitute one letter for another

deciphering techniques attacks on a cryptosystem
Deciphering techniques (attacks on a cryptosystem)
  • Cipher-text only attack: no clue about contents of message: statistical analysis
  • Known-plaintext attack: trudy has some plaintext for some ciphertext
    • eg, in monoalphabetic cipher, trudy determines pairings for a,l,i,c,e,b,o
  • Chosen-plaintext attack: trudy can get the cyphertext for some chosen plaintext
    • Eg, Trudy masquerades as Alice


Statistical analysis example

A typical distribution of letters in English language text


Suppose we have intercepted the cipher-text below, and it is known to be encrypted using a simple substitution cipher

  • For this example, uppercase letters are used to denote ciphertext, lowercase letters are used to denote plaintext (or guesses at such), and X~t is used to express a guess that ciphertext letter X represents the plaintext letter t.
  • We could use frequency analysis to help solve the message along the following lines: counts of the letters in the cryptogram show that I is the most common single letter, XL most common bigram, and XLI is the most common trigram. e is the most common letter in the English language, th is the most common bigram, and the is the most common trigram. This strongly suggests that X~t, L~h and I~e. The second most common letter in the cryptogram is E; since the first and second most frequent letters in the English language, e and t are accounted for, We guess that E~a, the third most frequent letter. Tentatively making these assumptions, the following partial decrypted message is obtained.



  • Using these initial guesses, We can spot patterns that confirm our choices, such as "that". Moreover, other patterns suggest further guesses. "Rtate" might be "state", which would mean R~s. Similarly "atthattMZe" could be guessed as "atthattime", yielding M~i and Z~m. Furthermore, "heVe" might be "here", giving V~r. Filling in these guesses, We get:
  • hereTCSWPeYraWHarSseQithaYraOeaWHstatePFairaWHKrSTYhtmetheKeetPeJrSmaYPassGasei WQhiGhitQaseWGPSseHitQasaKeaTtiJTPsGaraKaeTsaWHatthattimeTWAWSQWtSWatTraPistsSJ GSTrseaYreatCriUeiWasGieWtiJiGCSiWtSJOieQthereQeretQSrSTWHKPaGAsCStsWearSWeeBtr emitFSJtheKaGAaWHaPSWYSWeWeartheStherthesGaPesQereeBGeeHiWYPFharHaWHYPSssFQitha PPtheaCCearaWGeSJKTrWisheHYSPHtheQeiYhtSJtheiWseGtQasOerFremarAaKPeaWHtaAiWYaPP thiWYsiWtSGSWsiHeratiSWiGSTPHharHPFKPameNTCiterJSrhisSCiWiSWresCeGtiWYit


Penjahat #2 melakukan

penyadapan kemudian

Mempelajari ciphertext dari

PIN baru tersebut

Chosen-Plaintext Attack example

PIN di-enkripsi lalu

dikirimkan ke bank


Penjahat #1 merubah

PIN yang dimilikinya

(chosen plaintext)

… diulangi untuk beberapa nilai PIN


polyalphabetic encryption
Polyalphabetic encryption

The Alberti cipher by Leon Battista Alberti around 1467 was believed to be the first polyalphabetic cipher

But at 750 AD , Abu Yusuf Yaqub ibn Is-haq Al-Kindi, authored a book on cryptology the "Risalah fi Istikhraj al-Mu'amma" (Manuscript for the Deciphering Cryptographic Messages)

Leon Battista Alberti

Abu Yusuf Yaqub ibn Is-haq Al-Kindi


n monoalphabetic cyphers, M1,M2,…,Mn

  • Cycling pattern:
    • e.g., n=4, M1,M3,M4,M3,M2; M1,M3,M4,M3,M2;
  • For each new plaintext symbol, use subsequent monoalphabetic pattern in cyclic pattern
    • dog: d from M1, o from M3, g from M4
  • Key: the n ciphers and the cyclic pattern


How this Cipher Works?

Pick a keyword (for our example, the keyword will be "MEC").

Write your keyword across the top of the text you want to encipher, repeating it as many times as necessary.

For each letter, look at the letter of the keyword above it (if it was 'M', then you would go to the row that starts with an 'M'), and find that row in the Vigenere table.

Then find the column of your plaintext letter (for example, 'w', so the twenty-third column)

Finally, trace down that column until you reach the row you found before and write down the letter in the cell where they intersect (in this case, you find an 'I' there).

symmetric stream ciphers
Symmetric: Stream Ciphers
  • Combine each byte of keystream with byte of plaintext to get b of ciphertext
  • p(i) = ithunit of message
  • ks(i) = ithunit of keystream
  • c(i) = ithunit of ciphertext
  • c(i) = ks(i) ⊕ p(i)
    • (⊕ = exclusive or)
  • p(i) = ks(i) ⊕ c(i)

problems with stream ciphers
Problems with stream ciphers
  • Known plain-text attack
    • There’s often predictable and repetitive data in communication messages
    • attacker receives some cipher text c and correctly guesses corresponding plaintext m
    • ks = m ⊕ c
    • Attacker now observes c’
    • m’ = (m ⊕ c) ⊕ c’


Even easier

    • Attacker obtains two ciphertexts, c and c’, generating with same key sequence
    • c ⊕ c’ = m ⊕ m’
    • There are well known methods for decrypting 2 plaintexts given their XOR


Integrity problem too

    • supppose attacker knows m and c;
    • want to change m to m’
    • c’ = c ⊕ (m ⊕ m’)
    • send c’ to destination


Example of stream cipher:

    • A5 (for GSM)
    • RC4

symmetric encryption block ciphers
Symmetric encryption: block ciphers

Message to be encrypted is processed in blocks of bytes (8 or 16).

Block cipher: huge lookup table

Example: 2-bit blocks and 2-bit keys


Each column should be a random permutation of all possible output strings

  • If block is 64 bits and key is 56 bits, have 264 rows, 256 columns, 2120 entries
  • Table too big: instead use function that simulates a randomly permuted table
  • c(i) = KAB(m(i)) : encrypt block m(i) using key AB
  • m(i) = KAB(c(i)) : decrypt block c(i) using key AB
  • Problem: if m(i) and m(j) same, c(i) and c(j) same
    • Attacker may be able to guess m(i) from context of message

block ciphers cipher block chaining
Block ciphers: cipher block chaining
  • Don’t want same plaintext giving same ciphertext
    • Have encryption of current block depend on result of previous block
    • c(i) = KAB( m(i) ⊕ c(i-1) )
    • m(i) = KAB( c(i) ⊕ c(i-1) )
  • How do we encrypt first block?
    • Initialization vector (IV): random block = c(0)
    • IVs do not have to be secret

symmetric key crypto des
Symmetric key crypto: DES
  • DES: Data Encryption Standard
    • US encryption standard [NIST 1993]
    • 56-bit symmetric key, 64-bit plaintext input
    • Block cipher with cipher block chaining
  • How secure is DES?
    • DES Challenge: 56-bit-key-encrypted phrase decrypted (brute force) in less than a day
    • No known good analytic attack
  • making DES more secure:
    • 3DES: encrypt 3 times with 3 different keys (actually encrypt, decrypt, encrypt)


DES operation

initial permutation

16 identical “rounds” of function application, each using different 48 bits of key

final permutation

aes advanced encryption standard
AES: Advanced Encryption Standard

New (Nov. 2001) symmetric-key NIST standard, replacing DES

processes data in 128 bit blocks

128, 192, or 256 bit keys

brute force decryption (try each key) taking 1 sec on DES, takes 149 trillion years for AES

key distribution center kdc
Key Distribution Center (KDC)


Alice, Bob need shared symmetric key.

KDC: server shares different secret key with each registered user (many users)

Alice, Bob know own symmetric keys, KA-KDC KB-KDC , for communicating with KDC.


Q: How does KDC allow Bob, Alice to determine shared symmetric secret key to communicate with each other?

public key cryptography
Public Key Cryptography
  • symmetric key crypto
    • requires sender, receiver know shared secret key
    • Q: how to agree on key in first place (particularly if never “met”)?
  • public key cryptography
    • radically different approach [Diffie-Hellman76, RSA78]
    • sender, receiver do not share secret key
    • public encryption key known to all
    • private decryption key known only to receiver

rsa choosing keys
RSA: Choosing keys

rsa encryption decryption
RSA: Encryption, decryption

rsa example
RSA example

rsa another important property
RSA: another important property

rsa is slow
RSA is slow
  • Exponentiation is computationally intensive
  • DES is at least 100 times faster than RSA
  • Session key, KS
    • Bob and Alice use RSA to exchange a symmetric key KS
    • Once both have KS, they use DES

message authentication
Message Authentication
  • Allows communicating parties to verify that received messages are authentic.
    • Verify content of message has not been altered
    • Source is authentic
    • Message has not been artificially delayed (playback attack)
    • Sequence of messages is maintained


Why not use encryption?

    • Often overkill, computationally expensive
    • Broadcast message
  • Let’s first talk about message digests

message digests
Message Digests

Function H( ) that takes as input an arbitrary length message and outputs a fixed-length strength: “message signature”

Note that H( ) is a many to-1 function

H( ) is often called a “hash function”


Desirable properties:

    • Easy to calculate
    • Irreversibility: Can’t determine m from H(m)
    • Collision resistance: Computationally difficult to produce m and m’ such that H(m) = H(m’)
    • Seemingly random output

hash function algorithms
Hash Function Algorithms
  • MD5 hash function widely used (RFC 1321)
    • computes 128-bit message digest in 4-step process.
    • arbitrary 128-bit string x
      • appears difficult to construct msg m whose MD5 hash is equal to x.
  • SHA-1 is also used.
    • US standard [NIST, FIPS PUB 180-1]
    • 160-bit message digest

digital signatures
Digital Signatures

Cryptographic technique analogous to handwritten signatures.

sender (Bob) digitally signs document, establishing he is document owner/creator.

verifiable, nonforgeable: recipient (Alice) can prove to someone that Bob, and no one else (including Alice), must have signed document

digital signature standard
Digital Signature Standard

certification authorities
Certification Authorities
  • Certification authority (CA): binds public key to particular entity, E.
  • E (person, router) registers its public key with CA.
    • E provides “proof of identity” to CA.
    • CA creates certificate binding E to its public key.
    • certificate containing E’s public key digitally signed by CA
      • CA says “this is E’s public key”


When Alice wants Bob’s public key:

    • gets Bob’s certificate (Bob or elsewhere).
    • apply CA’s public key to Bob’s certificate, get Bob’s public key

certificates summary
Certificates: summary
  • Primary standard X.509 (RFC 2459)
  • Certificate contains:
    • Issuer name
    • Entity name, address, domain name, etc.
    • Entity’s public key
    • Digital signature (signed with issuer’s private key)

end point authentication
End-point authentication

Goal: Bob wants Alice to “prove” her identity to him

Protocol ap1.0: Alice says “I am Alice”


Goal: Bob wants Alice to “prove” her identity to him

Protocol ap1.0: Alice says “I am Alice”

end point authentication another try
End-point authentication: another try

Protocol ap2.0: Alice says “I am Alice” in an IP packet containing her source IP address


Protocol ap2.0: Alice says “I am Alice” in an IP packet containing her source IP address

end point authentication another try1
End-point authentication: another try

Protocol ap3.0: Alice says “I am Alice” and sends her secret password to “prove” it.


Protocol ap3.0: Alice says “I am Alice” and sends her secret password to “prove” it.

end point authentication yet another try
End-point authentication: yet another try

Protocol ap3.1: Alice says “I am Alice” and sends her encrypted secret password to “prove” it.


Protocol ap3.1: Alice says “I am Alice” and sends her encrypted secret password to “prove” it.

end point authentication yet another try1
End-point authentication: yet another try

Goal: avoid playback attack

Nonce: number (R) used only once-in-a-lifetime

ap4.0: to prove Alice “live”, Bob sends Alice nonce, R. Alice must return R, encrypted with shared secret key

end point authentication ap5 0
End-point authentication: ap5.0

ap4.0 requires shared symmetric key

can we authenticate using public key techniques?

ap5.0: use nonce, public key cryptography

ap5 0 security hole
ap5.0: security hole

Man (woman) in the middle attack: Trudy poses as Alice (to Bob) and as Bob (to Alice)

ap5 0 security hole1
ap5.0: security hole

Man (woman) in the middle attack: Trudy poses as Alice (to Bob) and as Bob (to Alice)