On the Question of the Resistance of Code-Based Cryptosystems to Matrix Density Reduction Attacks

Veselova V. A.; A. A. Ovchinnikov; A. M. Veresova

doi:10.1109/WECONF51603.2021.9470506

АБВ
АБВ
АБВ

Обычная версия сайта

Priority areas

by year

Subject

News

May 25, 2026

HSE Scientists Train Neural Network to 'Hear' Faults in Electric Motors

Researchers at the AI and Digital Science Institute of the HSE Faculty of Computer Science have developed a new method—the Signature-Guided Data Augmentation (SGDA) framework—that achieves 99% accuracy in motor fault detection and 86% accuracy in fault classification. The application of this approach can reduce industrial equipment repair costs, minimise downtime, and improve production safety. The study results have been published in Engineering Applications of Artificial Intelligence.

May 25, 2026

'The Humanities Serve as a Conscience'

Maria Mizernaia studies Soviet literature and the history of book publishing. In this interview for the HSE Young Scientists project, she discusses plans to publish a novel about besieged Leningrad, AI-provoked reflections on what it means to be human, and how novels can help satisfy our dopamine hunger.

May 25, 2026

Is It Possible to Predict a Citys Life Based on the Shape of Its Neighbourhoods?

Is it possible to predict, based on the configuration of streets and buildings, where a café will open or where traffic congestion will occur? Participants in the Spatial Analysis and Modelling of Urban Processes research and study group use open data and machine learning to identify universal patterns. Alexander Sheludkov and Eduard Somov discuss the purpose of comparing cities, the need for new forms of urban statistics, and how open data is transforming approaches to urban studies.

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Publications

?

On the Question of the Resistance of Code-Based Cryptosystems to Matrix Density Reduction Attacks

P. 1–4.

Veselova V. A., A. A. Ovchinnikov, A. M. Veresova

Methods for reducing the density of matrices are
discussed. These methods can be used to analyze the
cryptocomplexity of systems based on error-correcting codes.
Lowering the density of matrices can affect both the stability of
systems that use low-density codes as a private key, and the
stability of general systems in which decryption requires solving
the problem of decoding errors of a given multiplicity. The article
presents the results of experiments for the considered methods of
reducing the density.

Language: English

DOI

Keywords: asymmetric encryption matrix density reduction code-based cryptosystems attacks on code-based cryptosystems cryptocomplexity of code-based systems

In book

WAVE ELECTRONICS AND ITS APPLICATION IN INFORMATION AND TELECOMMUNICATION SYSTEMS. 2021. (WECONF 2021) St. Petersburg, Russia, 31 May - 4 June 2021

IEEE, 2021.

Об одной схеме гибридного шифрования

Nesterenko A., Пугачев А. В., Прикладная дискретная математика 2015 № 4 С. 56–71

A new hybrid encryption scheme based on ElGamal asymmetric encryption scheme with distributed secret keys is presented. The keys are used for defence against unauthorised intrusion of encrypted messages. The security of the scheme is based on elliptic curve discrete logarithm problem. The main feature of the scheme is the fact that plain message is ...

Added: March 14, 2016