#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2012

2017

- This year (0)
- Last 5 years (9)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange
- IACR Cryptology ePrint Archive
- 2014

This paper introduces constant-time ARM Cortex-A8 ECDH software that (1) is faster than the fastest ECDH option in the latest version of OpenSSL but (2) achieves a security level above 2 using aâ€¦ (More)

- Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange, Peter Schwabe
- IACR Cryptology ePrint Archive
- 2014

This paper introduces high-security constant-time variable-base-point Diffieâ€“Hellman software using just 274593 Cortex-A8 cycles, 91460 Sandy Bridge cycles, 90896 Ivy Bridge cycles, or 72220 Haswellâ€¦ (More)

- Daniel J. Bernstein, Tung Chou, +4 authors Christine van Vredendaal
- IACR Cryptology ePrint Archive
- 2014

This paper analyzes the cost of breaking ECC under the following assumptions: (1) ECC is using a standardized elliptic curve that was actually chosen by an attacker; (2) the attacker is aware of aâ€¦ (More)

Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit special structures of the rings used in those cryptosystems. The same structures are also used in the leadingâ€¦ (More)

- Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange
- IACR Cryptology ePrint Archive
- 2017

This paper reduces the number of field multiplications required for scalar multiplication on conservative elliptic curves. For an average 256-bit integer n, this paperâ€™s multiply-by-n algorithm takesâ€¦ (More)

- Daniel J. Bernstein, Chitchanok Chuengsatiansup, David Kohel, Tanja Lange
- IACR Cryptology ePrint Archive
- 2015

This paper presents new speed records for arithmetic on a large family of elliptic curves with cofactor 3: specifically, 8.77M per bit for 256-bit variable-base single-scalar multiplication whenâ€¦ (More)

- Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange, Christine van Vredendaal
- IACR Cryptology ePrint Archive
- 2016

Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit special structures of the rings used in those cryptosystems. The same structures are also used in the leadingâ€¦ (More)

- Chitchanok Chuengsatiansup, Michael Naehrig, Pance Ribarski, Peter Schwabe
- Pairing
- 2013

This paper introduces PandA, a software framework for Pairings and Arithmetic. It is designed to bring together advances in the efficient computation of cryptographic pairings and the development andâ€¦ (More)

- Chitchanok Chuengsatiansup
- 2012 International Symposium on Informationâ€¦
- 2012

We have developed a new method for faster elliptic curve scalar multiplication represented in double-base chain format by cutting down redundancy using reordering sequences of field arithmeticâ€¦ (More)

- Daniel J. Bernstein, Tung Chou, +5 authors Christine van Vredendaal
- SSR
- 2015

This paper analyzes the cost of breaking ECC under the following assumptions: (1) ECC is using a standardized elliptic curve that was actually chosen by an attacker; (2) the attacker is aware of aâ€¦ (More)

- â€¹
- 1
- â€º