Public-key cryptosystem based on invariants of diagonalizable groups

DOI10.1515/gcc-2017-0003zbMath1359.94614arXiv1507.07848OpenAlexW2962937868MaRDI QIDQ524643

František Marko, Alexandr N. Zubkov, Martin Juráš

Publication date: 3 May 2017

Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.07848

zbMATH Keywords

invariantsnumber fieldsupergroupcryptosystemdiagonalizable group

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (1)

Minimal degrees of invariants of (super)groups – a connection to cryptology

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Castelnuovo-Mumford regularity of rings of polynomial invariants
• Fermat-Euler theorem in algebraic number fields
• Public-key cryptography and invariant theory
• On the Function Field Sieve and the Impact of Higher Splitting Probabilities
• Algebraic cryptography: new constructions and their security against provable break
• Structure computation and discrete logarithms in finite abelian $p$-groups
• Integer Programming
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• Polynomial Invariants of Finite Linear Groups of Degree Two
• The structure of the multiplicative group of residue classes modulo
• Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
• On some computational problems in finite abelian groups
• Polynomial invariants of finite groups. A survey of recent developments
• Minimal degrees of invariants of (super)groups – a connection to cryptology
• Graph isomorphism in quasipolynomial time [extended abstract]
• Algorithmic Number Theory

This page was built for publication: Public-key cryptosystem based on invariants of diagonalizable groups