Linear decomposition method in analyzing hidden information protocols on algebraic platforms

DOI10.1007/S10469-015-9327-8MaRDI QIDQ498303zbMATH OpenOpenAlexFDO

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

Recommendations

• Algebraic decomposition for probing security
• Linear algebraic methods in communication complexity
• Differential-linear cryptanalysis from an algebraic perspective
• Analysis of linear combination algorithms in cryptography
• A framework for cryptographic problems from linear algebra
• Linear algebra approach to secret sharing schemes
• An algebraic approach to symmetric linear layers in cryptographic primitives
• Revisiting the linear information flow algorithm
• Cryptanalysis of an algebraic privacy homomorphism
• Linear cryptanalysis using multiple linear approximations

Cites work

• scientific article; zbMATH DE number 5982274 (Why is no real title available?)
• scientific article; zbMATH DE number 1759777 (Why is no real title available?)
• scientific article; zbMATH DE number 2144676 (Why is no real title available?)
• scientific article; zbMATH DE number 7310214 (Why is no real title available?)
• A construction of algebraic cryptosystem over the quasigroup ring
• A new key exchange protocol based on the decomposition problem
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Aspects of nonabelian group based cryptography: a survey and open problems
• Combinatorial group theory and public key cryptography
• Computing with matrix groups over infinite fields.
• Diophantine cryptography over infinite groups
• Group ring cryptography
• Group-based cryptography
• Introduction to theoretical and numerical methods in cryptography
• New constructions of public-key encryption schemes from conjugacy search problems
• New directions in cryptography
• Polynomial-time theory of matrix groups
• Public key exchange using matrices over group rings
• Public key exchange using semidirect product of (semi)groups
• Quasigroups and rings in coding theory and cryptography
• The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
• The conjugacy search problem in public key cryptography: unnecessary and insufficient
• Using Decision Problems in Public Key Cryptography

Cited in

(2)

• A linear decomposition attack
• Cryptanalysis of a combinatorial public key cryptosystem

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

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