Voir la notice de l'article provenant de la source Math-Net.Ru
@article{PDM_2011_4_a3, author = {A. U. Zubov}, title = {Almost perfect ciphers and authentication codes}, journal = {Prikladna\^a diskretna\^a matematika}, pages = {28--33}, publisher = {mathdoc}, number = {4}, year = {2011}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/PDM_2011_4_a3/} }
A. U. Zubov. Almost perfect ciphers and authentication codes. Prikladnaâ diskretnaâ matematika, no. 4 (2011), pp. 28-33. http://geodesic.mathdoc.fr/item/PDM_2011_4_a3/
[1] Alfërov A. P., Zubov A. Yu., Kuzmin A. S., Cherëmushkin A. V., Osnovy kriptografii, Gelios ARV, M., 2005, 480 pp.
[2] Zubov A. Yu., Kriptograficheskie metody zaschity informatsii. Sovershennye shifry, Gelios ARV, M., 2005, 192 pp.
[3] Kabatianskii G. A., Johansson T., Smeets B., “On the cardinality of systematic A-codes via error correcting codes”, IEEE Trans. Inform. Theory, IT-42:2 (1996), 566–578 | DOI | MR | Zbl
[4] Zubov A. Yu., Matematika kodov autentifikatsii, Gelios ARV, M., 2007, 480 pp.
[5] Zubov A. Yu., “Otsenka stoikosti koda autentifikatsii s dvumya sostoyaniyami istochnika pri sluchainom i ravnoveroyatnom vybore klyuchei”, Bezopasnost informatsionnykh tekhnologii, 2008, no. 2, 92–96
[6] Zubov A. Yu., “O vybore optimalnoi strategii zaschity dlya koda autentifikatsii s dvumya sostoyaniyami istochnika”, Diskretnaya matematika, 21:4 (2009), 135–147 | MR