Novel Noncommutative Cryptography Scheme Using Extra Special Group
Noncommutative cryptography (NCC) is truly a fascinating area with great hope of advancing performance and security for high end applications. It provides a high level of safety measures. The basis of this group is established on the hidden subgroup or subfield problem (HSP). The major focus in this...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2017-01-01
|
Series: | Security and Communication Networks |
Online Access: | http://dx.doi.org/10.1155/2017/9036382 |
id |
doaj-73b0809886be40ae97c453d0573b677f |
---|---|
record_format |
Article |
spelling |
doaj-73b0809886be40ae97c453d0573b677f2020-11-24T20:40:32ZengHindawi-WileySecurity and Communication Networks1939-01141939-01222017-01-01201710.1155/2017/90363829036382Novel Noncommutative Cryptography Scheme Using Extra Special GroupGautam Kumar0Hemraj Saini1Department of Computer Science & Engineering, Jaypee University of Information Technology, Solan 173234, IndiaDepartment of Computer Science & Engineering, Jaypee University of Information Technology, Solan 173234, IndiaNoncommutative cryptography (NCC) is truly a fascinating area with great hope of advancing performance and security for high end applications. It provides a high level of safety measures. The basis of this group is established on the hidden subgroup or subfield problem (HSP). The major focus in this manuscript is to establish the cryptographic schemes on the extra special group (ESG). ESG is showing one of the most appropriate noncommutative platforms for the solution of an open problem. The working principle is based on the random polynomials chosen by the communicating parties to secure key exchange, encryption-decryption, and authentication schemes. This group supports Heisenberg, dihedral order, and quaternion group. Further, this is enhanced from the general group elements to equivalent ring elements, known by the monomials generations for the cryptographic schemes. In this regard, special or peculiar matrices show the potential advantages. The projected approach is exclusively based on the typical sparse matrices, and an analysis report is presented fulfilling the central cryptographic requirements. The order of this group is more challenging to assail like length based, automorphism, and brute-force attacks.http://dx.doi.org/10.1155/2017/9036382 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Gautam Kumar Hemraj Saini |
spellingShingle |
Gautam Kumar Hemraj Saini Novel Noncommutative Cryptography Scheme Using Extra Special Group Security and Communication Networks |
author_facet |
Gautam Kumar Hemraj Saini |
author_sort |
Gautam Kumar |
title |
Novel Noncommutative Cryptography Scheme Using Extra Special Group |
title_short |
Novel Noncommutative Cryptography Scheme Using Extra Special Group |
title_full |
Novel Noncommutative Cryptography Scheme Using Extra Special Group |
title_fullStr |
Novel Noncommutative Cryptography Scheme Using Extra Special Group |
title_full_unstemmed |
Novel Noncommutative Cryptography Scheme Using Extra Special Group |
title_sort |
novel noncommutative cryptography scheme using extra special group |
publisher |
Hindawi-Wiley |
series |
Security and Communication Networks |
issn |
1939-0114 1939-0122 |
publishDate |
2017-01-01 |
description |
Noncommutative cryptography (NCC) is truly a fascinating area with great hope of advancing performance and security for high end applications. It provides a high level of safety measures. The basis of this group is established on the hidden subgroup or subfield problem (HSP). The major focus in this manuscript is to establish the cryptographic schemes on the extra special group (ESG). ESG is showing one of the most appropriate noncommutative platforms for the solution of an open problem. The working principle is based on the random polynomials chosen by the communicating parties to secure key exchange, encryption-decryption, and authentication schemes. This group supports Heisenberg, dihedral order, and quaternion group. Further, this is enhanced from the general group elements to equivalent ring elements, known by the monomials generations for the cryptographic schemes. In this regard, special or peculiar matrices show the potential advantages. The projected approach is exclusively based on the typical sparse matrices, and an analysis report is presented fulfilling the central cryptographic requirements. The order of this group is more challenging to assail like length based, automorphism, and brute-force attacks. |
url |
http://dx.doi.org/10.1155/2017/9036382 |
work_keys_str_mv |
AT gautamkumar novelnoncommutativecryptographyschemeusingextraspecialgroup AT hemrajsaini novelnoncommutativecryptographyschemeusingextraspecialgroup |
_version_ |
1716826596034215936 |