Multivariate Polynomial Cryptography and Number Theory Lab

AboutAbout the lab

Putting the difficulty of solving systems of equations to work in cryptography.

Associate Professor Yasuhiko Ikematsu researches the development of post-quantum cryptography, which is believed to be hard to break even with quantum computers.
The professor is particularly interested in multivariate polynomial cryptography, which is built on the difficulty of solving systems of multivariate quadratic equations.
This type of cryptography is considered a leading candidate for post-quantum cryptography.
However, its large public key size and the insufficient analysis using Gröbner bases remain challenges, and the lab aims to resolve them.

ResearchResearch themes

Within post-quantum cryptography, the lab is particularly interested in multivariate polynomial cryptography, which is based on the difficulty of solving systems of multivariate quadratic equations. It aims to resolve challenges such as the large public key size and the insufficient analysis using Gröbner bases.

*Illustrative image

Resolving the challenges of multivariate polynomial cryptography↗

Multivariate polynomial cryptography is a leading candidate for post-quantum cryptography, but it has problems such as a large public key size and insufficient analysis using Gröbner bases. The lab aims to resolve these problems.

VoicesStudent voices

Ratings and reviews reflect the experiences of individual current or former students, not the lab's official views. Whether a lab has reviews, or how many, says nothing about the lab itself.

Students who take part in an interview may receive a thank-you gift worth ¥1,000, regardless of what they say.