Scribd
Upload
7 views4 pages

ATBMTT - Docs

Uploaded by

hoanghiep382003
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views4 pages

ATBMTT - Docs

Uploaded by

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

Chapter 1: Introduction

1. Basic Definitions
Cryptology (mậ t mã họ c) = cryptography (mã hoá ) + cryptoanalysis (thá m mã )
Cryptology í a stydy field that invents new algorithms, protocal,
mechanism for information encryption and breaking security system
Cryptography invents new method for building cryptgraphy
systems, signatures, hash function and protocols
To ensure the secret of an assetm valuable informaton, systems we
have to use cryptosystems toward this end, the system convert/transform the input information
from its origin representation to a secret form (not able to understand)
This is the encryption process. The input information is called
plaintext (P) / bả n rõ , the result is called ciphertext (C) / bả n mã the needed extra information to
perform the encryption is called key (K). the inversed process is so called decryption/ giả i mã :
convert a ciphertext to its corresponding plaintext
Component of a crypt system
1, A plaintext space / Khô ng gian bả n rõ = all the message that can be formed base on alphabet
2, A ciphertext space / Khô ng gian cá c bả n mã = the limited ciphertext that can be genarated from
all the plaintexts avaiable
3, Key space (K) / khô ng gian khoá : a limited set of valuethat can be used for encryption and
decryption
4, An encryption algorithm called e: C = ek (P)
5, An decryption algorithm called d = e-1 : p = dk (C)

2. Basic Encryption / Decryption


Subsitution/ thay thế : replacing a input element by another value in the alphabet
Permitation/ hoá n vị : exchange a positions of input elements within the plaintext
Modern Cipher utilize both of the above methods decently
Crypto taxonomy
Base on the number of used keys: hash function endcoding/decoding , no key, symmetric / đố i
xứ ng – 1 key for both encryption and decryption (so called secret key) ; 2 key/asymmetric/public
key: 1 secret key and 1 public key
Base on input data processing method block cipher/mã khố i – data manipulation on same size
block and stream ciphers/mã luồ ng/dò ng the whole input data is treated as a continous stream

Imformation transmisson cheme


The above scheme is picture to model an office with sender and receiver are office staffs (so names
are Alice, Bob, David, Eve,…) The most notable things in the scheme is the tranmission channels is
always insecured by default – Internet is not secured
The Kirchoff’s rule: The whole encryption/ decryption me
chanisms are not secret to enemies. This means: the secure of a cryptography system is not relied
on the complexity of the used algorithms the system’s secure is soly base on the used keys

3. Brief history of cryptography


Begin same time before B.C ad was used mainly for military and diplomacy
Strongly developed during the middle age in Entropean but be considered as an art more then a
science
Be used more frequently in WW I and II, The II ended with special even (England’ ermy broke
Enigma machine of German so that they could read all secret messages
In 1945 the Information theory of shannon opened a new developing ever for cryptography up to
now
All the systems invented before 1945 are called classical ones
Then when the computers appreared in 1970, The secret key / block chiper were invented
When the internet become popular in 1980s, a new kind of systems: public key and digital system
were created along with digital schemes has function were born

Chapter 2: Mathematic Background


1. Information Theory
Entropy : the smallest number of bits for encoding a message
Eg: Entropy (gender) = 2, entropy(day of week) = 3, Entroy(date) = 5
Entropy of a message M is denoted as H(M) and computed as H(M) = Log2(n) where n is the
meaning of M
Rage of language / tố c độ củ a ngô n ngữ
Actual rate: r = H(M) / N where M is all N-characters message of language
Absolute rate: R = log2L where L is characters of the alphabet of the language R(English) = Log226 =
4.7 , R(Vietnamese) = Log2(29) = 4.85
The redundancy of a language D = R – r . D(English) = 4.7 – 1.3 = 3.4 bits/1char
Entropy of a cryptosystem u = H(c) / D = log2|K|/D . u is the smallist number of ciphertexts needed
to break a system successfully. So to impove the security of a system

2. Maths – Module Số Học


Nếu a và n là hai số nguyên dương và a = k*n + I thì ta viết a mod n = I
Nếu a mod n = b mod n thì ta nó i a đồ ng dư vớ i b theo module n và viết a ≡ b (mod n) hay đơn giả n
là a = b (mod n)
Và nh Zn = {0,1,2,…,n-1} trên đó định nghĩa 2 phép toá n nhâ n và cộ ng như sau
∀ a,b ∈ Zn
a + b = (a + b) mod n
a.b = (a*b)mod n
Zn đượ c gọ i là và nh đồ ng dư theo Module n
+ 0 là phầ n tử trung hoà : a + 0 = 0 + a = a
+ 1 là phầ n tử đơn vị: a.1 = 1.a = a
+ N = 7, Z7 = {0,1,2,3,4,5,6}, a = 3, b = 6 => a + b = 9 mod 7 = 2, a.b = 18 mod 7 = 4

Số họ c
Ướ c số : mô t số a chia hết (phầ n dư bằ ng 0) cho số n thì t nó i a chia hết cho n và n là mộ t ướ c củ a a
Só nguyên tố : …
Cá c số khô ng phả i nguyên tố là hợ p số
2 số a,b đượ c gọ i là nguyê n tố gầ n nhau nếu chú ng chỉ có 1 ướ c số chung duy nhấ t là 1 và ký hiệu là
(a,b) = 1
Khai niệm phầ n tư nghịch đả o: a.b = 1=> b là phầ n tử nghịch đả o củ a a và kí hiệu a-1 = b. Ví dụ : N =
13, a = 4, a-1 = 10; b = 7, b-1 = 2
ĐN sự tồ n tạ i phầ n tử nghịch đả o: nếu (a,h) = 1 => tồ n tạ i duy nhấ t b = a-1 (B ∈ Zn )
Định lý ơ le: cá c số nhỏ hơn n và nguyê n tố cù ng nhau vớ i n là Φ (n) (gọ i là hà m phi ơ le)

Thuật toán tìm phần tử nghịch đảo


Thuậ t toá n tìm phầ n tử nghịch đả o (Chiver) hay cò n gọ i là ơ clit mở rộ ng
-Ví dụ n = 100 , a = 17 cầ n tìm a-1 trên Z100

You might also like