Linear decomposition method in analyzing hidden information protocols on algebraic platforms

DOI10.1007/s10469-015-9327-8zbMath1358.94033OpenAlexW2113197148MaRDI QIDQ498303

Vitaliĭ Roman'kov

Publication date: 28 September 2015

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-015-9327-8

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Information theory (general) (94A15)

Related Items (1)

Cryptanalysis of a combinatorial public key cryptosystem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Group-based cryptography
• The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
• Combinatorial group theory and public key cryptography
• The conjugacy search problem in public key cryptography: unnecessary and insufficient
• Public key exchange using matrices over group rings
• Public Key Exchange Using Semidirect Product of (Semi)Groups
• Aspects of Nonabelian Group Based Cryptography: A Survey and Open Problems
• Group ring cryptography
• New Constructions of Public-Key Encryption Schemes from Conjugacy Search Problems
• Using Decision Problems in Public Key Cryptography
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Построение алгебраической криптосистемы над квазигрупповым кольцом
• Polynomial-time theory of matrix groups

This page was built for publication: Linear decomposition method in analyzing hidden information protocols on algebraic platforms