×

Utilisation des modules de Drinfeld en cryptologie. (Using Drinfeld modules in cryptology). (French) Zbl 1028.94022

Summary: We present a new and efficient public-key cryptosystem based on Drinfeld modules. The details will appear elsewhere.

MSC:

94A60 Cryptography
11G09 Drinfel’d modules; higher-dimensional motives, etc.
11T71 Algebraic coding theory; cryptography (number-theoretic aspects)

Software:

NTL
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Drinfeld, V. G., Elliptic modules, Math. USSR-Sb., 23, 561-592 (1976) · Zbl 0321.14014
[2] Drinfeld, V. G., Elliptic modules, Math. USSR-Sb., 31, 159-170 (1977) · Zbl 0386.20022
[3] R. Gillard, F. Leprévost, A. Panchishkin, X.-F. Roblot, A new public-key cryptosystem based on Drinfeld modules (2002), en préparation; R. Gillard, F. Leprévost, A. Panchishkin, X.-F. Roblot, A new public-key cryptosystem based on Drinfeld modules (2002), en préparation
[4] Panchishkin, A. A., Algorithmes rapides pour factorisation des nombres et des polynômes, tests de primalité, courbes elliptiques et modules de Drinfeld, Sém. Théorie des nombres (Caen), 1-10 (1993-1994)
[5] Scanlon, T., Public key cryptosystems based on Drinfeld modules are insecure, J. Cryptology, 14, 225-230 (2001) · Zbl 1004.94020
[6] IEEE Standards, Group P1363: Standard Specification for Public-Key Cryptography, 1999, http://grouper.ieee.org/groups/1363; IEEE Standards, Group P1363: Standard Specification for Public-Key Cryptography, 1999, http://grouper.ieee.org/groups/1363
[7] V. Shoup, NTL: A Library for doing Number Theory, 2002, http://shoup.net/ntl/; V. Shoup, NTL: A Library for doing Number Theory, 2002, http://shoup.net/ntl/
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.