-
Chapter and Conference Paper
Post-quantum Sigma Protocols and Signatures from Low-Rank Matrix Completions
We introduce a new hard problem to cryptography, named Low-Rank Matrix Completion (LRMC), whose hardness is equivalence with MinRank in multivariate cryptography (NP-Complete and quantum-resistant). We present...
-
Article
Quantum protocols for secure multi-party summation
Quantum secure multi-party summation is a kind of privacy-preserving summation whereby multiple mutually distrustful parties can securely compute the summation of their secret data, which can be utilized to ex...
-
Chapter and Conference Paper
Cryptanalysis of an ElGamal-Like Cryptosystem Based on Matrices Over Group Rings
ElGamal cryptography is one of the most important Public Key Cryptography (PKC) since Diffie-Hellman exchanges was proposed, however these PKCs which are based on the hard problems that discrete logarithm prob...
-
Article
Cryptanalysis of a lattice based key exchange protocol
2014年, WANG等人提出了一个基于格的密钥交换协议。原方案研究中首先在小整数解问题(SIS)基础上他们提出了两个新的困难问题, 并基于新困难问题设计了格密钥交换协议。本文提出了一个可以在多项式时间内恢复共享密钥的高效攻击算法, 并通过理论分析和实验验证严格论证攻击算法的**确性与高效性。由于最小整数解问题在格密码设计中有很广泛的研究, 因此该方法的研究可以进行进一步推广。
-
Article
Cryptanalysis of an MOR cryptosystem based on a finite associative algebra
The Shor algorithm is effective for public-key cryptosystems based on an abelian group. At CRYPTO 2001, Paeng (2001) presented a MOR cryptosystem using a non-abelian group, which can be considered as a candida...
-
Article
Cryptanalysis of an asymmetric cipher protocol using a matrix decomposition problem
Advances in quantum computation threaten to break public key cryptosystems such as RSA, ECC, and ElGamal that are based on the difficulty of factorization or taking a discrete logarithm, although up to now, no...
-
Article
A public key cryptosystem based on data complexity under quantum environment
Since the Shor algorithm showed that a quantum algorithm can efficiently calculate discrete logarithms and factorize integers, it has been used to break the RSA, EIGamal, and ECC classical public key cryptosys...
-
Article
Polynomial-time quantum algorithms for finding the linear structures of Boolean function
In this paper, we present quantum algorithms to solve the linear structures of Boolean functions. “Suppose Boolean function \(f\) ...
-
Article
Quantum algorithm to find invariant linear structure of MD hash functions
In this paper, we consider a special problem. “Given a function \(f\) f ...
-
Article
Extended multivariate public key cryptosystems with secure encryption function
Advances in quantum computers pose great threats on the currently used public key cryptographic algorithms such as RSA and ECC. As a promising candidate secure against attackers equipped with quantum computati...
-
Article
A fast pseudorandom number generator with BLAKE hash function
This paper presents a fast pseudorandom generation algorithm, which is based on the BLAKE hash function and can pass the random test of the NIST (National Institute of Standards and Technology) Statistical Tes...
-
Article
Design theory and method of multivariate hash function
This paper proposes a novel hash algorithm whose security is based on the multivariate nonlinear polynomial equations of NP-hard problem over a finite field and combines with HAIFA iterative framework. Over th...
-
Article
A new perturbation algorithm and enhancing security of SFLASH signature scheme
This paper introduces the concept of noise factor and noise operation, and constructs a noise group. We present a new perturbation algorithm for enhancing security of multivariate public key cryptosystems (MPK...
