Public-key cryptography and invariant theory
Zapiski Nauchnykh Seminarov POMI, Computational complexity theory. Part VII, Tome 293 (2002), pp. 26-38
Voir la notice de l'article provenant de la source Math-Net.Ru
Public-key cryptosystems are suggested based on invariants of groups. We give also an overview of known cryptosystems which involve groups.
@article{ZNSL_2002_293_a1,
author = {D. Yu. Grigor'ev},
title = {Public-key cryptography and invariant theory},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {26--38},
publisher = {mathdoc},
volume = {293},
year = {2002},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_2002_293_a1/}
}
D. Yu. Grigor'ev. Public-key cryptography and invariant theory. Zapiski Nauchnykh Seminarov POMI, Computational complexity theory. Part VII, Tome 293 (2002), pp. 26-38. http://geodesic.mathdoc.fr/item/ZNSL_2002_293_a1/