鄭振牟 Chen-Mou (Doug) Cheng

國立台灣大學電機工程學系 助理教授
Assistant Professor, Department of Electrical Engineering, National Taiwan University

主要研究領域:

密碼暨嵌入式系統計算

Major Research Areas:

Cryptographic and embedded-system computing

研究領域摘要:


Research Summary:

My current research theme centers around efficient implementations of and architectural support for cryptographic and cryptanalysis algorithms on today's computing platforms ranging from low-resource embedded systems to high-performance, state-of-the-art multi-core/many-core computers.

For cryptographic algorithms, we work in the area of post-quantum cryptography and study those public-key cryptosystems that can resist the attacks of the emergent thousand-qubit quantum computers, which will instantly break today’s most public-key cryptosystems including RSA, DSA, and ECC.  Besides representing a future-proof investment, some of these post-quantum cryptosystems (such as multivariates) also enjoy the benefit of executing much faster than their traditional counterparts on the same hardware, making them ideal for applications in mobile and embedded systems.  With appropriate architectural support, it is possible to use multivariate public-key cryptography on computing platforms with the most stringent constraints such as passive RFID tags.

For cryptanalysis algorithms, we are currently investigating integer factorization on multi-core/many-core computers.  The security of many cryptographic algorithms such as RSA relies on the fact that integers with large prime factors are hard to factor.  The number-field sieve (NFS) is today’s champion integer factorization method, and the current recommendations for RSA key sizes of 2048 bits or larger are directly based on extrapolations of the speed of NFS.

Using integer factorization as the benchmarking vehicle, we set out to examine in depth several promising multi-core/many-core architectures, including NVIDIA’s CUDA parallel programming environment, IBM’s Cell Broadband Engine, and various emerging architectures like Intel’s Larrabee and the OpenCL industry standard.  We aim to explore key abstractions such as hierarchy of thread groups, on-die shared memories, and barrier synchronization.  We hope that we will gain insights as how these abstractions can help design a good programming technology for the multi-core/many-core processors by working out a few real example applications, e.g., pushing the speeds of integer factorization to a new level.

Photo of Chen-Mou Cheng

代表性著作 Selected Publication

  1. A. I.-T. Chen, M.-S. Chen, T.-R. Chen, C.-M. Cheng, J. Ding, E. L.-H. Kuo, F. Y.-S. Li, and B.-Y. Yang, “SSE implementation of multivariate PKCs on modern x86 CPUs,” in Proceedings of the 2009 Workshop on Cryptographic Hardware and Embedded Systems (CHES 2009), Lausanne, Switzerland, Sept. 2009
  2. C.-M. Cheng, “Computing scalar multiplication with many cores,” invited talk at the 13th Workshop on Elliptic Curve Cryptography (ECC 2009), Calgary, Canada, Aug. 2009
  3. D. J. Bernstein, T.-R. Chen, C.-M. Cheng, T. Lange, and B.-Y. Yang, “ECM on graphics cards,” in Proceedings of 28th Annual International Conference on Theory and Applications of Cryptographic Techniques (EUROCRYPT 2009), Cologne, Germany, Apr. 2009
  4. A. I.-T. Chen, C.-H. O. Chen, M.-S. Chen, C.-M. Cheng and B.-Y. Yang, “Practical-sized instances of multivariate PKCs: Rainbow, and $\ell$IC-derivatives,” in Proceedings of the Second International Workshop on Post-Quantum Cryptography (PQCrypto 2008), pp. 95-106, Cincinnati, OH, USA, Oct. 2008
  5. J. Ding, V. Dubois, B.-Y. Yang, C.-H. O. Chen, and C.-M. Cheng, “Can SFLASH be saved?,” in Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008), pp. 691-701, Reykjavik, Iceland, Jun. 2008