Complexity calculation of coding and information security system based on threshold secret sharing scheme used for electronic voting

Introduction . One of the tasks arising in cryptography is to ensure the safe and honest conduct of e-voting. This procedure provides that voters submit their votes electronically - for example, through electronic terminals. A new algorithm for the distribution of threshold sensitive data for electr...

Full description

Saved in:
Bibliographic Details
Main Authors: Larisa V. Cherkesova, Olga A. Safaryan, Alexander V. Mazurenko, Nadezhda S. Arkhangelskaya
Format: Article
Language:Russian
Published: Don State Technical University 2017-10-01
Series:Advanced Engineering Research
Subjects:
Online Access:https://www.vestnik-donstu.ru/jour/article/view/175
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849690524628287488
author Larisa V. Cherkesova
Olga A. Safaryan
Alexander V. Mazurenko
Nadezhda S. Arkhangelskaya
author_facet Larisa V. Cherkesova
Olga A. Safaryan
Alexander V. Mazurenko
Nadezhda S. Arkhangelskaya
author_sort Larisa V. Cherkesova
collection DOAJ
description Introduction . One of the tasks arising in cryptography is to ensure the safe and honest conduct of e-voting. This procedure provides that voters submit their votes electronically - for example, through electronic terminals. A new algorithm for the distribution of threshold sensitive data for electronic voting is proposed. Materials and Methods . The results are obtained on the basis of the following methodology: finite field theory, theory of algorithms, projective geometry, and linear algebra. The developed cryptosystem is based on the application of geometric objects from projective geometry which makes it possible to use the apparatus of linear algebra to make effective decisions on cryptographic problems. To estimate the complexity of the described algorithms, classical results from the theory of algorithms are applied. Research Results . This paper describes the cryptographic algorithms of secret sharing and its subsequent restoration based on special structural properties of projective spaces over finite fields, and their link with Galois fields of the appropriate order. The component parts of these algorithms, specifically, the construction of injective mapping from a residue ring prime modulo into the projective space over finite field of specific dimension; the generation of secret shares and secret; the procedure of secret sharing and its restoration, are described in great detail. The algorithmic time complexity calculations of the formal algorithms are given. Discussion and Conclusions . The described scheme is useful for electronic voting and in other spheres where methods of threshold cryptography are applied.
format Article
id doaj-art-aa66caba794a40959678e02a841de2b4
institution DOAJ
issn 2687-1653
language Russian
publishDate 2017-10-01
publisher Don State Technical University
record_format Article
series Advanced Engineering Research
spelling doaj-art-aa66caba794a40959678e02a841de2b42025-08-20T03:21:18ZrusDon State Technical UniversityAdvanced Engineering Research2687-16532017-10-0117314515510.23947/1992-5980-2017-17-3-145-155175Complexity calculation of coding and information security system based on threshold secret sharing scheme used for electronic votingLarisa V. Cherkesova0Olga A. Safaryan1Alexander V. Mazurenko2Nadezhda S. Arkhangelskaya3Don State Technical UniversityDon State Technical UniversityDon State Technical UniversityDon State Technical UniversityIntroduction . One of the tasks arising in cryptography is to ensure the safe and honest conduct of e-voting. This procedure provides that voters submit their votes electronically - for example, through electronic terminals. A new algorithm for the distribution of threshold sensitive data for electronic voting is proposed. Materials and Methods . The results are obtained on the basis of the following methodology: finite field theory, theory of algorithms, projective geometry, and linear algebra. The developed cryptosystem is based on the application of geometric objects from projective geometry which makes it possible to use the apparatus of linear algebra to make effective decisions on cryptographic problems. To estimate the complexity of the described algorithms, classical results from the theory of algorithms are applied. Research Results . This paper describes the cryptographic algorithms of secret sharing and its subsequent restoration based on special structural properties of projective spaces over finite fields, and their link with Galois fields of the appropriate order. The component parts of these algorithms, specifically, the construction of injective mapping from a residue ring prime modulo into the projective space over finite field of specific dimension; the generation of secret shares and secret; the procedure of secret sharing and its restoration, are described in great detail. The algorithmic time complexity calculations of the formal algorithms are given. Discussion and Conclusions . The described scheme is useful for electronic voting and in other spheres where methods of threshold cryptography are applied.https://www.vestnik-donstu.ru/jour/article/view/175криптографияэлектронное голосованиепороговая криптографияразделение секретакриптосистема эль-гамалякриптосистема с открытым ключомкриптографический секреткриптографический алгоритминформационная безопасностькриптографический ключcryptographyelectronic votingthreshold cryptographysecret sharingelgamal encryption systempublic-key cryptographycryptographic secretcryptographic algorithminformation securitycryptographic key
spellingShingle Larisa V. Cherkesova
Olga A. Safaryan
Alexander V. Mazurenko
Nadezhda S. Arkhangelskaya
Complexity calculation of coding and information security system based on threshold secret sharing scheme used for electronic voting
Advanced Engineering Research
криптография
электронное голосование
пороговая криптография
разделение секрета
криптосистема эль-гамаля
криптосистема с открытым ключом
криптографический секрет
криптографический алгоритм
информационная безопасность
криптографический ключ
cryptography
electronic voting
threshold cryptography
secret sharing
elgamal encryption system
public-key cryptography
cryptographic secret
cryptographic algorithm
information security
cryptographic key
title Complexity calculation of coding and information security system based on threshold secret sharing scheme used for electronic voting
title_full Complexity calculation of coding and information security system based on threshold secret sharing scheme used for electronic voting
title_fullStr Complexity calculation of coding and information security system based on threshold secret sharing scheme used for electronic voting
title_full_unstemmed Complexity calculation of coding and information security system based on threshold secret sharing scheme used for electronic voting
title_short Complexity calculation of coding and information security system based on threshold secret sharing scheme used for electronic voting
title_sort complexity calculation of coding and information security system based on threshold secret sharing scheme used for electronic voting
topic криптография
электронное голосование
пороговая криптография
разделение секрета
криптосистема эль-гамаля
криптосистема с открытым ключом
криптографический секрет
криптографический алгоритм
информационная безопасность
криптографический ключ
cryptography
electronic voting
threshold cryptography
secret sharing
elgamal encryption system
public-key cryptography
cryptographic secret
cryptographic algorithm
information security
cryptographic key
url https://www.vestnik-donstu.ru/jour/article/view/175
work_keys_str_mv AT larisavcherkesova complexitycalculationofcodingandinformationsecuritysystembasedonthresholdsecretsharingschemeusedforelectronicvoting
AT olgaasafaryan complexitycalculationofcodingandinformationsecuritysystembasedonthresholdsecretsharingschemeusedforelectronicvoting
AT alexandervmazurenko complexitycalculationofcodingandinformationsecuritysystembasedonthresholdsecretsharingschemeusedforelectronicvoting
AT nadezhdasarkhangelskaya complexitycalculationofcodingandinformationsecuritysystembasedonthresholdsecretsharingschemeusedforelectronicvoting