SIGNLINE: Digital Signature Scheme Based on Linear Equations Cryptosystem

The paper explores a novel cryptosystem for digital signatures based on linear equations for logarithmic signatures. A logarithmic signature serves as a fundamental cryptographic primitive, characterized by properties such as nonlinearity, non-commutability, unidirectionality, and key-dependent factorability. The proposed cryptosystem ensures the secrecy of logarithmic signatures through its foundation in linear equations. Quantum security is achieved by eliminating any possible mapping between the input and output of the logarithmic signature, thereby rendering Grover's quantum attack ineffective. The public key sizes for the NIST security levels of 128, 192, and 256 bits are 1, 1.5, and 2 KB, respectively. The algorithm demonstrates scalability concerning computational costs, memory usage, and hardware limitations without compromising security. Its primary operation involves bitwise XOR over logarithmic arrays of 8, 16, 32, and 64 bits.

Authors

Institutions

Publication Details

Published
2024-11-04
DOI
https://doi.org/10.1109/iceccme62383.2024.10796704
Citations
1
Primary Topic
Chaos-based Image/Signal Encryption
Type
article
Field-Weighted Citation Impact
0.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

SIGNLINE: Digital Signature Scheme Based on Linear Equations Cryptosystem

Maksym Kolisnyk, Олександр Сєвєрінов, Oleksandr Volkov, Yevgen Kotukh et al.
1 citations
Chaos-based Image/Signal Encryption
0.25
article

SIGNLINE: Digital Signature Scheme Based on Linear Equations Cryptosystem

Maksym Kolisnyk, Олександр Сєвєрінов, Oleksandr Volkov, Yevgen Kotukh, Gennady Khalimov, Svitlana Khalimova
article en
1 citations

Abstract

The paper explores a novel cryptosystem for digital signatures based on linear equations for logarithmic signatures. A logarithmic signature serves as a fundamental cryptographic primitive, characterized by properties such as nonlinearity, non-commutability, unidirectionality, and key-dependent factorability. The proposed cryptosystem ensures the secrecy of logarithmic signatures through its foundation in linear equations. Quantum security is achieved by eliminating any possible mapping between the input and output of the logarithmic signature, thereby rendering Grover's quantum attack ineffective. The public key sizes for the NIST security levels of 128, 192, and 256 bits are 1, 1.5, and 2 KB, respectively. The algorithm demonstrates scalability concerning computational costs, memory usage, and hardware limitations without compromising security. Its primary operation involves bitwise XOR over logarithmic arrays of 8, 16, 32, and 64 bits.

Kharkiv National University of Radio Electronics (UA)
Openalex Percentile: Top 43%
Chaos-based Image/Signal Encryption
0.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.