Geodesic
On the Firmness Code Noising to the Statistical Analysis of the Observable Data of Repeated Repetition
Modelirovanie i analiz informacionnyh sistem, Tome 19 (2012) no. 4, pp. 110-127.

Voir la notice de l'article provenant de la source Math-Net.Ru

We investigate the firmness of code noising to the statistical analysis of the evesdropped messages of repeated repetition. We give a structural description of the model of secured data transmission and construct an information analytical model of the observer. The formula for computing amount of volume, necessary for distinguishing alternative hypothesis with given errors of first and second sorts by sample of codewords is obtained.
Keywords: random coding, code noising, factor code, data repetition, statistical analisys. 
@article{MAIS_2012_19_4_a9,
     author = {V. M. Deundyak and J. V. Kosolapov},
     title = {On the {Firmness} {Code} {Noising} to the {Statistical} {Analysis} of the {Observable} {Data} of {Repeated} {Repetition}},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {110--127},
     publisher = {mathdoc},
     volume = {19},
     number = {4},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2012_19_4_a9/}
}
TY  - JOUR
AU  - V. M. Deundyak
AU  - J. V. Kosolapov
TI  - On the Firmness Code Noising to the Statistical Analysis of the Observable Data of Repeated Repetition
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2012
SP  - 110
EP  - 127
VL  - 19
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2012_19_4_a9/
LA  - ru
ID  - MAIS_2012_19_4_a9
ER  - 
%0 Journal Article
%A V. M. Deundyak
%A J. V. Kosolapov
%T On the Firmness Code Noising to the Statistical Analysis of the Observable Data of Repeated Repetition
%J Modelirovanie i analiz informacionnyh sistem
%D 2012
%P 110-127
%V 19
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2012_19_4_a9/
%G ru
%F MAIS_2012_19_4_a9
V. M. Deundyak; J. V. Kosolapov. On the Firmness Code Noising to the Statistical Analysis of the Observable Data of Repeated Repetition. Modelirovanie i analiz informacionnyh sistem, Tome 19 (2012) no. 4, pp. 110-127. http://geodesic.mathdoc.fr/item/MAIS_2012_19_4_a9/

[1] B. Shnaier, Prikladnaya kriptografiya. Protokoly, algoritmy, iskhodnye teksty na yazyke Si, TRIUMF, M., 2002

[2] A. A. Moldovyan, N. A. Moldovyan, B. Ya. Sovetov, Kriptografiya, Lan, SPb., 2001

[3] V. A. Yakovlev, Zaschita informatsii na osnove kodovogo zashumleniya, ed. V. I. Korzhik, SPb., 1993

[4] A. D. Wyner, “The Wire-Tap Channel”, Bell Sys. Tech. J., 54 (1975), 1355–1387 | MR | Zbl

[5] H. Ozarov, A. D. Wyner, “Wire-Tap Channel, II”, BLTj, 63 (1984), 2135–2157

[6] V. K. Wei, “Generalized Hamming Weights for Linear Codes”, IEEE Transactions on information theory, 37:5 (1991), 1412–1418 | DOI | MR | Zbl

[7] Yu. V. Kosolapov, “O primenenii skhemy Ozarova–Vainera dlya zaschity informatsii v besprovodnykh mnogokanalnykh sistemakh peredachi dannykh”, Informatsionnoe protivodeistvie ugrozam terrorizma, 2007, no. 10, 112–120

[8] Yu. V. Kosolapov, “Otsenka urovnya ponimaniya informatsii v kanale s perekhvatom”, Matematika i ee prilozheniya: ZhIMO, 1(5) (2008), 11–20

[9] V. A. Ivanov, “Statisticheskie metody otsenki effektivnosti kodovogo zashumleniya”, Trudy po diskretnoi matematike, 6, Fizmatlit, M., 2002, 48–63

[10] V. M. Deundyak, Yu. V. Kosolapov, “Matematicheskaya model kanala s perekhvatom vtorogo tipa”, Izvestiya vysshikh uchebnykh zavedenii. Severo-Kavkazskii region. Seriya Estestvennye nauki, 2008, no. 3(145), 3–8 | MR | Zbl

[11] V. A. Ivanov, “O metode sluchainogo kodirovaniya”, Diskretnaya matematika, 11:3 (1999), 99–108 | DOI | MR | Zbl

[12] V. A. Ivanov, “Asimptoticheskie kharakteristiki kriteriev proverki gipotez po sluchaino preobrazovannoi vyborke”, Trudy po diskretnoi matematike, 5, Fizmatlit, M., 2002, 71–72

[13] T. Berson, “Failure of the McEliece public-key cryptosystem under message-resend and related-message Attack”, Advances in Cryptology CRYPTO'97 Proceedings, Springer-Verlag, 1997, 213–220 | DOI | Zbl

[14] E. Filiol, “A new statistical testing for symmetric ciphers and hash functions”, International Conference on Information Communications and Signal Processing, Lecture Notes in Computer Science, 2119, eds. V. Varadharajan, Y. Mu, Springer-Verlag, 2001, 21–35

[15] D. M. Chibisov, “Teorema o dopustimykh kriteriyakh i ee primeneniya k odnoi asimptoticheskoi zadache proverki gipotez”, Teoriya veroyatnostei i ee primeneniya, 12:1 (2002), 96–111

[16] D. M. Chibisov, “Lektsii po asimptoticheskoi teorii rangovykh kriteriev”, Lektsionnye kursy NOTs, 14, MIAN, M., 2009, 3–174 | DOI

[17] E. Leman, Proverka statisticheskikh gipotez, Nauka, M., 1964 | MR

[18] V. N. Sachkov, Kombinatornye metody diskretnoi matematiki, Nauka, M., 1977

[19] A. P. Alferov, A. Yu. Zubov, A. S. Kuzmin, A. V. Cheremushkin, Osnovy kriptografii, uchebnoe posobie, 2-e izd., Gelios ARV, M., 2002

[20] E. M. Gabidulin, V. A. Obernikhin, “Kody v F-metrike Vandermonda i ikh primenenie”, Problemy peredachi informatsii, 39:2 (2003), 3–14 | MR | Zbl

[21] G. Birkgof, T. K. Barti, Sovremennaya prikladnaya algebra, Lan, M., 2005