Multivariate Polynomial Cryptography and Number Theory Lab

AboutAbout the lab

Analyzing the security of cryptography with mathematics

Associate Professor Yasuhiko Ikematsu's lab studies the development of post-quantum cryptography, which is considered hard to break even with quantum computers.
It is particularly interested in multivariate polynomial cryptography, which is built on the hardness of solving systems of multivariate quadratic equations.
Although multivariate polynomial cryptography is considered a strong candidate, it faces challenges: its public keys are large, and analysis using Gröbner bases is insufficient. The lab aims to resolve these challenges.
The lab's website describes it as studying number theory and cryptography.

ResearchResearch themes

The lab studies the development of post-quantum cryptography, which is considered hard to break even with quantum computers. It aims to resolve the remaining challenges of multivariate polynomial cryptography, which is based on the difficulty of solving systems of multivariate quadratic equations.

*Illustrative image

Resolving Challenges in Multivariate Polynomial Cryptography↗

Multivariate polynomial cryptography is considered a strong candidate for post-quantum cryptography. The lab's research aims to resolve its large public key sizes and the insufficient analysis using Gröbner bases.

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.