David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
In this paper we present some algorithms for computing an irreducible decomposition of an ideal in a polynomial ring R = K[x1,..., xn] where K is an arbitrary effective field. © 2005 Elsevier Ltd. All rights reserved.
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
T. Graham, A. Afzali, et al.
Microlithography 2000
Minghong Fang, Zifan Zhang, et al.
CCS 2024