Polynomials over primary residue rings with a small unique distance
Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 24-25
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
We consider polynomials over small residue rings. For polynomials with the unique distance equaled to twice the degree of the polynomial, we show how to use them for constructing cryptographic primitives.
[1] Kurakin V. L., Kuzmin A. S., Mikhalev A. V., Nechaev A. A., “Linear Recurring Sequences over Rings and Modules”, J. Math. Sci., 76:6 (1995), 2793–2915 | DOI | MR | Zbl
[2] Bylkov D. N., “Rasstoyanie edinstvennosti semeistva koordinatnykh posledovatelnostei, poluchennykh uslozhneniem lineinykh rekurrent nad koltsom Galua”, Prikladnaya diskretnaya matematika, 2008, no. 2, 5–7