Learn More
We examine the security of several digital signature schemes based on algebraic block codes. It is shown that Xinmei's digital signature scheme cau be totally broken by a known plaintext attack with complexity O(k3), where t is the dimension of the code used in the scheme. Harn and Wang have proposed a modified version of Xinmei's scheme that prevents(More)
SMS4 is a 128-bit block cipher, which is used in the WAPI standard in China. This paper examines algebraic attacks on SMS4 over two different fields, that is, GF(2) and GF$(2^8),$ respectively. With regards to this, we first describe the SMS4 as systems of quadratic equations over the two different fields, and then estimate the computational complexities of(More)
Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. The MD6 hash function is developed by a team led by Professor Ronald L. Rivest in response to the call for proposals for a SHA-3 cryptographic hash algorithm by the National Institute of Standards and Technology. The hardware performance(More)
Inspired by the paper [10], using better differential characteristics in the biclique construction, we give another balanced biclique attack on full rounds PRINCE with the lower complexity in this paper. Our balanced biclique attack has 62.67 2 computational complexity and 32 2 data complexity. Furthermore, we first illustrate a star-based biclique attack(More)
This paper proposes a new public key signature scheme based on multivariate quadratic polynomials over a finite field with odd prime characteristic. This signature scheme has a very simple internal transformation, allowing for efficient signature generation and verification. The security of the scheme is analyzed in detail. The result indicates that the new(More)
  • 1