Public-key cryptosystem based on invariants of diagonalizable groups

DOI10.1515/GCC-2017-0003zbMATH Open1359.94614arXiv1507.07848OpenAlexW2962937868MaRDI QIDQ524643FDOQ524643

F. Marko, A. N. Zubkov, Martin Juráš

Publication date: 3 May 2017

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

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).

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

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

zbMATH Keywords

invariantsnumber fieldsupergroupcryptosystemdiagonalizable group

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the Function Field Sieve and the Impact of Higher Splitting Probabilities
• Title not available (Why is that?)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial Invariants of Finite Linear Groups of Degree Two
• Polynomial invariants of finite groups. A survey of recent developments
• Number-theoretic algorithms in cryptography. Transl. from the Russian by A. Martsinkovsky
• On the Castelnuovo-Mumford regularity of rings of polynomial invariants
• Integer Programming
• Fermat-Euler theorem in algebraic number fields
• Public-key cryptography and invariant theory
• Algebraic cryptography: new constructions and their security against provable break
• Structure computation and discrete logarithms in finite abelian $p$-groups
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• 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
• Minimal degrees of invariants of (super)groups – a connection to cryptology
• Graph isomorphism in quasipolynomial time [extended abstract]
• Algorithmic Number Theory

Cited In (6)

• Public key cryptosystems based on Drinfeld modules are insecure
• Public-key cryptography and invariant theory
• New Public-Key Cryptosystem Using Divisor Class Groups
• Minimal degrees of invariants of (super)groups – a connection to cryptology
• A public-key cryptosystem based on the group rings
• On the application of rings of integer algebraic numbers to the construction of public-key cryptoschemes

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)