cryptography based on the matrices
Clicks: 73
ID: 211889
2019
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Emerging Content
21.6
/100
73 views
14 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #40 of 57 articles by views in urban geography
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
In this work we introduce a new method of cryptography based on the matrices over a finite field $\mathbb{F}_{q}$, were $q$ is a power of a prime number $p$. The first time we construct the
matrix $M=\left(
\begin{array}{cc}
A_{1} & A_{2} \\
0 & A_{3} \\
\end{array}
\right)
$ were \ $A_{i}$ \ with $i \in \{1, 2, 3 \}$ is the matrix of
order $n$ \ in \ $\mathcal{M}(\mathbb{F}_{q})$ - the set of
matrices with coefficients in $\mathbb{F}_{q}$ - and $0$ is the zero matrix of order $n$. We prove that $M^{l}=\left(
\begin{array}{cc}
A_{1}^{l} & (A_{2})_{l} \\
0 & A_{3}^{l} \\
\end{array}
\right)
$ were $(A_{2})_{l}=\sum\limits_{k=0}^{l-1}
A_{1}^{l-1-k}A_{2}A_{3}^{k}$ for all $l\in \mathbb{N}^{\ast}$. After we will make a cryptographic scheme between the two traditional entities Alice and Bob.
| Reference Key |
zeriouh2019boletimcryptography
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;M. Zeriouh;A. Chillali;Abdelkarim Boua |
| Journal | urban geography |
| Year | 2019 |
| DOI |
10.5269/bspm.v37i3.34542
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.