Cryptographic Terminology - E-Commerce - Lecture Slides, Slides of Fundamentals of E-Commerce

Students of Communication, study E-Commerce as an auxiliary subject. these are the key points discussed in these Lecture Slides of E-Commerce : Cryptographic Terminology, Message, Before Encoding, After Encoding, Cipher Text, Plain Text, Information, Convert, Decryption Algorithm, Decode Message

Typology: Slides

2012/2013

Uploaded on 07/29/2013

sheil_34
sheil_34 🇮🇳

4.4

(14)

129 documents

1 / 10

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
4-21
Electronic Commerce (WS-02/03)
Cryptographic Terminology
Plain text: the message before encoding.
Cipher text: the message after encoding.
Key: information needed to convert from plain text to cipher text
(or vice-versa).
Function: the encryption or decryption algorithm used, in
conjunction with key, to encode or decode message.
Key distribution service: trusted service which hands out keys.
Docsity.com
pf3
pf4
pf5
pf8
pf9
pfa

Partial preview of the text

Download Cryptographic Terminology - E-Commerce - Lecture Slides and more Slides Fundamentals of E-Commerce in PDF only on Docsity!

Electronic Commerce (WS-02/03) 4-

Cryptographic Terminology

Plain text: the message before encoding. Cipher text: the message after encoding. Key: information needed to convert from plain text to cipher text (or vice-versa). Function: the encryption or decryption algorithm used, in conjunction with key, to encode or decode message. Key distribution service: trusted service which hands out keys.

Electronic Commerce (WS-02/03) 4-

Encryption

Encrypting data prevents unauthorised access and modification to the data (i.e. prevents eavesdropping and tampering). If encrypted data can only be decrypted with a matching key, this can be used to prove sender’s identity (i.e prevents masquerading). Likewise, it can be used to ensure that only intended recipients can use the data. Two main ways: secret key & public key.

Electronic Commerce (WS-02/03) 4-

Using Secret Keys

Sender and recipient exchange keys through some secure, trusted, non-network based means Sender encodes message using function and sends, knowing that only the holder of key (the intended recipient) can use it Recipient decodes message and knows that only sender could have generated it Message can be captured but is of no use

Electronic Commerce (WS-02/03) 4-

Brute force appraoch for determining K

AB Given Message M‘ = {M} KAB For all k oFor all M

  • If M k = M‘ then return k

Electronic Commerce (WS-02/03) 4-

Using Public Keys

Recipient generates key pair. Public key is published by trusted service. Sender gets public key, and uses this to encode message. Receiver decodes message. Replies can be encoded using sender’s public key from the trusted distribution service. Message can be captured but is of no use.

Electronic Commerce (WS-02/03) 4-

Cipher Block Chaining

n n+3 n+2 n+1 XOR E(K, M) n-3 n-2 n- plaintext blocks ciphertext blocks Initialization vector required (e.g., timestamp)

Electronic Commerce (WS-02/03) 4-

Cryptography: Secret Keys

Main Ideas o Confusion (XOR, circular shifing, ...) o Diffusion (transposition of plaintext block portions) Cyptographic Algorithms o DES (Data Encryption Standard, 1981, 56bit)

  • Encryption and decryption function identical o TEA (Tiny Encryption Algorithm, 128bit)
  • Wheeler and Needham 94 o IDEA (Intern. Data Encryption Algorithm, 128bit) o Blowfish