Chitchanok Chuengsatiansup

Orcid: 0000-0002-0329-2681

According to our database1, Chitchanok Chuengsatiansup authored at least 31 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
TeeJam: Sub-Cache-Line Leakages Strike Back.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024

Evict+Spec+Time: Exploiting Out-of-Order Execution to Improve Cache-Timing Attacks.
IACR Cryptol. ePrint Arch., 2024

Testing side-channel security of cryptographic implementations against future microarchitectures.
CoRR, 2024

Elephants Do Not Forget: Differential Privacy with State Continuity for Privacy Budget.
CoRR, 2024

2023
Cache-Timing Attack Against HQC.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives.
Proc. ACM Program. Lang., 2023

Leaky McEliece: Secret Key Recovery From Highly Erroneous Side-Channel Information.
IACR Cryptol. ePrint Arch., 2023

BunnyHop: Exploiting the Instruction Prefetcher.
Proceedings of the 32nd USENIX Security Symposium, 2023

Ultimate SLH: Taking Speculative Load Hardening to the Next Level.
Proceedings of the 32nd USENIX Security Symposium, 2023

The Gates of Time: Improving Cache Attacks with Transient Execution.
Proceedings of the 32nd USENIX Security Symposium, 2023

CryptOpt: Automatic Optimization of Straightline Code.
Proceedings of the 45th IEEE/ACM International Conference on Software Engineering: ICSE 2023 Companion Proceedings, 2023

2022
Breaking and Fixing Speculative Load Hardening.
IACR Cryptol. ePrint Arch., 2022

Spectre Declassified: Reading from the Right Place at the Wrong Time.
IACR Cryptol. ePrint Arch., 2022

CryptOpt: Verified Compilation with Random Program Search for Cryptographic Primitives.
CoRR, 2022

Opportunities for genetic improvement of cryptographic code.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Side-Channeling the Kalyna Key Expansion.
Proceedings of the Topics in Cryptology - CT-RSA 2022, 2022

2021
RSA Key Recovery from Digit Equivalence Information.
IACR Cryptol. ePrint Arch., 2021

Row, Row, Row Your Boat: How to Not Find Weak Keys in Pilsung.
IACR Cryptol. ePrint Arch., 2021

Towards practical GGM-based PRF from (Module-)Learning-with-Rounding.
IACR Cryptol. ePrint Arch., 2021

2019
ModFalcon: compact signatures based on module NTRU lattices.
IACR Cryptol. ePrint Arch., 2019

2018
Pairing-Friendly Twisted Hessian Curves.
IACR Cryptol. ePrint Arch., 2018

2017
Double-base scalar multiplication revisited.
IACR Cryptol. ePrint Arch., 2017

NTRU Prime: Reducing Attack Surface at Low Cost.
Proceedings of the Selected Areas in Cryptography - SAC 2017, 2017

2016
NTRU Prime.
IACR Cryptol. ePrint Arch., 2016

2015
Twisted Hessian curves.
IACR Cryptol. ePrint Arch., 2015

How to Manipulate Curve Standards: A White Paper for the Black Hat http: //bada55.cr.yp.to.
Proceedings of the Security Standardisation Research - Second International Conference, 2015

2014
Kummer strikes back: new DH speed records.
IACR Cryptol. ePrint Arch., 2014

Curve41417: Karatsuba revisited.
IACR Cryptol. ePrint Arch., 2014

How to manipulate curve standards: a white paper for the black hat.
IACR Cryptol. ePrint Arch., 2014

2013
PandA: Pairings and Arithmetic.
Proceedings of the Pairing-Based Cryptography - Pairing 2013, 2013

2012
Faster elliptic curve arithmetic for double-base chain by reordering sequences of field operations.
Proceedings of the International Symposium on Information Theory and its Applications, 2012


  Loading...