In this paper, we study generalized cryptographic semi-regular sequences, which are expected to generic in the space of homogeneous polynomial sequences on which the coordinate rings have Krull dimension one. We provide an upper-bound on the complexity of the Gr\"{o}bner basis computation for such a sequence.

翻译：本文研究广义密码学半正则序列，该类序列预期在齐次多项式序列空间中具有一般性，且其坐标环的Krull维数为1。我们为此类序列的Gröbner基计算复杂度提供了一个上界。