DOI: 10.1007/978-3-540-93806-4_33
关键词: Ideal (set theory) 、 Coding theory 、 Polynomial 、 Cryptography 、 Computation 、 Algorithm 、 Polynomial ring 、 Field (mathematics) 、 Computer science
摘要: In applications to coding theory and cryptography, the characteristic of coefficient field is often small or 2. We will briefly review an algorithm computing radical a polynomial ideal specialized for characteristics.