Criptografie
Criptografie
Criptografie
Algorithm
Cryptographic Module
Product
Application / System
II. Cryptology
Some example: crypto algorithms
• Cryptographic algorithms ensure: confidentiality
and integrity (authentication, non repudiation and
protection against errors) of the data;
• Two type of algorithms: asymmetric (two
different keys, one for encryption another for
decryption, based on the computational difficulty
of several problems: e.g. RSA [factoring], ElGamal
[discreet log problem] and their extension to Elliptic
curves) and symmetric (the same key used for
encryption and decryption, e.g. AES).
Symmetric ciphers: block and stream
(P)RKG (P)RKG
Asymmetric ciphers: example RSA
USER A: Open directory
USER B:
Na = pa . qa A Nb = p b . q b
pa . qa tow secret large primes Na pb . qb tow secret large primes
φ(Na) = (pa-1).(qa -1) Ea
φ(Nb) = (pb-1).(qb -1)
Ea = open key of A B
Nb Eb = open key of B
Da = Ea-1 [mod φ(Na) ] Eb Db = Eb-1 [mod φ(Nb) ]
.
A signs Document M to B:
Da (M,S) Ea Da Ea
M = S (A signes M) S =M =M’ (Verify M’=M)
gcd (Ea , φ(Na) ) = 1 gcd (Eb , φ(Nb) ) = 1
Practical example: Challenge-Response
Identification Mechanism
Setup : Agree on a secret key Ki
and one-way function F
Prover A Verifier
Ki Ki Rv
Rt
Who are you? : proof by using Rv that you know Ki Generate random value R
v
Auth request (Challenge)
RES=F(Rt, Ki, Rv)