Abstract:

It is very important to analyze the security of fast public key cryptosystem suitable for computing devices with limited resources. By applying lattice reduction algorithm, it is not more difficult than the integer factorization problem to break the fast public key cryptosystem based on matrix ring. That is, given an oracle of factoring integers, there exists a polynomial time algorithm which solves the secret key from the public key. The correctness of security analysis is demonstrated by computational experiments.

Key words:  public key cryptosystem; integer factorization; cryptanalysis; lattice reduction