We construct a public-key cryptosystem based on an NP- complete problem in algebraic geometry. It is a problem of finding sections on fibered algebraic surfaces; in other words, we use a solution to a system of multivariate equations of high degrees. Our cryptosystem is a revised version of the algebraic surface cryptosystem (ASC) we constructed earlier (cf. [AG04, AG06]). We revise its encryption algorithm to avoid known attacks. Further, we show that the key size of our cryp- tosystem is one of the shortest among those of post-quantum public-key cryptosystems known at present.© Inernational Association for Cryptologic Research 2009.
CITATION STYLE
Akiyama, K., Goto, Y., & Miyake, H. (2009). An algebraic surface cryptosystem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5443, pp. 425–442). Springer Verlag. https://doi.org/10.1007/978-3-642-00468-1_24
Mendeley helps you to discover research relevant for your work.