DeepAI AI Chat
Log In Sign Up

Cryptographic analysis of the Modified Matrix Modular Cryptosystem

by   Vitaliĭ Roman'kov, et al.
Mail.Ru Group

We show that the Modified Matrix Modular Cryptosystem proposed by S.K. Rososhek is not secure against the attack based on the linear decomposition method. The security of the encryption scheme in the Rososhek's system is based on the mix of the conjugacy search problem and random "salt". We do not solve the conjugacy search problem and we are not looking for the exact meaning of the "salt". The transported secret message in the system is recovered without computation the secret parameters, that have been used for its encryption.


How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts

We study secure and undetectable communication in a world where governme...

Recovering short secret keys of RLCE in polynomial time

We present a key recovery attack against Y. Wang's Random Linear Code En...

Determining the Optimal Random-padding Size for Rabin Cryptosystems

Rabin encryption and a secure ownership transfer protocol based on the d...

Encryption based on Conference Matrix

In this article, an encryption scheme based on (-1, 1) conference matrix...

On the role of the Fibonacci matrix as key in modified ECC

In this paper, we have proposed a modified cryptographic scheme based on...

AMOUN: Asymmetric lightweight cryptographic scheme for wireless group communication

Multi-recipient cryptographic schemes provide secure communication, betw...

Image Steganography: Protection of Digital Properties against Eavesdropping

Steganography is the art of hiding the fact that communication is taking...