Paper 2021/701

Multidimentional ModDiv public key exchange protocol

Samir Bouftass

Abstract

This paper presents Multidimentional ModDiv public key exchange protocol which security is based on the hardness of an LWR problem instance consisting on finding a secret vector $\textbf{X}$ in $\mathbb{Z}_{q}^{n}$ knowing vectors $\textbf{A}$ and $\textbf{B}$ respectively in $\mathbb{Z}_{p}^{m}$ and $\mathbb{Z}_{p-q}^{m-n}$, where elements of vector $\textbf{B}$ are defined as follows : $ B(i)$ = ($\sum_{j=1}^{j=n} A(i+n-j) \times X(j)$) $ Mod(P)Div(Q)$. Mod is integer modulo, Div is integer division, P and Q are known positive integers which sizes in bits are respectively p and q which satisfy $ p > 2 \times q $. m and n satisfy $ m >2 \times n $ .

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
Diffie Hellman key exchange protocolPost Quantum cryptographyLattice based cryptographyClosest vector problemLearn with rounding problem.
Contact author(s)
crypticator @ gmail com
History
2021-07-21: last of 3 revisions
2021-05-28: received
See all versions
Short URL
https://ia.cr/2021/701
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2021/701,
      author = {Samir Bouftass},
      title = {Multidimentional ModDiv public key exchange protocol},
      howpublished = {Cryptology ePrint Archive, Paper 2021/701},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/701}},
      url = {https://eprint.iacr.org/2021/701}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.