New Subclass Framework and Concrete Examples of Strongly Asymmetric Public Key Agreement
| Autor: | Massimo Regoli, Koki Jimbo, Satoshi Iriyama |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
public key exchange
security asymmetric asymmetric algorithm cryptography framework limited computational power computationally biased Technology Theoretical computer science Relation (database) Settore ING-INF/05 Computer science QH301-705.5 QC1-999 Cryptography 02 engineering and technology Public-key cryptography Alice and Bob 0202 electrical engineering electronic engineering information engineering General Materials Science Biology (General) Instrumentation QD1-999 Key exchange computer.programming_language Fluid Flow and Transfer Processes Class (computer programming) business.industry Process Chemistry and Technology Physics General Engineering 021001 nanoscience & nanotechnology Engineering (General). Civil engineering (General) Computer Science Applications Chemistry Key (cryptography) 020201 artificial intelligence & image processing TA1-2040 0210 nano-technology business Alice (programming language) computer |
| Zdroj: | Applied Sciences, Vol 11, Iss 5540, p 5540 (2021) Applied Sciences Volume 11 Issue 12 |
| ISSN: | 2076-3417 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|