Overview
![](/assets/images/picto-drapeau-france-3a76576a5d60a512053b4612ab58dae5.png)
Read this article from a comprehensive knowledge base, updated and supplemented with articles reviewed by scientific committees.
Read the articleAUTHOR
-
Guy CHASSÉ: Senior Lecturer in Mathematics - École des Mines de Nantes
INTRODUCTION
In the examples described in the "Mathematics" article, once the algorithm had been chosen, the two correspondents agreed on the key K, which they kept secret. The process was then symmetrical: each could send and receive messages confidentially. Such algorithms are said to be symmetrical or secret-key.
The 1970s saw the emergence of a new type of algorithm known as a public-key or asymmetric algorithm. In our formalism, these correspond to a situation where the data given by E K is not practically sufficient (in a sense yet to be precisely defined, but let's say using existing computational means) to find D K . In this case, the process is no longer symmetrical; the owner of E K is able to send messages to the owner of D K , who will be the only one able to read them. There is then no reason to keep the E K application secret; it is published as a public key. Anyone can send messages confidentially to the owner of D K , the latter application or what is needed to build it being called the secret key. In the rest of this text, we'll describe some examples that will help clarify the notion of a public-key algorithm.
The "Cryptography" article is the subject of two booklets:
AF 172 Mathematics
AF 173 Algorithms
The subjects are not independent of each other.
Readers will need to refer to the other booklet often enough.
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference
This article is included in
Mathematics
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Cryptography
References
- - La lecture de cet article suppose du lecteur une certaine familiarité avec les structures algébriques (en particulier finies, c'est-à-dire avec un nombre fini d'éléments) telles que groupes, anneaux, corps. Nous avons essayé de redonner l'essentiel de ce qui est nécessaire au début. Un traitement plus complet est à rechercher dans
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference