A generalization of Gr(?)bner bases over ring (Z/(pe)[x1,…,xn])[I is given, where Z is the ring of integers, p is a prime, e≥1, and I is an ideal of Z/(pe)[x1,…,xn]. By applying this generalization, an algorithm is...A generalization of Gr(?)bner bases over ring (Z/(pe)[x1,…,xn])[I is given, where Z is the ring of integers, p is a prime, e≥1, and I is an ideal of Z/(pe)[x1,…,xn]. By applying this generalization, an algorithm is presented, which can synthesize multisequence with an equal or unequal length over Z[(m). The computational complexity of this algorithm is O(N2).展开更多
基金Project supported by the State Key Laboratory of Information SecurityGraduate School of the Chinese Academy of Sciences
文摘A generalization of Gr(?)bner bases over ring (Z/(pe)[x1,…,xn])[I is given, where Z is the ring of integers, p is a prime, e≥1, and I is an ideal of Z/(pe)[x1,…,xn]. By applying this generalization, an algorithm is presented, which can synthesize multisequence with an equal or unequal length over Z[(m). The computational complexity of this algorithm is O(N2).
