Changmin Lee

Changmin Lee

École Normale Supérieure de Lyon

H-index: 11

Europe-France

About Changmin Lee

Changmin Lee, With an exceptional h-index of 11 and a recent h-index of 9 (since 2020), a distinguished researcher at École Normale Supérieure de Lyon, specializes in the field of Cryptography, Cryptanalysis.

His recent articles reflect a diverse array of research interests and contributions to the field:

Security Guidelines for Implementing Homomorphic Encryption

Reduce and Prange: Revisiting Prange's Information Set Decoding for LPN and RSD

Faster TFHE Bootstrapping with Block Binary Keys

Improved Multi-user Security Using the Squared-Ratio Method

A polynomial time algorithm for breaking NTRU encryption with multiple keys

Cryptanalysis of FRS obfuscation based on the CLT13 multilinear map

Finding small roots for bivariate polynomials over the ring of integers

Let's Meet Ternary Keys on Babai's Plane: A Hybrid of Lattice-reduction and Meet-LWE

Changmin Lee Information

University

Position

___

Citations(all)

805

Citations(since 2020)

366

Cited By

628

hIndex(all)

11

hIndex(since 2020)

9

i10Index(all)

12

i10Index(since 2020)

9

Email

University Profile Page

École Normale Supérieure de Lyon

Google Scholar

View Google Scholar Profile

Changmin Lee Skills & Research Interests

Cryptography

Cryptanalysis

Top articles of Changmin Lee

Title

Journal

Author(s)

Publication Date

Security Guidelines for Implementing Homomorphic Encryption

Cryptology ePrint Archive

Jean-Philippe Bossuat

Rosario Cammarota

Jung Hee Cheon

Ilaria Chillotti

Benjamin R Curtis

...

2024

Reduce and Prange: Revisiting Prange's Information Set Decoding for LPN and RSD

Cryptology ePrint Archive

Jiseung Kim

Changmin Lee

2024

Faster TFHE Bootstrapping with Block Binary Keys

Changmin Lee

Seonhong Min

Jinyeong Seo

Yongsoo Song

2023/7/10

Improved Multi-user Security Using the Squared-Ratio Method

Yu Long Chen

Wonseok Choi

Changmin Lee

2023/8/9

A polynomial time algorithm for breaking NTRU encryption with multiple keys

Designs, Codes and Cryptography

Jiseung Kim

Changmin Lee

2023/8

Cryptanalysis of FRS obfuscation based on the CLT13 multilinear map

IET Information Security

Jiseung Kim

Changmin Lee

2022/5

Finding small roots for bivariate polynomials over the ring of integers

Advances in Mathematics of Communications

Jiseung Kim

Changmin Lee

2022/2/28

Let's Meet Ternary Keys on Babai's Plane: A Hybrid of Lattice-reduction and Meet-LWE

Cryptology ePrint Archive

Minki Hhan

Jiseung Kim

Changmin Lee

Yongha Son

2022

Improved Lattice Reduction Algorithms on Lattices of Small Determinants

Available at SSRN 4004977

Jung Hee Cheon

Changmin Lee

2022

Extension of simultaneous Diophantine approximation algorithm for partial approximate common divisor variants

IET Information Security

Wonhee Cho

Jiseung Kim

Changmin Lee

2021/11

(In) security of concrete instantiation of Lin17’s functional encryption scheme from noisy multilinear maps

Designs, Codes and Cryptography

Wonhee Cho

Jiseung Kim

Changmin Lee

2021/5

Algorithms for CRT-variant of approximate greatest common divisor problem

Journal of Mathematical Cryptology

Jung Hee Cheon

Wonhee Cho

Minki Hhan

Jiseung Kim

Changmin Lee

2020/10/20

Lattice analysis on MiNTRU problem

Cryptology ePrint Archive

Changmin Lee

Alexandre Wallet

2020

See List of Professors in Changmin Lee University(École Normale Supérieure de Lyon)