Ming-Shing Chen

Learn More
1 Dept. of Mathematical Sciences, University of Cincinnati, USA, ding@math.uc.edu 2 IIS, Academia Sinica, Taiwan, [byyang,owenhsin,mschen]@iis.sinica.edu.tw 3 Dept. of Elec. Eng., Nat'l Taiwan University, Taiwan, ccheng@cc.ee.ntu.edu.tw Abstract. A recently proposed class of multivariate Public-Key Cryptosystems, the Rainbow-Like Digital Signature Schemes,(More)
Multivariate Public Key Cryptosystems (MPKCs) are often touted as future-proofing against Quantum Computers. It also has been known for efficiency compared to “traditional” alternatives. However, this advantage seems to erode with the increase of arithmetic resources in modern CPUs and improved algorithms, especially with respect to Elliptic Curve(More)
We present a multivariate version of Hidden Field Equations (HFE) over a nite eld of odd characteristic, with an extra embedding modi er. Combining these known ideas makes our new MPKC (multivariate public key cryptosystem) more e cient and scalable than any other extant multivariate encryption scheme. Switching to odd characteristics in HFE-like schemes a(More)
We propose and analyze a multivariate encryption scheme that uses odd characteristic and an embedding in its construction. This system has a very simple core map F (X) = X, allowing for efficient decryption. We also discuss ways to make this decryption faster with specific parameter choices. We give heuristic arguments along with experimental data to show(More)
In this paper, we present an ASIC implementation of two post-quantum public-key cryptosystems (PKCs), NTRUEncrypt and TTS. It represents a first step toward securing machine-to-machine (M2M) systems using strong, hardwareassisted PKC. In contrast to the conventional wisdom that PKC is too “expensive” for M2M sensors, it actually can lower the total cost of(More)
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 HFEvvariant seems to be a good candidate for digital signature schemes on the basis of multivariate polynomials. However, the currently existing scheme of(More)
We present instances of MPKCs (multivariate public key cryptosystems) with design, given the best attacks we know, and implement them on commodity PC hardware. We also show that they can hold their own compared to traditional alternatives. In fact, they can be up to an order of magnitude faster.
1 Dept. of Mathematical Sciences, University of Cincinnati, USA, ding@math.uc.edu 2 IIS, Academia Sinica, Taiwan, [byyang,owenhsin,mschen]@iis.sinica.edu.tw 3 Dept. of Elec. Eng., Nat'l Taiwan University, Taiwan, ccheng@cc.ee.ntu.edu.tw Abstract. A recently proposed class of multivariate Public-Key Cryptosystems, the Rainbow-Like Digital Signature Schemes,(More)