Applications of Polynomial System Solving in Cryptology
From SIAG-AG
(Difference between revisions)
Revision as of 21:42, 13 November 2014
The security of many cryptosystems is strongly related to the hardness of solving polynomial systems over finite fields. These systems often have specific algebraic properties, which may be leveraged by specialized methods. The goal of this minisymposium is to bring together experts in cryptology and in computational algebraic geometry to discuss the interaction of recent developments in polynomial system solving and related problems arising in cryptology.
