周彤 (Tung Chou)

I am currently a postdoctoral researcher (Sep. 2016--now) at the Cryptographic Implementations group at Technische Universiteit Eindhoven, the Netherlands.
My advisors are of Daniel J. Bernstein and Tanja Lange.

Before I was a PhD student (Sep. 2012--Aug. 2016) at the Cryptographic Implementations group at Technische Universiteit Eindhoven, the Netherlands.
Before I was a Research Assistant at Institute of Information Science, Academia Sinica, Taiwan, under supervision of 楊柏因 (Bo-Yin Yang).
Before I was a master student at the Department of Electrical Engineering of National Taiwan University, Taiwan, under supervision of 鄭振牟 (Chen-Mou Cheng).
Before I was a bachelor student at the Department of Computer Science and Information Engineering of National Taiwan University, Taiwan.

Contact info

Address: P.O. Box 513, MetaForum, 5600 MB Eindhoven, the Netherlands
Office: MetaForum 6.100
Phone (office): +31 40 247 4562
Email: blueprint at crypto.tw

Research projects

Code-based: QcBits Constant-time small-key code-based cryptography.
McBits Fast constant-time code-based cryptography.
Elliptic-curve: Sandy2x A Curve25519 implementation tailored for the Intel Sandy Bridge/Ivy Bridge microarchitectures.
fastOT An optmized OT protocol.
BADA55 (pronounced "bad-ass"): Manipulating curve standards.
Multivariate: mqchallenge Breaking MQ challenges.
libFES Fast Exhaustive Search for Polynomial Systems over F2.
Symmetric: Auth256 A MAC designed for low bit operation count.

Theses

Master thesis: 解佈於二元體之多項式方程組之快速窮舉法 (Fast Exhaustive Search for Polynomial Systems over F2), National Taiwan University, Taiwan, 2010. [pdf]

Preprints


Publications

QcBits: constant-time small-key code-based cryptography.
Tung Chou. CHES 2016. [pdf]

How to manipulate curve standards: a white paper for the black hat.
Daniel J. Bernstein, Tung Chou, Chitchanok Chuengsatiansup, Andreas Hülsing, Tanja Lange, Ruben Niederhagen, Christine van Vredendaal. SSR 2015. [pdf]

Sandy2x: new Curve25519 speed records.
Tung Chou. SAC 2015. [pdf].

The simplest protocol for oblivious transfer.
Tung Chou, Claudio Orlandi. Latincrypt 2015. [pdf]

Faster binary-field multiplication and faster binary-field MACs.
Daniel J. Bernstein, Tung Chou. SAC 2014. [pdf]

McBits: fast constant-time code-based cryptography.
Daniel J. Bernstein, Tung Chou, Peter Schwabe. CHES 2013. [pdf]

Fast exhaustive search for quadratic systems in F2 on FPGAs.
Charles Bouillaguet, Chen-Mou Cheng, Tung Chou, Ruben Niederhagen, Bo-Yin Yang. SAC 2013. [pdf]

Solving quadratic equations with XL on parallel architectures.
Chen-Mou Cheng, Tung Chou, Ruben Niederhagen, Bo-Yin Yang. CHES 2012. [pdf]

Efficient parallel evaluation of multivariate quadratic polynomials on GPUs.
Satoshi Tanaka, Tung Chou, Bo-Yin Yang, Chen-Mou Cheng, Kouichi Sakurai. WISA 2012. [pdf]

Fast exhaustive search for polynomial systems in F2.
Charles Bouillaguet, Hsieh-Chung Chen, Chen-Mou Cheng, Tung Chou, Ruben Niederhagen, Adi Shamir, Bo-Yin Yang. CHES 2010. [pdf]

Slides

QcBits: constant-time small-key code-based cryptography. [pdf]
Talk given in the hot-topic session of PQCrypto 2016 (Feb 26, 2016).

The Simplest Protocol for Oblivious Transfer. [pdf]
Talk given in Latincrypt 2015 (Aug 24, 2015).

Sandy2x: Fastest Curve25519 Implementation Ever. [pdf]
Talks given in ECC 2015 (Sep 28, 2015), SAC 2015 (Aug 13, 2015), a seminar at Aarhus University (Aug 5, 2015), NIST-ECC workshop (Jun 12, 2015).

Message Authentication Codes (MACs). [pdf]
Lectures given in Cryptology (Oct 8, 2015), Cryptography I (Oct 9, 2014) at TU/e.

Faster binary-field multiplication and faster binary-field MACs. [pdf]
Talks given in CWG (Sep 5, 2014), SAC 2014 (Aug 15, 2014), Summer School in Croatia (Jun 3, 2014), EiPsi Seminar (May 19, 2014), FSE 2014 (Mar 4, 2014).

McBits: Fast Constant-Time Code-Based Cryptography. [pdf]
Talks given in PQC Workshop (Dec 15, 2013), CWG (Jun 14, 2013), PQCrypto 2013 (Jun 7, 2013), Diamant Symposium (May 31, 2013), EiPsi Seminar (May 21, 2013), IIS, Acdemia Sinica (Apr 11, 2013).

An Implementation of SPELT(31, 4, 96, 96, (32, 16, 8)). [pdf]
Talk given in a lab meeting (Jan 5, 2012).

Fast Exhaustive Search for Polynomial Systems in F2. [pptx]
Slides for my master's thesis defense.


Conference organization

I was involved in the following events:

PKC 2016, March 6-9, 2016, Taipei, Taiwan [PC member].
PQCrypto 2011, Nov 6-Dec 2, 2011, Taipei, Taiwan [Organizer].