Pages that link to "Item:Q5282753"

The following pages link to Cryptanalysis of public key cryptosystems based on non-Abelian factorization problems (Q5282753):

Displaying 9 items.

• New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity (Q456074) (← links)
• Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\) (Q476354) (← links)
• Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\) (Q491089) (← links)
• Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\) (Q2036028) (← links)
• The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\) (Q2130051) (← links)
• Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\) (Q2476752) (← links)
• Linear complexity of generalized cyclotomic binary sequences of order \(2d\) and length \(2p^m\) (Q2819181) (← links)
• 一类新的周期为p3的GF(l)上广义割圆序列的线性复杂度 (Q3131921) (← links)
• A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity (Q4603600) (← links)