52, Ewhayeodae-gil, Seodaemun-gu, Seoul 03760 Republic of Korea
Copyright ⓒ 2015 Ewha Womans University. All Right Reserved.
Researchers
홈>
CRYPTOGRAPHY LAB>
Researchers
Researchers
조국화
(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).