Skip to main content

5 Result(s)

within Chengdong Tao Remove this filter Cryptology Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Efficient Key Recovery for All HFE Signature Variants

    The HFE cryptosystem is one of the most popular multi- variate schemes. Especially in the area of digital signatures, the HFEv- variant offers short signatures and high performance. Recently, an instance of th...

    Chengdong Tao, Albrecht Petzoldt, **tai Ding in Advances in Cryptology – CRYPTO 2021 (2021)

  2. No Access

    Chapter and Conference Paper

    Cryptanalysis of a Public Key Cryptosystem Based on Diophantine Equations via Weighted LLL Reduction (Short Paper)

    Okumura proposed a candidate of post-quantum cryptosystem based on Diophantine equations of degree increasing type (DEC). Sizes of public keys in DEC are small, e.g., 1,200 bits for 128 bit security, and it is...

    **tai Ding, Momonari Kudo, Shinya Okumura… in Advances in Information and Computer Secur… (2016)

  3. Chapter and Conference Paper

    Design Principles for HFEv- Based Multivariate Signature Schemes

    The Hidden Field Equations (HFE) Cryptosystem as proposed by Patarin is one of the best known and most studied multivariate schemes. While the security of the basic scheme appeared to be very weak, the HFEv- v...

    Albrecht Petzoldt, Ming-Shing Chen, Bo-Yin Yang… in Advances in Cryptology -- ASIACRYPT 2015 (2015)

    Download PDF (445 KB) View Chapter

  4. No Access

    Chapter and Conference Paper

    Simple Matrix Scheme for Encryption

    There are several attempts to build asymmetric pubic key encryption schemes based on multivariate polynomials of degree two over a finite field. However, most of them are insecure. The common defect in many of...

    Chengdong Tao, Adama Diene, Shaohua Tang, **tai Ding in Post-Quantum Cryptography (2013)

  5. No Access

    Chapter and Conference Paper

    Embedded Surface Attack on Multivariate Public Key Cryptosystems from Diophantine Equations

    Let X = (x 1,..,x n ) and Y = (y 1,...,y m ) be a pair of corresponding plaintext and cipherte...

    **tai Ding, Ai Ren, Chengdong Tao in Information Security and Cryptology (2013)