Javascript must be enabled to continue!
Public‐key coding system based on grey generation and braid group
View through CrossRef
PurposeThis paper attempts to construct a public‐key coding system using grey generation and braid group.Design/methodology/approachThe identification (ID) codes of both sides for communication are public for everyone and considered as public keys. Starting from the ID code of both sides of communication, the temporary secret key of communication can be obtained by the grey 1‐AGO algorithm first. Then the new formal common secret key can be obtained by using the element exchangeability of the braid group during the exchanging process of the temporary secret key between two sides of communication. The paper presents an exchange protocol of secret key based on grey data generation and braid group. It also constructs a cipher communication system by using Hash function based on the exchange protocol of secret key last.FindingsThe exchange protocol of secret key and the system of cipher communication which are proposed in this paper make use of the difficult problem of resolving disper se logarithm from generated code to ID code and the conjugate problem which is not ever resolved in braid group, which can ensure the security of the algorithm theoretically.Practical implicationsThe main steps of the exchange protocol and cipher communication system in this paper can be achieved through a computer program. They can be used in many communication processes on the internet.Originality/valueThe paper succeeds in realising both secret key generation and exchanging protocol of communication by using grey systems theory and braid group properties.
Title: Public‐key coding system based on grey generation and braid group
Description:
PurposeThis paper attempts to construct a public‐key coding system using grey generation and braid group.
Design/methodology/approachThe identification (ID) codes of both sides for communication are public for everyone and considered as public keys.
Starting from the ID code of both sides of communication, the temporary secret key of communication can be obtained by the grey 1‐AGO algorithm first.
Then the new formal common secret key can be obtained by using the element exchangeability of the braid group during the exchanging process of the temporary secret key between two sides of communication.
The paper presents an exchange protocol of secret key based on grey data generation and braid group.
It also constructs a cipher communication system by using Hash function based on the exchange protocol of secret key last.
FindingsThe exchange protocol of secret key and the system of cipher communication which are proposed in this paper make use of the difficult problem of resolving disper se logarithm from generated code to ID code and the conjugate problem which is not ever resolved in braid group, which can ensure the security of the algorithm theoretically.
Practical implicationsThe main steps of the exchange protocol and cipher communication system in this paper can be achieved through a computer program.
They can be used in many communication processes on the internet.
Originality/valueThe paper succeeds in realising both secret key generation and exchanging protocol of communication by using grey systems theory and braid group properties.
Related Results
Everyday Life in the "Tourist Zone"
Everyday Life in the "Tourist Zone"
This article makes a case for the everyday while on tour and argues that the ability to continue with everyday routines and social relationships, while at the same time moving thro...
Grey relations
Grey relations
PurposeThe goal of this article is to introduce the notion of a grey relation between grey sets using grey numbers.Design/methodology/approachThis study uses the grey number to cre...
Explanations about grey information and framework of grey system modeling
Explanations about grey information and framework of grey system modeling
Purpose
The purpose of this paper is to summarize the different types of grey information, explain the mechanism of grey system modeling and reconstruct the framework of grey syste...
Covered solution for a grey linear program based on a general formula for the inverse of a grey matrix
Covered solution for a grey linear program based on a general formula for the inverse of a grey matrix
Purpose
– This paper attempts to establish the general formula for computing the inverse of grey matrix, and the results are applied to solve grey linear programmin...
General grey numbers and their operations
General grey numbers and their operations
PurposeThe purpose of this paper is to advance new rules about operations of grey numbers.Design/methodology/approachThe paper first puts forward the definitions of basic element o...
General grey number decision-making model and its application based on intuitionistic grey number set
General grey number decision-making model and its application based on intuitionistic grey number set
PurposeThe purpose of this paper is to study the grey decision model and distance measuring method of general grey number.Design/methodology/approachFirst, intuitionistic grey numb...
Grey clustering and grey ranking of bank branches based on grey efficiency
Grey clustering and grey ranking of bank branches based on grey efficiency
PurposeCompetition in the banking sector is more complex than in the past, and survival has become more difficult than before. The purpose of this paper is to propose a grey method...
Młodociani sprawcy przestępstw przeciwko mieniu
Młodociani sprawcy przestępstw przeciwko mieniu
The new Polish penal legislation of 1969 introduced special rules of criminal liability of young adult offenders' aged 17-20. In 1972 criminological research was undertaken in orde...

