Please enable JavaScript.
Coggle requires JavaScript to display documents.
Key Exchange Mechanism - Coggle Diagram
Key Exchange Mechanism
Key Exchange Protocol Based on T-tensor Product
Problems of matrix-based public key cryptosystems
Restriction of the matrix dimension
Communication cost
Calculation cost
proposed model
a new matrix operation based on the Tropical matrix algebra the T-tensor product
a new lightweight key exchange protocol by employing the T-tensor product
a.Select two polynomial p1(x) and p2(x)
Calculate P = ∝_B (p1(A) ∝_T p2(B))
b.Select two polynomial q1(x) and q2(x)
Calculate Q =∝_A (q1(A)∝_T q2(B))
a.Calculate p1(A)∝_T ∝_A^(-1) (Q) ∝_T p2(B)
b.Calculateq1(A)∝_T ∝_B^(-1) (P)∝_T q2(B)
advantages of our proposed protocol
Efficiency
Reduce time of calculation
Reduce the calculation cost
increase the energy consumption
can be used with any symmetric cryptographic protocol
very suitable for a limited hardware environment
It can generate session keys of any size and reduce the cost of key exchange.
Fundamental Knowledge
Tropical algebra
transforming algebra-geometric problems into purely combinatorics ones
Tropical matrix algebra
can be used for matrix operations as well
Tropical public key cryptosystem
using it to design our key exchange protocol
Secure End-to-End Key Exchange Mechanism
threats of eavesdropping and Man-In-The-Middle (MITM) attacks
key exchange process
the transfer of data between the two remote parties and minimize security risks
our proposed scheme
alternative secure end-to-end key exchange mechanism by Multiple Devices Using QR Codes
Main concept
System architecture
Two remote parties
sender and receiver
Cellular network and Ethernet
Procedure of the key exchange
The usability of the proposed mechanism
design of real-world QR code exchanges and the use of smartphones for Internet connectivity
Security concerns
insist eavesdropping, MITM attacks and brute-force attacks
Possible solution for the security strengthening
the key which is supposed to be shared between the two remote parties will be divided into two parts and each part will be encrypted and be embedded into an individual QR code.
Public Key Encryption System
challenge that all symmetric or private key cryptosystems face
the problem of transmitting the secret key to all network users.
The degree of key sharing
is in the order of the square of the network's number of nodes
Proposed scheme: Pascal Parallelogram
Combinatorial Numbers
(n¦k)=n!/k!(n-k)!
PBJ Algorithm
Let P = Set of all paths through the parallelogram
Let B = Set of all bit strings of length 2n with n 1-bits
Let J = the subset of N, the natural numbers in the range =[1,(2n¦n)]
Application of the Diffie-Hellman Method for Key Exchange Events
use the Diffie-Hellman key exchange, to develop a shared key; then transmit a secret message using the Pascal parallelogram.
new Method of Asymmetric Encryption and Decryption
complexity of the cryptosystem can be defined for any odd integer, say 2k +1
four corners of the parallelogram
Home Plate:(2k¦k); First Base: (k¦k);Second Base: (0¦0); and Third Base: (k¦0)
Secure Key Exchange Protocol
proposed scheme
Secure Key Exchange Protocol Based on Elliptic Curve and Security Models
AKA protocol which is based on the ideas of the hashed MQV (HMQV)
diffrent in
protocol generates the session keys based on both the static and the ephemeral keys whereas the previous work uses only the public ephemeral keys
Security analysis
protect againts
Known-Key Security
Replay
Forgery
Man-in-the-Middle Attack
Perfect Forward Secrecy
Key Compromise Impersonation
Unknown Key Share
Key Control
Ensure:
confidentiality
authentication
integrity
a two-pass protocol that produces nine keys per session and thus avoids the imperfect random generation and side channel attacks from the protection for a generated key based on static and ephemeral keys
The two communication parties need to exchange keys throughout their session in order to execute this mission
most efficient algorithms for securing data
Elliptic Curve-Diffie Hellman (ECDH)
more efficient than other traditional techniques such as Rivest–Shamir–Adleman (RSA) in terms of key size, computation and network bandwidth
New Technique for Key Exchange Protocol
proposed scheme
A New Technique for Diffie-Hillman Key Exchange Protocol Security using Random Image Generation
to improve the security of the Diffie–Hellman protocol
4 Stage
Random image generation
Random key generation from step1
Key Exchange method
Apply the RSA algorithm
Experimental Result
The keys generated from an image is more secure from Pseudo-Random numbers
The structure of this method is more straightforward
It provides the ability to exchange the keys without much time needed
Image size increased.
the security was increased with image size.
type of cryptographic algorithms
symmetric algorithms
asymmetric algorithms
Diffie-Hellman protocol
utilizes 2 public-key cryptosystem
the first key is a public key to encrypt data
the second key is the private key to decrypt data
vulnerabilities
Man-in-the-Middle
discrete logarithm
RSA algorithm
algorithm for implementing the Diffie-hillman key exchange protocol
Public-key encryption
Digital Signature
Encryption
B Obtains the public key (n, e)
Acts the message (plaintext) as a positive integer M.
Calculates the cypher-text by applying 〖C=M〗^e mod n
Sends the message (cypher-text) from A to B.
Decryption
After receiving the encrypted message by recipient “B”.
After the recipient "B” receives the encrypted message sent from the sender "A", B must take some steps to read this message
Computing M=C^d mod n, on cipher text to extract the plain text
Extracting the plaintext by converting the result M from the integers to letters M