- This event has passed.
Jiseung Kim (김지승), Hardness and concrete security in cryptography
June 9 Tuesday @ 4:30 PM - 5:30 PM KST
Computationally hard problems have been widely used to construct cryptographic primitives such as encryptions, digital signatures. For example, provably secure primitives are based on a reduction from the hardness problems. However, the concrete instantiation of primitives does not follow the results of hardness problems due to its efficiency. In this talk, we introduce cryptographic hardness problems widely used in cryptography and the gap between hardness results and concrete security of cryptographic primitives based on our recent works.