Computer Modeling and Intelligent Systems 2019
DOI: 10.32782/cmis/2353-32
|View full text |Cite
|
Sign up to set email alerts
|

Practical Implementation Effectiveness of the Speed Increasing Method of Group Matrix Cryptographic Transformation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 1 publication
0
3
0
Order By: Relevance
“…The main constraints for a three-level centralized network, presented in conditions (12): each consumer in the network must be connected to one of the nodes or directly to the center; more than one consumer must be…”
Section: Research Resultsmentioning
confidence: 99%
“…The main constraints for a three-level centralized network, presented in conditions (12): each consumer in the network must be connected to one of the nodes or directly to the center; more than one consumer must be…”
Section: Research Resultsmentioning
confidence: 99%
“…The second way of developing "lightweight cryptography" is to build crypto-algorithms based on cryptographic coding operations [9,10]. Synthesized cryptographic coding operations based on discrete substitution table models implement both linear and nonlinear information transformations [11,12].…”
Section: Analysis Of Recent Research and Publicationsmentioning
confidence: 99%
“…Pseudorandom sequences (PRSs) [1][2] are widely used to solve a wide class of problems. In particular, they are used to protect information from unauthorized access [3][4][5], to control the integrity of information [6], to form signals that provide covert data transmission and implement the modeling of complex systems and objects [7][8][9], to form permutations for factorial coding of information [10][11][12].…”
Section: Introductionmentioning
confidence: 99%