In modern information society, cryptography is one of the essential technologies supporting information security. In our laboratory, we are studying mathematical problems which assure the security of cryptography. In particular, we are studying the computational hardness of the elliptic curve discrete logarithm problem and the shortest vector problem, which support the security of elliptic curve cryptography and lattice-based cryptography, respectively. Moreover, we are also working on practical applications of homomorphic encryption, which is encryption supporting additions and multiplications on encrypted data (without decryption) for preserving confidentiality of data.
