Scribd
Upload
3 views

Design and Coding Theory Week Edited 10-01-02 (1)

The document outlines the fundamentals of coding theory and cryptography, covering topics such as error-correcting codes, secret-key and public-key cryptosystems, digital signatures, and quantum cryptography. It emphasizes the importance of protecting information against noise and ensuring privacy in communication. Additionally, it highlights the historical context of cryptography and its evolution through battles between codemakers and codebreakers.

Uploaded by

gulde.jhey8
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views

Design and Coding Theory Week Edited 10-01-02 (1)

The document outlines the fundamentals of coding theory and cryptography, covering topics such as error-correcting codes, secret-key and public-key cryptosystems, digital signatures, and quantum cryptography. It emphasizes the importance of protecting information against noise and ensuring privacy in communication. Additionally, it highlights the historical context of cryptography and its evolution through battles between codemakers and codebreakers.

Uploaded by

gulde.jhey8
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

IV054 CODING, CRYPTOGRAPHY and CRYPTOGRAPHIC PROTOCOLS

Dr. Siraj Muhammad

CONTENTS
1. Basics of coding theory
2. Linear codes
3. Cyclic codes
4. Secret-key cryptosystems
5. Public-key cryptosystems, I. Key exchange, knapsack, RSA
6. Public-key cryptosystems, II. Other cryptosystems, security,
PRG, hash functions
7. Digital signatures
8. Elliptic curves cryptography and factorization
9. Identification, authentication, secret sharing and e-commerce
10. Protocols to do seemingly impossible and zero-knowledge protocols
11a. Steganography and Watermarking
11b. From theory to practice in cryptography
12. Quantum cryptography

Basics of coding theory 1


IV054 LITERATURE
• R. Hill: A first course in coding theory, Claredon Press, 1985
• V. Pless: Introduction to the theory of error-correcting codes, John Willey,
1998
• J. Gruska: Foundations of computing, Thomson International Computer
Press, 1997
• A. Salomaa: Public-key cryptography, Springer, 1990
• D. R. Stinson: Cryptography: theory and practice, CRC Press, 1995
• W. Trappe, L. Washington: Introduction to cryptography with coding theory
• B. Schneier: Applied cryptography, John Willey and Sons, 1996
• J. Gruska: Quantum computing, McGraw-Hill, 1999 (For additions and
updatings: http://www.mcgraw-hill.co.uk/gruska)
• S. Singh, The code book, Anchor Books, 1999
• D. Kahn: The codebreakers. Two story of secret writing. Macmillan, 1996
(An entertaining and informative history of cryptography.)

Basics of coding theory 2


IV054 INTRODUCTION
• Transmission of classical information in time and space is nowadays very easy
(through noiseless channel).
It took centuries, and many ingenious developments and discoveries (writing, book
printing, photography, movies, telegraph, telephone, radio transmissions,TV, -
sounds recording – records, tapes, discs) and the idea of the digitalisation of all
forms of information to discover fully this property of information.
Coding theory develops methods to protect information against a noise.
• Information is becoming an increasingly valuable commodity for both individuals
and society.
Cryptography develops methods how to ensure secrecy of information and privacy
of users.
• A very important property of information is that it is often very easy to make
unlimited number of copies of information.
Steganography develops methods to hide important information in innocently
looking information (and that can be used to protect intellectual properties).

Basics of coding theory 3


IV054 HISTORY OF CRYPTOGRAPHY

The history of cryptography is the story of centuries-old battles


between codemakers (ciphermakers) and codebreakers
(cipherbreakers), an intellectual arms race that has had a
dramatic impact on the course of history.

The ongoing battle between codemakers and codebreakers


has inspired a whole series of remarkable scientific
breakthroughts.

History is full of ciphers. They have decided the outcomes of


battles and led to the deaths of kings and queens.

Security of communication and data and privacy of users are of


key importance for information society. Cryptography, broadly
understood, is an important tool to achieve such a goal.

Basics of coding theory 4


IV054 CHAPTER 1: Basics of coding theory

ABSTRACT

Coding theory - theory of error correcting codes - is one of the most interesting and
applied part of mathematics and informatics.

All real communication systems that work with digitally represented data, as CD
players, TV, fax machines, internet, satellites, mobiles, require to use error
correcting codes because all real channels are, to some extent, noisy – due to
interference caused by environment
 Coding theory problems are therefore among the very basic and most frequent
problems of storage and transmission of information.
 Coding theory results allow to create reliable systems out of unreliable systems
to store and/or to transmit information.
 Coding theory methods are often elegant applications of very basic concepts
and methods of (abstract) algebra.

This first chapter presents and illustrates the very basic problems, concepts,
methods and results of coding theory.

Basics of coding theory 5


IV054 Coding - basic concepts
Without coding theory and error-correcting codes there would be no deep-space
travel and pictures, no satellite TV, no compact disc, no … no … no ….
Error-correcting codes are used to correct messages when they are transmitted
through noisy channels.

Error correcting framework


Example

A code C over an alphabet S is a subset of S* - (C Ě S*).


A q -nary code is a code over an alphabet of q -symbols.
A binary code is a code over the alphabet {0,1}.
Examples of codes C1 = {00, 01, 10, 11} C2 = {000, 010, 101, 100}
C3 = {00000, 01101, 10111, 11011}
Basics of coding theory 6
IV054 CHANNEL

is any physical medium through which information is transmitted.


(Telephone lines and the atmosphere are examples of channels.)

NOISE
may be caused by sunspots, lighting, meteor showers, random radio disturbance,
poor typing, poor hearing, ….

TRANSMISSION GOALS
1. Fast encoding of information.
2. Easy transmission of encoded messages.
3. Fast decoding of received messages.
4. Reliable correction of errors introduced in the channel.
5. Maximum transfer of information per unit time.

BASIC METHOD OF FIGHTING ERRORS: REDUNDANCY!!!


0 is encoded as 00000 and 1 is encoded as 11111.

Basics of coding theory 7


IV054 IMPORTANCE of ERROR-CORRECTING CODES

In a good cryptosystem a change of a single bit of the


cryptotext should change so many bits of the plaintext
obtained from the cryptotext that the plaintext gets
uncomprehensible.

Methods to detect and correct errors when cryptotexts


are transmitted are therefore much needed.

Also many non-cryptographic applications require error-


correcting codes. For example, mobiles, CD-players,…

Basics of coding theory 8


IV054 BASIC IDEA
The details of techniques used to protect information
against noise in practice are sometimes rather
complicated, but basic principles are easily understood.

The key idea is that in order to protect a message


against a noise, we should encode the message by
adding some redundant information to the message.

In such a case, even if the message is corrupted by a


noise, there will be enough redundancy in the encoded
message to recover- to decode the message
completely.
Basics of coding theory 9
IV054 EXAMPLE
In case of: encoding

0000 1 111

1
the probability of the bit error p  , and the majority voting decoding
2

000, 001, 010, 100  000, 111, 110, 101, 011  111

the probability of an erroneous decoding (if there are 2 or 3 errors) is

3 p 2 (1  p )  p 3 3 p 2  2 p 3  p

Basics of coding theory 10

You might also like