On a class of strongly asymmetric PKA algorithms

2015 ◽  
Vol 9 (3) ◽  
Author(s):  
Luigi Accardi ◽  
Massimo Regoli
Keyword(s):  
Matrix Model ◽  
Key Agreement ◽  
Key Exchange ◽  
Public Key ◽  
Discrete Logarithms ◽  
Essential Ingredient ◽  
Cryptographic Algorithms ◽  
Exchange Algorithms ◽  
The Matrix

AbstractIn the papers [New features for public key exchange algorithms, in: 18-th International ICWG Meeting (Krakow 2011)], [Strongly asymmetric PKD cryptographic algorithms: An implementation using the matrix model, in: Proceedings ISEC Conference (Shizuoka 2011)] a new scheme to produce public key agreement (PKA) algorithms was proposed and some examples based on polynomials (toy models) were discussed. In the present paper we introduce a non-commutative realization of the above mentioned scheme and prove that non-commutativity can be an essential ingredient of security in the sense that, in the class of algorithms constructed, under some commutativity assumptions on the matrices involved, we can find a breaking strategy, but dropping these assumptions we can not, even if we assume, as we do in all the attacks discussed in the present paper, that discrete logarithms have zero cost.

scholarly journals Side-by-Side Analysis of Key Exchange Algorithms for Load Optimized Security in MQTT Protocol

2020 ◽  
Vol 8 (6) ◽  
pp. 3987-3991
Keyword(s):  
Information Technology ◽  
Internet Of Things ◽  
Research Work ◽  
Key Exchange ◽  
Security Risks ◽  
Computing Power ◽  
International Telecommunication ◽  
Global Standards ◽  
Cryptographic Algorithms ◽  
Exchange Algorithms

The Information Technology has evolved and we have reached at an era of Internet of Things (IoT). According to International Telecommunication Union’s Global Standards Initiative (GSI), it is the network of all kinds of ‘things’ embedded with electronics, sensors, actuators, software etc. Things connected in open Internet poses high security risks. Majority of these devices use Message Queuing Telemetry Transport (MQTT) protocol for exchanging information. Most of the devices with limited storage and computing power are connected using MQTT. Since the protocol doesn't provide any mechanism for encryption, the security aspect of the protocol is really weak. This paper describes the need for empowering security in MQTT. In this research work, we benchmark different cryptographic algorithms and propose the best possible algorithm to enable higher level of security in MQTT. This work further demonstrates how to use the proposed algorithm to enable lightweight key exchange mechanism among MQTT devices.

Unlinkable Affiliation-Hiding Authenticated Key Exchange

2011 ◽  
Vol 467-469 ◽  
pp. 640-644
Author(s):  
Yong Ding ◽  
Bin Li ◽  
Zheng Tao Jiang
Keyword(s):  
Key Agreement ◽  
Mutual Authentication ◽  
Security Analysis ◽  
Key Exchange ◽  
Public Key ◽  
Authenticated Key Exchange ◽  
Key Exchange Protocol ◽  
Authentication And Key Agreement ◽  
Other Information ◽  
Authenticated Key Exchange Protocol

Affiliation-hiding authenticated key exchange protocol, also called secret handshake, makes two parties from the same organization realize mutual authentication and key agreement via public key certificates without leaking the organization information to any others. Moreover, if the peer involved in the protocol is not from the same group, no any information of the affiliation can be known. In previous secret handshakes protocols, there is a problem which is linkability. That is to say, two activities of the same people can be associated by the attackers. It is not desirable for privacy because the association may deduce it’s affiliation with some other information. In this paper, an unlinkable affiliation-hiding authenticated key exchange protocol is brought out to conquer the linkability. Security analysis is given finally.

scholarly journals A New Class of Strongly Asymmetric PKA Algorithms: SAA-5

Cryptography ◽  
2019 ◽  
Vol 3 (1) ◽  
pp. 9
Author(s):  
Luigi Accardi ◽  
Satoshi Iriyama ◽  
Koki Jimbo ◽  
Massimo Regoli
Keyword(s):  
Computational Complexity ◽  
Key Agreement ◽  
Public Key ◽  
Discrete Logarithms ◽  
New Class ◽  
Diffie Hellman ◽  
Class B ◽  
Shared Key

A new class of public key agreement (PKA) algorithms called strongly-asymmetric algorithms (SAA) was introduced in a previous paper by some of the present authors. This class can be shown to include some of the best-known PKA algorithms, for example the Diffie–Hellman and several of its variants. In this paper, we construct a new version of the previous construction, called SAA-5, improving it in several points, as explained in the Introduction. In particular, the construction complexity is reduced, and at the same time, robustness is increased. Intuitively, the main difference between SAA-5 and the usual PKA consists of the fact that in the former class, B (Bob) has more than one public key and A (Alice) uses some of them to produce her public key and others to produce the secret shared key (SSK). This introduces an asymmetry between the sender of the message (B) and the receiver (A) and motivates the name for this class of algorithms. After describing the main steps of SAA-5, we discuss its breaking complexity assuming zero complexity of discrete logarithms and the computational complexity for both A and B to create SSK.

A Novel Public Encryption and Key Agreement Based on Permutation Rational Function

2010 ◽  
Vol 44-47 ◽  
pp. 4012-4017
Author(s):  
Peng Cheng Wei ◽  
Hai Xia Wu ◽  
Hua Qian Yang ◽  
Xi Shi
Keyword(s):  
Rational Function ◽  
Key Agreement ◽  
Rational Functions ◽  
Key Exchange ◽  
Public Key ◽  
Public Key Cryptosystem

The important properties of permutation ration function are surveyed. Subsequently investigate a new permutation rational functions including the aspect of important algebraic, arithmetic and properties. Finally, application of permutation rational function to public-key cryptosystem and key exchange scheme will also be considered.

scholarly journals New Subclass Framework and Concrete Examples of Strongly Asymmetric Public Key Agreement

2021 ◽  
Vol 11 (12) ◽  
pp. 5540
Author(s):  
Satoshi Iriyama ◽  
Koki Jimbo ◽  
Massimo Regoli
Keyword(s):  
Computational Efficiency ◽  
Key Agreement ◽  
Necessary Conditions ◽  
Key Exchange ◽  
Public Key ◽  
High Security ◽  
Public Keys ◽  
Inclusion Relations ◽  
Shared Key

Strongly asymmetric public key agreement (SAPKA) is a class of key exchange between Alice and Bob that was introduced in 2011. The greatest difference from the standard PKA algorithms is that Bob constructs multiple public keys and Alice uses one of these to calculate her public key and her secret shared key. Therefore, the number of public keys and calculation rules for each key differ for each user. Although algorithms with high security and computational efficiency exist in this class, the relation between the parameters of SAPKA and its security and computational efficiency has not yet been fully clarified. Therefore, our main objective in this study was to classify the SAPKA algorithms according to their properties. By attempting algorithm attacks, we found that certain parameters are more strongly related to the security. On this basis, we constructed concrete algorithms and a new subclass of SAPKA, in which the responsibility of maintaining security is significantly more associated with the secret parameters of Bob than those of Alice. Moreover, we demonstrate 1. insufficient but necessary conditions for this subclass, 2. inclusion relations between the subclasses of SAPKA, and 3. concrete examples of this sub-class with reports of implementational experiments.

Developing the basis of the matrix model of the regional innovation subsystem

2020 ◽  
Vol 18 (11) ◽  
pp. 2183-2204
Author(s):  
E.I. Moskvitina
Keyword(s):  
Russian Federation ◽  
Matrix Model ◽  
Federal District ◽  
Assessment Method ◽  
Expert Assessment ◽  
Regional Innovation ◽  
Regional Strategies ◽  
Analysis And Synthesis ◽  
The Matrix ◽  
The Russian Federation

Subject. This article deals with the issues related to the formation and implementation of the innovation capacity of the Russian Federation subjects. Objectives. The article aims to develop the organizational and methodological foundations for the formation of a model of the regional innovation subsystem. Methods. For the study, I used the methods of analysis and synthesis, economics and statistics analysis, and the expert assessment method. Results. The article presents a developed basis of the regional innovation subsystem matrix model. It helps determine the relationship between the subjects and the parameters of the regional innovation subsystem. To evaluate the indicators characterizing the selected parameters, the Volga Federal District regions are considered as a case study. The article defines the process of reconciliation of interests between the subjects of regional innovation. Conclusions. The results obtained can be used by regional executive bodies when developing regional strategies for the socio-economic advancement of the Russian Federation subjects.

Sign in / Sign up

Export Citation Format

Share Document