A novel symmetric cryptography algorithm for fast and secure encryption

Achuthshankar, Aswin; Achuthshankar, Aswathy

doi:10.1109/isco.2015.7282273

Cited by 13 publications

(5 citation statements)

References 23 publications

(10 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We'll use an example to illustrate how to determine C2's firstorder relation. Table 2 indicates that the numbers [1,6,10], [5,9], [4,8], [3,7], and [2] correspond to the first orbit, and that the letter y stands in for the class. The correct method here is to multiply by 6, although any other method would work as well.…”

Section: Permutation Progenitorsmentioning

confidence: 99%

See 1 more Smart Citation

Symmetric Generatic Generations and an Algorithm to Prove Relations

2023

Journal of Algebraic Statistics

View full text Add to dashboard Cite

When researching this thesis, we found that various progenitors, including 3 *56 :(2 3 :(3:7), Factoring m*: N by the First Order Relations in Permutation Progenitors, and Symmetric Generation, each exhibit homomorphic pictures. To generate the Cayley graph of the ratio 3:(2×S5) over D12, we manually do Double Coset Enumeration. When dealing with finitely presented groups, coset enumeration is the primary technique for addressing the word problem. This method has been around for quite some time, and it was really one of the earliest uses of electronic computers for purely mathematical purposes. The current programs' functionality is limited by the size of the coset table that can be stored in the computer's memory. In certain situations, a significant space savings may be realized by the enumeration of double cosets. There is a description of an algorithm followed by some implementation details. We also show some of the isomorphism types and original symmetric presentations of finite groups, and we explain them as homomorphic pictures of their progenitors.

show abstract

Section: Permutation Progenitorsmentioning

confidence: 99%

“…We have ti's of order 2, if memory serves. To generate a finite homomorphic image of order 1440, we factor G by the following relations: (y −1 * x −1 * t) 6 , (x −1 * y −1 * x * t) 4 , (x 2 * t) 8 , (x * t) 5 . The enumeration of double cosets starts with an estimate of how many such sets there are likely to be.…”

Section: Table 3: Powers Of Tmentioning

confidence: 99%

Symmetric Generatic Generations and an Algorithm to Prove Relations

2023

Journal of Algebraic Statistics

View full text Add to dashboard Cite

show abstract

“…To design cipher algorithms, different technologies, including mathematics, physics, biometric, biology, and social engineering, are used [ 21 , 22 ]. Also, concepts and basic sciences such as theory of numbers, Boolean functions [ 23 ], and random functions [ 24 , 25 ] are very essential. Depending of the application of cipher algorithms, various technical and nontechnical requirements should be considered for their design.…”

Section: Cybernetic Supermodelmentioning

confidence: 99%

Leveled Design of Cryptography Algorithms Using Cybernetic Methods for Using in Telemedicine Applications

Molk

Aref

Khorshid-Doust

2021

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

The technology world is developing fast with the developments made in the hardware and software areas. Considering that privacy and security of telemedicine applications are among the main necessities of this industry, as a result, there is a need to use lightweight and practical algorithms to be used in applications in the field of telemedicine, while security have the least negative impact. The distinct and contradicting components in the design and implementation of the cryptography algorithm, to achieve various objectives in medicine-based applications, have made it a complicated system. It is natural that, without identifying the components, indices, and properties of each system component, the hardware and software resources are lost and a proper algorithm cannot be designed. Accordingly, this paper presents a leveled model of cryptography algorithms using the cybernetic method. First, the main objectives and measures in the design of the cryptography algorithms are extracted using the measure reduction methods, and some of the excess and overlapping measures are eliminated. Then, three general classes of the cryptography algorithm design and implementation measures, applications of cryptography algorithms, and cryptography implementation techniques are extracted. Since the complexity of the cryptography algorithm design is relatively high, the cybernetic methodology is used to present a supermodel to make the cryptography algorithm design objective. Such design prevents examining unnecessary details and establishes a bidirectional relationship between the main design and implementation process and the support process. This relationship provides the support requirements of the main process by the support process at each step. Finally, the Q-analysis tools are used to analyse the proposed method, and the efficiency results are represented.

show abstract

“…• A key deviation is involved in the key expansion stage, in which, a constant is added for each sub-key to avoid the weak keys [21].…”

Section: Introductionmentioning

confidence: 99%

A Complexity-Reduced Block Encryption Algorithm Suitable for Internet of Things

et al. 2019

View full text Add to dashboard Cite

The Internet of Things (IoT) poses stringent requirements on service quality and security strength. A highly reliable encryption algorithm with low complexity is required to ensure information security. Therefore, this paper proposes a complexity-reduced secure and fast encryption routine (SAFER)-Fermat block encryption method that accounts for the confusion and diffusion principles. In particular, a novel diffusion layer that exploiting the Fermat number theory transform is proposed, while the confusion layer remains unchanged as the SAFER algorithm. We also propose two data record structures to accommodate the two layers and deal with the overflow issue. The proposed scheme only considers the integer operation, the inclusion of multipliers in our study is no longer necessary, thereby resulting in low complexity and lightweight encryption method. Therefore, the proposed encryption method is advantageous for power-limited IoT devices. The simulations demonstrate that the proposed encryption method maintains the security of the SAFER++ method but requires fewer computations.INDEX TERMS Internet of things, block encryption, Fermat number theory transform, computational Complexity.

show abstract

A novel symmetric cryptography algorithm for fast and secure encryption

Cited by 13 publications

References 23 publications

Symmetric Generatic Generations and an Algorithm to Prove Relations

Symmetric Generatic Generations and an Algorithm to Prove Relations

Leveled Design of Cryptography Algorithms Using Cybernetic Methods for Using in Telemedicine Applications

A Complexity-Reduced Block Encryption Algorithm Suitable for Internet of Things

Contact Info

Product

Resources

About