scholarly journals A Distributed Shared Key Generation Procedure Using Fractional Keys

1998 ◽  
Author(s):  
R. Poovendran ◽  
M. S. Corson ◽  
J. S. Baras
Author(s):  
R. Singh

In this article we implement a client server model using limited-used key generation scheme (Kungpisdan, Le, & Srinivasan, 2004) to generate a set of session keys that are never transmitted, which means that there is no chance for the attacker to sniff the packets and retrieve keys while they are being transmitted. These session keys are used for encrypting and hashing the data to be transmitted from mobile client device to the servers in wired network and vice versa. The updating of the session keys used in this technique does not rely on any long-term shared key, instead the process is based upon the last session key used. This technique of elevating the frequency of the key update to the next possible level makes the system much more secure than the other present techniques. In addition to providing better security, this technique also enhances the performance of a limited resource device by avoiding the repeated generation of keys on it.


2013 ◽  
Vol 12 (9) ◽  
pp. 1842-1852 ◽  
Author(s):  
Yunchuan Wei ◽  
Kai Zeng ◽  
Prasant Mohapatra

In today’s world, secured communication is what every field wants. But due to the escalation of theft and unauthorized access to the data, the need for new encryption algorithms has also gone high. This paper proposed a hybrid encryption scheme which uses ElGamal key exchange algorithm and Genetic algorithms. In this scheme, the users share seventeen 16-bit keys, random in nature, using the ElGamal algorithm, which is used to calculate a shared key. Along with this shared key and MAC(Medium Access Control) addresses of both sender and receiver(MAC is used as it is a unique identifier attached to a network adapter or system), a final key is generated through a 10-round algorithm. Further, this final key is used for data encryption using Genetic algorithms. A new key is generated for each communication session between sender and receiver. The proposed technique shows that it is resistant to most of today’s known and common attacks.


2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Longwang Cheng ◽  
Li Zhou ◽  
Boon-Chong Seet ◽  
Wei Li ◽  
Dongtang Ma ◽  
...  

Exploiting the inherent physical properties of wireless channels to complement or enhance the traditional security mechanisms has attracted prominent attention recently. However, the existing secret key generation schemes suffer from miscellaneous extracting procedure. Many PHY-layer authentication schemes assume that the knowledge of the shared key is preknown. In this paper, we propose PHY-layer secret key generation and authentication schemes for orthogonal frequency-division multiplexing (OFDM) systems. In the secret key generation scheme, to simplify the extracting procedure, only one legitimate party is chosen to probe the channel and quantize the measurements to obtain the preliminary key. The preliminary key is masked by the channel-phase after the mapping and before equalization and distributed to the other party. The final shared key is used for the PHY-layer authentication scheme in which random signals and the shared key masked by the channel-phase are exchanged at the PHY-layer. Then, a binary hypothesis test is formulated for authentication. Simulation results show that the proposed secret key generation scheme outperforms the existing schemes. For the PHY-layer authentication scheme, it is immune to various passive and active attacks and a high successful authentication rate is acquired even at low signal-to-noise ratio region.


Cryptography ◽  
2020 ◽  
Vol 4 (1) ◽  
pp. 5
Author(s):  
Eric Järpe

The Diffie–Hellman protocol, ingenious in its simplicity, is still the major solution in protocols for generating a shared secret in cryptography for e-trading and many other applications after an impressive number of decades. However, lately, the threat from a future quantum computer has prompted successors resilient to quantum computer-based attacks. Here, an algorithm similar to Diffie–Hellman is presented. In contrast to the classic Diffie–Hellman, it involves floating point numbers of arbitrary size in the generation of a shared secret. This can, in turn, be used for encrypted communication based on symmetric cyphers. The validity of the algorithm is verified by proving that a vital part of the algorithm satisfies a one-way property. The decimal part is deployed for the one-way function in a way that makes the protocol a post-quantum key generation procedure. This is concluded from the fact that there is, as of yet, no quantum computer algorithm reverse engineering the one-way function. An example illustrating the use of the protocol in combination with XOR encryption is given.


Sign in / Sign up

Export Citation Format

Share Document