Professional Documents
Culture Documents
Security of Information Systems: Implementation of Encryption
Security of Information Systems: Implementation of Encryption
Security of Information Systems: Implementation of Encryption
mederritali@yahoo.fr
Abstract: In this work we provide a panorama on the use of cryptography and digital signature to secure an
informat ion system, we start with a state of the art about cryptographic algorithms, and digital signature
algorith ms and we finish by some applicat ions.
Key words: Sy mmetric encryption, asymmetric encryption, dig ital signature, PKI, SSL.
IBM in Yo rktown Heights (already at work of Horst encrypted email while it is on holiday, it will be
Feistel), and there he learned that Martin Hellman, obliged to await its return to establish the key with
a professor at Stanford University in Palo Alto, him.
gave a lecture on the same subject. He immediately Whitfield Diffie had another idea, which he did not
took his car and crossed the continent to meet find appropriate mathemat ical solution: a system
Hellman [2]. which would use a key to encrypt and another to
Diffie and Hellman were looking for a way to agree decrypt. Thus, Mohammed propose to Ayoub an
on a shared secret without being circulated among encryption key, with wh ich it would encrypt the
the participants, in other words, a mathematical message, and Mohammed decrypt it with a
function such that participants can exchange different key, the decryption key (Figure 2). The
informat ion alone could deduce the secret. The encryption key only allows you to encrypt, even
desired characteristics of such a function are the Ayoub would be unable to decipher his own
relative ease of calculat ion in the forward d irection, message with this key, only Mohammed can with
and almost impossible to calculate the inverse his decryption key. As the encryption key only
function. Thus, if s is the secret to clear the works in one direction, it creates secrets but not to
encryption function F, c secret encrypted, the disclose, and may be public, appearing in a
decryption function D, it is necessary that c = F (s) directory or on a website.
is easy to calculate, but if D = (c) impossible to Anyone who wants to send an encrypted message to
calculate for any other participants. Mohammed can take and use.
C.2. Implementation of Diffie -Hellman It must only be sure that nobody can calculate the
The protocol for key exchange Diffie-Hellman is decryption key fro m the encryption key. And that
based on a function of the form, first with P & W mathematical intuition is decisive.
<P. If the idea of asymmetric encryption using public
This function is very easy to calculate, but the keys back to Diffie and Hellman, the realization of
knowledge of K does not imply easily X. Th is this idea came to Rivest, Shamir and Adleman.
function is public, and the values of W and P. They found a mathematical solution to the RSA
1. Ayoub chooses a number that will remain h is implementation.
secret, say A. A person wishing to communicate using this
2. Mohammed chooses a number that will remain method must do the following :
his secret, say B. 1. Take t wo primes p and q.
3. Ayoub and Mohammed want to exchange the 2. Calculate n = pq.
secret key, wh ich is actually, but they do not know 3. Calculate z = (p - 1) (q - 1). (This number is the
yet, since everyone knows that A or B, but not both. value of the function φ (n), called Euler function,
4. Ayoub applies to A the one-way function, α is the and we note that it gives the size of the
result: mu ltip licat ive group modulo n, ).
5. Mohammed applies to B-way function, β is the 4. Take a s mall integer e, odd and prime to z.
result: 5. Calculate the inverse of e (mod z), that is to say d
6. Ayoub sends α to Mohammed, and Mohammed such that ed = 1 mod z. The modular arith metic
sends β, as shown by, they may be known to the theorems assure us that, in our case, d exists and is
whole world without the secret of Ayoub and unique.
Mohammed is disclosed. 6. A pair P = (e, n) is a public key.
7. Ayoub received β and calculates (that 7. The triple S = (d, p, q ) is the private key.
is to say in passing by , but he does Ayoub wants to send a message to Mohammed. it
not know B): . gets the public key of Mohammed on her Web site
8. Mohammed received α and computes and proceeds through encryption of the message M
(that is to say in passing by , but he to obtain the encrypted C as follows:
does not know A): C = P (M) =
Mohammed and Ayoub get to the end of their To obtain the plaintext T, Mohammed decrypt with
respective calculations the same number that has the secret key as follows:
never been exposed to the sight of prying: the S T = S (C) =
key. In fact it is quite log ical:
S (C) =
III. THE ASYMMETRIC PUBLIC =
= mod n
KEY ENCRYPTION = M mod n
The method of Diffie and Hellman allows the The latter result, = M (mod n) arises because e and
exchange of keys, but it imposes a preliminary d are inverse modulo n, it is demonstrated through
dialogue between the actors. Sometimes it is not the Fermat's little theorem.
practical: if Ayoub wants to send to Mohammed an
TELECOM 2011 & 7è me JFMMA
VIII. REFERENCES
[1] Ewelle Ewelle Richard ,TPE : Connectivité et
sécurité des réseaux sans fils, Institut de la
francophonie pour l'info rmatique, rapport final,
Hanoï, Ju illet – 2009
[2] Laurent Bloch et Christophe Wolfhugel
,Sécurité info rmatique Principes et méthode,
éditions Eyrolles 2007.
[3] Cédric Llorens , Laurent Levier et Denis Valo is
,Tableau x de bord de la sécurité réseau, éditions
Eyro lles ,2éme éd ition 2006.
[4] CGI, Étude technique : Cryptographie à clé
publique et signature numérique Principes de
fonctionnement, Septemb re 2002 .
[5] Mohammed C Kocher, Timing Attacks on
Implementations of Diffie-Hellman, RSA, DSS, and
Other Systems, Advances in Cryptology -
CRYPTO’96,LectureNotes in Co mputer Sciences,