Multivariate cryptography and finite field algorithms are two interlocking research areas that underpin many modern cryptographic systems and computational methods. Multivariate cryptography relies on ...
Cyclic and constacyclic codes form a pivotal class of linear error‐correcting codes that are defined over finite fields. Their algebraic structure, characterised by ideals in polynomial quotient rings ...
Recently S. D. Cohen resolved a conjecture of Chowla and Zassenhaus (1968) in the affirmative by showing that, if f(x) and g(x) are integral polynomials of degree n ≥ 2 and p is a prime exceeding (n2 ...
SIAM Journal on Applied Mathematics, Vol. 42, No. 5 (Oct., 1982), pp. 941-955 (15 pages) Slepian, Landau and Pollak found that a certain finite convolution integral operator on the real line commutes ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback