Public-key cryptosystem based on invariants of diagonalizable groups

DOI10.1515/GCC-2017-0003MaRDI QIDQ524643zbMATH OpenOpenAlexFDO

Authors F. Marko, A. 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

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

Abstract: We develop a public key cryptosystem based on invariants of diagonalizable groups and investigate properties of such 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 Euclidean algorithm).

Recommendations

• Public-key cryptography and invariant theory
• A public-key cryptosystem based on the group rings
• New Public-Key Cryptosystem Using Divisor Class Groups
• Cryptosystems in automorphism groups of group rings of Abelian groups.
• A public key cryptosystem based on non-abelian finite groups

Cites work

• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3460471 (Why is no real title available?)
• scientific article; zbMATH DE number 3508744 (Why is no real title available?)
• scientific article; zbMATH DE number 3233758 (Why is no real title available?)
• 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>
• Algebraic cryptography: new constructions and their security against provable break
• Algorithmic Number Theory
• Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
• Fermat-Euler theorem in algebraic number fields
• Graph isomorphism in quasipolynomial time (extended abstract)
• Integer Programming
• Minimal degrees of invariants of (super)groups – a connection to cryptology
• Number-theoretic algorithms in cryptography. Transl. from the Russian by A. Martsinkovsky
• On some computational problems in finite abelian groups
• On the Castelnuovo-Mumford regularity of rings of polynomial invariants
• On the function field sieve and the impact of higher splitting probabilities. Application to discrete logarithms in \(\mathbb{F}_{2^{1971}}\) and \(\mathbb{F}_{2^{3164}}\)
• Polynomial Invariants of Finite Linear Groups of Degree Two
• Polynomial invariants of finite groups. A survey of recent developments
• Public-key cryptography and invariant theory
• Structure computation and discrete logarithms in finite abelian \(p\)-groups
• The structure of the multiplicative group of residue classes modulo

Cited in

(9)

• A public key cryptosystem based on the conformal iterative depth problem
• On the application of rings of integer algebraic numbers to the construction of public-key cryptoschemes
• Public-key cryptography and invariant theory
• A novel public-key encryption scheme based on Bass cyclic units in integral group rings
• Integer representations of classical Weyl groups
• New Public-Key Cryptosystem Using Divisor Class Groups
• A public-key cryptosystem based on the group rings
• Public key cryptosystems based on Drinfeld modules are insecure
• Minimal degrees of invariants of (super)groups – a connection to cryptology

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q524643)