EUVIMEDEUVIMED entdecken
Crossref

Split logarithm problem and a candidate for a post-quantum signature scheme

A.A. Moldovyan, N.A. Moldovyan

Computer Science Journal of Moldova · 2022

DOI: 10.56415/csjm.v30.14 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computer Science Journal of Moldova, 2022. Verfasst von A.A. Moldovyan und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A new form of the hidden discrete logarithm problem, called split logarithm problem, is introduced as primitive of practical post-quantum digital signature schemes, which is characterized in using two non-permutable elements $A$ and $B$ of a finite non-commutative associative algebra, which are used to compute generators $Q=AB$ and $G=BQ$ of two finite cyclic groups of prime order $q$. The public key is calculated as a triple of vectors $(Y,Z,T)$: $Y=Q^x$, $Z=G^w$, and $T=Q^aB^{-1}G^b$, where $x$, $w$, $a$, and $b$ are random integers. Security of the signature scheme is defined by the computational difficulty of finding the pair of integers $(x,w)$, although, using a quantum computer, one can easily find the ratio $x/w\bmod q$.

Zitieren

APA

Moldovyan, A., & Moldovyan, N. (2022). Split logarithm problem and a candidate for a post-quantum signature scheme. Computer Science Journal of Moldova. https://doi.org/10.56415/csjm.v30.14

Vancouver

Moldovyan A, Moldovyan N. Split logarithm problem and a candidate for a post-quantum signature scheme. Computer Science Journal of Moldova. 2022. doi:10.56415/csjm.v30.14

BibTeX
@article{Moldovyan2022,
  author = {Moldovyan, A.A. and Moldovyan, N.A.},
  title = {Split logarithm problem and a candidate for a post-quantum signature scheme},
  journal = {Computer Science Journal of Moldova},
  year = {2022},
  doi = {10.56415/csjm.v30.14}
}
Kostenlos starten →