位置：成果数据库 > 期刊 > 期刊详情页
An Efficient Method for Computing Comprehensive Gröbner Bases
  • ISSN号：0747-7171
  • 期刊名称：Journal of Symbolic Computation
  • 时间：0
  • 页码：-
  • 相关项目：多项式同构问题与多变量密码分类分析研究
作者： Deepak Kapura|Yao Sun|Dingkang Wang|
同期刊论文项目
多项式同构问题与多变量密码分类分析研究
期刊论文 17 会议论文 24
同项目期刊论文
On enumeration of polynomial equivalence classes
ON THE NONEXISTENCE of BENT FUNCTIONS
对Bivium流密码的变元猜测代数攻击
Fast algebraic attacks and decomposition of symmetric boolean functions
On designated-weight Boolean functions with highest algebraic immunity
Comments on A design of Boolean Functions Resistant to (Fast) Algebraic Cryptanalysis with Efficient
A Method for Counting the Number of Polynomial Equivalence Classes
An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field
Parametric equation solving and quantifier elimination in finite fields with the characteristic set
On enumeration of polynomial equivalence classes and their application to MPKC
Ergodic theory over F-2[T]
有限域中的循环矩阵在密码学方面的相关问题
Improving the Lower Bound on Linear Complexity of the Sequences Generated by Nonlinear Filtering
一种布尔多项式的高效计算机表示
具有良好密码学性质的布尔函数的级联构造
PARAMETRIC EQUATION SOLVING AND QUANTIFIER ELIMINATION IN FINITE FIELDS WITH THE CHARACTERISTIC SET METHOD