Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. Grigoriev (2002)
Public-key cryptography and invariant theoryJournal of Mathematical Sciences, 126
F. Marko, A. Zubkov (2016)
Minimal degrees of invariants of (super)groups – a connection to cryptologyLinear and Multilinear Algebra, 65
M. Laššák, S. Porubský (1996)
Fermat–Euler Theorem in Algebraic Number FieldsJournal of Number Theory, 60
B. McDonald (1974)
Finite Rings With Identity
(2013)
Discrete logarithms in GF(26120)
J. Buchmann, M. Jacobson, Edlyn Teske (1997)
On some computational problems in finite abelian groupsMath. Comput., 66
Don Redmond (2020)
Number TheoryAn Introduction to Probabilistic Number Theory
O. Vasilenko (2006)
Number-theoretic Algorithms in Cryptography (Translations of Mathematical Monographs)
M. Conforti, G. Cornuéjols, G. Zambelli (2014)
Integer Programming
W. Huffman (1980)
Polynomial Invariants of Finite Linear Groups of Degree TwoCanadian Journal of Mathematics, 32
W. Burnside
On Groups of Linear Substitutions of Finite Order which Possess Quadratic InvariantsProceedings of The London Mathematical Society
USA E-mail address: a.zubkov@yahoo.com Sobolev Institute of Mathematics
L. Babai (2015)
Graph isomorphism in quasipolynomial time [extended abstract]Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
H. Cohen (1993)
A course in computational algebraic number theory, 138
On computing logarithm over finite fields , Advances in cryptology - CRYPTO 85 (Santa Barbara, Calif., 1985)
E. Noether (1915)
Der Endlichkeitssatz der Invarianten endlicher GruppenMathematische Annalen, 77
E. Kaltofen, H. Rolletschek (1989)
Computing greatest common divisors and factorizations in quadratic number fieldsMathematics of Computation, 53
Larry Smith (1997)
Polynomial invariants of finite groups. A survey of recent developmentsBulletin of the American Mathematical Society, 34
M. Shub, S. Smale (1986)
Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: IISIAM J. Comput., 15
P. Symonds (2011)
On the Castelnuovo-Mumford regularity of rings of polynomial invariantsAnnals of Mathematics, 174
D. Grigoriev, Arist Kojevnikov, S. Nikolenko (2009)
Algebraic cryptography: New constructions and their security against provable breakSt Petersburg Mathematical Journal, 20
Box 2713, Doha, Qatar E-mail address: fxm13@psu
Andrew Sutherland (2008)
Structure computation and discrete logarithms in finite abelian p-groupsMath. Comput., 80
P. Gallagher (1979)
Invariants for finite groupsAdvances in Mathematics, 34
E-mail address: martinj@qu.edu.qa
V. Pan (1997)
Solving a Polynomial Equation: Some History and Recent ProgressSIAM Rev., 39
L. Fortnow, Steven Homer (2018)
Computational Complexity
Maximilian Albert, Annette Maier (1975)
Linear Algebraic Groups
M. Shub, S. Smale (1985)
Computational complexity: on the geometry of polynomials and a theory of cost. IAnnales Scientifiques De L Ecole Normale Superieure, 18
W. Waterhouse (1979)
Introduction to Affine Group Schemes
H. Kraft, H. Derksen (1997)
Constructive invariant theory
T. Elgamal (1984)
A public key cryptosystem and a signature scheme based on discrete logarithms
(1985)
On computing logarithm over finite fields
O. Vasilenko (2006)
Number-theoretic algorithms in cryptography
A. Masuoka, A. Zubkov (2015)
Solvability and nilpotency for algebraic supergroupsarXiv: Algebraic Geometry
Taher Gamal (1984)
A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Trans. Inf. Theory, 31
M. Hochster, Joel Roberts (1974)
Rings of invariants of reductive groups acting on regular rings are Cohen-MacaulayAdvances in Mathematics, 13
Saurabh Agarwal, G. Frandsen (2004)
Binary GCD Like Algorithms for Some Complex Quadratic Rings
N. Nakagoshi (1979)
The structure of the multiplicative group of residue classes moduloNagoya Mathematical Journal, 73
AbstractWe develop a public-key cryptosystem based on invariants of diagonalizable groups and investigate properties of such a cryptosystem first over finite fields, then over number fields and finally over finite rings.We consider the security of these cryptosystem and show that it is necessary to restrict the set of parameters of the system to prevent various attacks (including linear algebra attacks and attacks based on the Euclidean algorithm).
Groups Complexity Cryptology – de Gruyter
Published: May 1, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.