CRYPTOGRAPHY LAB

홈 >
CRYPTOGRAPHY LAB

김연진 (Younjin Kim)

< 연구소개서>
My research interests are in Probabilistic Graph Theory and Combinatorics. An expander graph is a graph in which every subset S of vertices is connected to many vertices in the complementary set S^ of vertices. Expander graphs are sparse graphs that have many useful properties, such as low diameter, high connectivity, and a high chromatic number. Because of these properties, expander graphs are useful for constructing a hash function in Cryptography. I am interested in constructing a new hash function by using properties of expander graphs.

Position연구교수
엄수경 (Eom Soo Kyung)

<연구소개서>
A cryptogrphy is a "post-quantum cryptography" that, if a quantum computer capable of doing quantum computing can be used, the security of the password is inherently not easily deciphered.
Post-quantum cryptography for developing new cryptographic technologies for the environment after quantum computer development requires the development of new public keys.
Developing a public key is the key to mathematical research, including new challenges, public key cryptography, analysis, implementation, and quantum reduction algorithms. There are six categories of post-quantum cryptography
: lattice-based cryptography, multivariate cryptography, has-based cryptography, code-based cryptography,
supersingular elliptic curve isogeny cryptography and symmetric key-based cryptography.

I am focusing on "isogeny based cryptosystem development" based on the difficulty of calculating elliptic curves isogeny for the development of public key of post-quantum cryptosystem.

Position연구교수
조국화 (Cho Gook Hwa)

<연구소개서>
The study of algorithms for finding the square root or r-th root on a finite field is a very classic problem of computational number theory, which can affect elliptic curve cryptography with a lot of square root operations. We can use to find square root y in elliptic curve y^2=x^3+ax+b from fixed x. Elliptic curve cryptography is a cryptographic method that can be used on behalf of RSA where small key sizes are needed, especially since it has safety like RSA with 1024 bits modulus for small key sizes (160 bits).

PositionPost-Doc
구남훈 (Namhun Koo)

One of my research interest is security of cryptosystems based on multivariate quadratic equations, a candidate for Post-Quantum Crypotgraphy. Especially, I study about algebraic key recovery attack using good keys, the best known attack on Rainbow signature scheme which is a Round 2 candidate of NIST Post-Quantum Cryptography Standardization. Moreover, I study about variants of Rainbow signature scheme such that one can reduce the complexity of this algebraic key recovery attack.
Another one of my research interest is vectorial Boolean function which can be used in substitution box(S-box) of symmetric cryptosystem. In particular, I study about finding vectorial Boolean functions with low differential uniformity, low boomerang uniformity, low differential-linear uniformity, and high nonlinearity for a secure S-box.

PositionPost-Doc
조현수 (Hyunsoo Cho)

My research interest lies in the field of number theory and combinatorics, particularly in the theory of partition. In most of my previous work, I gave the bijection between the set of specified partitions and that of another combinatorial object. Especially, I classified the set of self-conjugate partitions into their hook length distribution.

Also, I'm interested in simultaneous core partitions. I constructed the lattice path interpretation of simultaneous core partitions whose cores line up with an arithmetic progression. Recently, I'm studying on simultaneous core partitions with specified restrictions.

PositionPost-Doc