Full homomorphic encryption is a famous
conjecture put forward by three cryptographers more than 4 decades ago, which
is a world-class problem recognized by the mathematical community, and is the
core supporting theory and technology in the new generation of digital
technologies, such as cloud-secure computing and privacy computing. The team
constructed a privacy computing system that ensures security and promotes the
maximization of data value, which not only cracks this puzzle, but also has
great potential for application in the fields of digital signatures,
authentication systems, and e-medicine.
In 2009 cryptographer Gentry proposed a
fully homomorphic encryption system for the first time in the world using
Bootstrapping technique and ideal lattice. In 2022, Gentry won the highest
award in the field of theoretical computers, the Godel Award, for this work,
and gave a one-hour keynote speech at the World Congress of Mathematicians.
This is a strong indication that full homomorphic encryption is the world's
most mainstream academic topic today.
In 2023, the RUC team proposed fully
homomorphic encryption that does not rely on bootstrapping technology,
realizing the unboundedness of fully homomorphic encryption for the first time.
Once again, RUC scholars became pioneers in the academic vanguard,attracting the attention of global scholars. Today, China is fighting
tooth and nail to boost the development of basic academic disciplines, trying
to offer the wisdom of the ancient East to the rest of the world.
Until now, the team has published six
monographs on cryptography in English and Chinese. Mathematical Principles of
Post-Quantum Codes, among them, is the world's first theoretical monograph on
systematic mathematical proof of anti-quantum codes.
These eye-catching achievements are the result
of the team's decades-long efforts in the field of cryptography. To develop the
Boundless Full Homomorphic Encryption Technology, in addition to the
preparation time for the preliminary information and data, the team spent
nearly two years just to conceptualize the technical model. It was only after
hundreds of attempts that the team finally decided to take the Chinese
Remainder Theorem as the theoretical basis of the research. The inherent
advantages of the Chinese Remainder Theorem facilitate the construction of a
secure and random public key.
“In academic research, one should never seek quick results; rather, one should pay attention to accumulating knowledge and making full preparations before making advances,” said Zheng Zhiyong. Professor Zheng has been enthralled by math since childhood. For years, he rises before the dawn, the most productive period of the day for him, finding solutions to all sorts of math problems on paper. In instructing freshmen, he always refrains from imparting students with knowledge that is too old. Instead, he integrates the cutting-edge theory into his math instruction, helping students not only appreciate the charm of math but also explore the practical applications of the subject.