Geodesic
Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial
Diskretnaya Matematika, Tome 26 (2014) no. 1, pp. 21-31 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DM_2014_26_1_a2,
     author = {A. V. Bukhman},
     title = {Properties of polynomials of periodic functions and the complexity of periodicity detection by the {Boolean} function polynomial},
     journal = {Diskretnaya Matematika},
     pages = {21--31},
     year = {2014},
     volume = {26},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2014_26_1_a2/}
}
TY  - JOUR
AU  - A. V. Bukhman
TI  - Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial
JO  - Diskretnaya Matematika
PY  - 2014
SP  - 21
EP  - 31
VL  - 26
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DM_2014_26_1_a2/
LA  - ru
ID  - DM_2014_26_1_a2
ER  - 
%0 Journal Article
%A A. V. Bukhman
%T Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial
%J Diskretnaya Matematika
%D 2014
%P 21-31
%V 26
%N 1
%U http://geodesic.mathdoc.fr/item/DM_2014_26_1_a2/
%G ru
%F DM_2014_26_1_a2
A. V. Bukhman. Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial. Diskretnaya Matematika, Tome 26 (2014) no. 1, pp. 21-31. http://geodesic.mathdoc.fr/item/DM_2014_26_1_a2/

[1] Selezneva S. N., “O slozhnosti raspoznavaniya polnoty mnozhestva bulevykh funktsii, realizovannykh polinomami Zhegalkina”, Diskretnaya matematika, 9:4 (1997), 24–31 | DOI | MR | Zbl

[2] Gorshkov S. P., “O slozhnosti raspoznavaniya multiaffinnosti, biyunktivnosti, slaboi polozhitelnosti i slaboi otritsatelnosti bulevoi funktsii”, Obozr. prikl. i promyshl. matem. Ser. Diskr. matem., 4:2 (1997), 216–237

[3] Logachev O., Salnikov A., Smyshlyaev S., Yaschenko V., Bulevy funktsii v teorii kodirovaniya i kriptologii, 2-e izd., dopoln., MTsNMO, Moskva, 2012

[4] Leontev V. K., “O nekotorykh zadachakh, svyazannykh s bulevymi polinomami”, Zhurnal vychislitelnoi matematiki i matematicheskoi fiziki, 39:6 (1999), 1045–1054 | MR | Zbl

[5] Bard G., Algebraic Cryptanalysis, Springer, 2009 | MR

[6] Bettale L., Faugere J., Perret L., “Hybrid approach for solving multivariate systems over finite fields”, In Journal of Mathematical Cryptology, 3 (2009), 177–197 | MR | Zbl

[7] Wolf C., Thomae E., Small Linearization: Memory Friendly Solving of Non-Linear Equations over Finite Fields, IACR Cryptology ePrint Archive 2011/669, https://eprint.iacr.org/2011/669

[8] Akho A., Khopkoft Dzh., Ulman Dzh., Postroenie i analiz vychislitelnykh algoritmov, Mir, Moskva, 1979 | MR

[9] Kormen T., Leizerson Ch., Rivest R., Shtain K., Algoritmy: postroenie i analiz=Introduction to Algorithms, Vilyams, Moskva, 2005, 1296 pp.