| 5 | 2012 | Deterministic labelling of graph vertices by walking agent | Grunsky I. S., Sapunov S. V. | 282 |
| 6 | 2013 | On the upper bound for the number of additional edges in minimal vertex extensions of colored circles | Bondarenko P. P. | 282 |
| 1 | 2009 | Graph recognition by moving agent | Tatarinov E. A., Grunsky I. S. | 281 |
| 4 | 2011 | Coding of finite integer lattice by means of mappings with a bounded distortion. | Evdokimov A. A. | 281 |
| 4 | 2011 | On approximation of permutations by imprimitive groups | Pogorelov B.A., Pudovkina M. A. | 281 |
| 4 | 2011 | On skeleton automata | Salii V. N. | 281 |
| 5 | 2012 | Robots in Space multiagent problem: information and cryptographic aspects | Bernstein A. Yu., Shilov N. V. | 281 |
| 6 | 2013 | About invertibility finite automata with finite delay | Katerinskiy D.A. | 281 |
| 6 | 2013 | Block ciphers based on two feedback shift registers | Koreneva A.M. | 281 |
| 6 | 2013 | The blackbox service for hosting capture the flag computer security competitions | Stefantsov D. A., Anisenya N.I, Torgaeva T. A. | 281 |
| 6 | 2013 | Optimization of Pollard's (p—1)-algorithm | Klimina A. S. | 281 |
| 3 | 2010 | About relationship between parameters of certain graphs | Roldugm P. V., Badeha I. A | 280 |
| 4 | 2011 | On the choice of slid pairs for the correlation cryptanalysis of KeeLoq | Lebedeva O. N. | 280 |
| 5 | 2012 | Properties of X, S-layers | Pudovkina M. A. | 280 |
| 5 | 2012 | Mitigation methods for illegal information timing flows on the socket program interface | Dolgikh A. N. | 280 |
| 8 | 2015 | Properties of p-ary bent functions that are at minimal distance from each other | Potapov V. N. | 280 |
| 1 | 2009 | The technology and the instrumental environment for creation of protected information processing systems | Stephantsov D. A . | 279 |
| 5 | 2012 | Graph reconstruction by automata team | Tatarinov E. A. | 279 |
| 6 | 2013 | On relations between the basic notions of differential cryptanalysis | Pestunov A. I. | 279 |
| 8 | 2015 | On the invertibility of vector boolean functions | Pankratova I. A. | 279 |
| 5 | 2012 | Similar images search for digital waterm ARK detection | Borisenko B.B. | 278 |
| 10 | 2017 | Self-programmable cellular automata for cryptography | Gamova A.N., Efremova A. A. | 278 |
| 4 | 2011 | Reliability analysis of graphical CAPTCHA-systems by the example of KCAPTCHA | Matorin A. A., Abrosimov M.B. | 277 |
| 4 | 2011 | On minimal edge 1-extensions of two special form trees | Abrosimov M. B, Komarov D. D. | 277 |
| 6 | 2013 | On T-irreducible extensions of starlike trees | Osipov D. U. | 277 |
| 4 | 2011 | Design and implementation of the orm library in С + + | Tkachenko N. O, Shmakova R. V., Stephantsov D.A., Chernov D. V. | 276 |
| 5 | 2012 | On the number of minimal vertex and edge 1-extensions of cycles | Kuznetsov N. A., Abrosimov M.B. | 276 |
| 8 | 2015 | OPERATIONAL SEMANTICS FOR LYaPAS | Stefantsov D. A., Zhukovskaja A. O. | 276 |
| 4 | 2011 | FPT-algorithms and their classification on the base of elasticity | Bykova V. V. | 275 |
| 5 | 2012 | On minimal extensions of special type black-white paths | Bondarenko P. P. | 275 |
| 1 | 2009 | Properties of bent functions with minimal distance | Levin A. A., Pavlov A. V., Kolomeec N.A. | 274 |
| 1 | 2009 | О четверичных и двоичных бент-функциях | , Sole Patrick, , Tokareva Natalia | 274 |
| 1 | 2009 | Computational complexity of graph extensions | Abrosimov M. B. | 274 |
| 5 | 2012 | Using volunteer computation to solve cryptographic problems | Posypkin M. A., Zaikin O.S., Semenov A. A. | 274 |
| 6 | 2013 | Statistical independence of general superposition of boolean functions | Mironenko O. L. | 274 |
| 6 | 2013 | On the effective representation of disjunctive normal forms by diagrams of a special kind | Semenov A. A. | 274 |
| 8 | 2015 | The development of an operating system in LYaPAS | Tomskih P. A., Stefantsov D.A. | 274 |
| 3 | 2010 | Authentication in multi-tier system using commutative encryption | Pautov P. A. | 273 |
| 4 | 2011 | Analysis of the GOST 28147-89 modes of operation that provide confidentiality | Kukalo I. A. | 273 |
| 5 | 2012 | Truncated differential characteristics with minimum number of active bytes for simplified Whirlpool | Kamaeva A. A. | 273 |
| 5 | 2012 | Optimal linear approximations for Feistel networks. Estimation for the resistance of the cipher SMS4 to linear cryptanalysis | Shushuev G. I. | 273 |
| 5 | 2012 | About convergence of a hybrid SAT+ROBDD-derivation | Semenov A. A., Ignatiev A. S. | 273 |
| 7 | 2014 | Experimental comparison of simulated annealing and balas algorithms for solving linear inequalities | Anashkina N. V., Shurupov A. N. | 273 |
| 4 | 2011 | An algorithm of computing D-gap numbers and D-weierstrass points. | Alekseenko E.S. | 272 |
| 4 | 2011 | Classification of anf graphs for quadratic bent functions in 6 variables | Korsakova E. P. | 272 |
| 4 | 2011 | Restrictions on girths in compact graphs | Melent'ev V.A. | 272 |
| 5 | 2012 | Boolean function absolute nonlinearity calculation on GPU | Medvedev A. V. | 272 |
| 6 | 2013 | On the representation of s-boxes in block ciphers | Vitkup V.A. | 272 |
| 8 | 2015 | NSUCRYPTO - a student's olympiad in cryptography: an idea, realization and results | Tokareva N. N. | 272 |
| 3 | 2010 | A hardware implementation of the cryptosystem based on the zakrevskij FSM | Miloshenko A. V. | 271 |
