scholarly journals A Comparative Evaluation of Algorithms in the Implementation of an Ultra-Secure Router-to-Router Key Exchange System

2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Nishaal J. Parmar ◽  
Pramode K. Verma
Keyword(s):  
Comparative Evaluation ◽  
Discrete Logarithm ◽  
Key Generation ◽  
Storage Space ◽  
Original Proposal ◽  
Encryption Algorithms ◽  
Encryption Decryption ◽  
Key Length ◽  
High Level ◽  
And Storage

This paper presents a comparative evaluation of possible encryption algorithms for use in a self-contained, ultra-secure router-to-router communication system, first proposed by El Rifai and Verma. The original proposal utilizes a discrete logarithm-based encryption solution, which will be compared in this paper to RSA, AES, and ECC encryption algorithms. RSA certificates are widely used within the industry but require a trusted key generation and distribution architecture. AES and ECC provide advantages in key length, processing requirements, and storage space, also maintaining an arbitrarily high level of security. This paper modifies each of the four algorithms for use within the self-contained router-to-router environment system and then compares them in terms of features offered, storage space and data transmission needed, encryption/decryption efficiency, and key generation requirements.

Hybrid Cryptography for Random-key Generation based on ECC Algorithm

2017 ◽  
Vol 7 (3) ◽  
pp. 1293 ◽  
Author(s):  
P. Gayathri ◽  
Syed Umar ◽  
G. Sridevi ◽  
N. Bashwanth ◽  
Royyuru Srikanth
Keyword(s):  
Security Level ◽  
Key Generation ◽  
Public Key Encryption ◽  
Private Key ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Safe Side ◽  
Key Length ◽  
High Level ◽  
User Friendly

As more increase in usage of communications and developing them more user friendly. While developing those communications, we need to take care of security and safety of user’s data. Many researchers have developed many complex algorithms to maintain security in user’s application. Among those one of the best algorithms are cryptography based, in which user will be safe side mostly from the attackers.  We already had some AES algorithm which uses very complex cryptographic algorithm to increase the performance and more usage of lookup tables. So the cache timing attackers will correlates the details to encrypt the data under known key with the unknown key. So, for this we provide an improvised solution. This paper deals with an extension of public-key encryption and decryption support including a private key. The private key is generated with the combination of AES and ECC. In general AES, key length is 128 bits with 10 times of iterations. But with this, users won’t get efficient security for their operations, so to increase the security level we are implementing 196-bit based encryption with 12 times round-key generation iterations. By this enhancement, we can assure to users to high level security and can keep users data in confidential way.

scholarly journals The Influence Mechanism of Temperature and Storage Period on Polarization Properties of Poly (Vinylidene Fluoride–Trifluoroethylene) Ultrathin Films

Membranes ◽  
2021 ◽  
Vol 11 (5) ◽  
pp. 301
Author(s):  
Xingjia Li ◽  
Zhi Shi ◽  
Xiuli Zhang ◽  
Xiangjian Meng ◽  
Zhiqiang Huang ◽  
...  
Keyword(s):  
Ultrathin Films ◽  
Remanent Polarization ◽  
Vinylidene Fluoride ◽  
Storage Period ◽  
Testing Temperature ◽  
Fatigue Properties ◽  
Inhibition Mechanism ◽  
Poly Vinylidene Fluoride ◽  
High Level ◽  
And Storage

The effect of testing temperature and storage period on the polarization fatigue properties of poly (vinylidene fluoride-trifluoroethylene) (P(VDF–TrFE)) ultrathin film devices were investigated. The experimental results show that, even after stored in air for 150 days, the relative remanent polarization (Pr/Pr(0)) of P(VDF–TrFE) of ultrathin films can keep at a relatively high level of 0.80 at 25 °C and 0.70 at 60 °C. To account for this result, a hydrogen fluoride (HF) formation inhibition mechanism was proposed, which correlated the testing temperature and the storage period with the microstructure of P(VDF–TrFE) molecular chain. Moreover, a theoretical model was constructed to describe the polarization fatigue evolution of P(VDF–TrFE) samples.

scholarly journals Comparative Evaluation of Bulk Starter Substrates on Activity and Storage of Two Commercial Starter Strains

1990 ◽  
Vol 73 (5) ◽  
pp. 1166-1172 ◽  
Author(s):  
Tineke H. Jones ◽  
Lech Ozimek ◽  
Michael E. Stiles
Keyword(s):  
Comparative Evaluation ◽  
And Storage

scholarly journals On the security of $\alpha\eta$: response to 'some attacks on quantum-based cryptographic protocols'

2006 ◽  
Vol 6 (7) ◽  
pp. 561-582
Author(s):  
H.P. Yuen ◽  
R. Nair ◽  
E. Corndorf ◽  
G.S. Kanter ◽  
P. Kumar
Keyword(s):  
Coherent State ◽  
Optical Communications ◽  
A Priori ◽  
Key Generation ◽  
Generation System ◽  
New Approach ◽  
Security Proof ◽  
Grover Search ◽  
Channel Loss ◽  
Key Length

Lo and Ko have developed some attacks on the cryptosystem called $\alpha \eta$}, claiming that these attacks undermine the security of $\alpha\eta$ for both direct encryption and key generation. In this paper, we show that their arguments fail in many different ways. In particular, the first attack in [1] requires channel loss or length of known-plaintext that is exponential in the key length and is unrealistic even for moderate key lengths. The second attack is a Grover search attack based on `asymptotic orthogonality' and was not analyzed quantitatively in [1]. We explain why it is not logically possible to "pull back'' an argument valid only at $n=\infty$ into a limit statement, let alone one valid for a finite number of transmissions n. We illustrate this by a `proof' using a similar asymptotic orthogonality argument that coherent-state BB84 is insecure for any value of loss. Even if a limit statement is true, this attack is a priori irrelevant as it requires an indefinitely large amount of known-plaintext, resources and processing. We also explain why the attacks in [1] on $\alpha\eta$ as a key-generation system are based on misinterpretations of [2]. Some misunderstandings in [1] regarding certain issues in cryptography and optical communications are also pointed out. Short of providing a security proof for $\alpha\eta$, we provide a description of relevant results in standard cryptography and in the design of $\alpha\eta$ to put the above issues in the proper framework and to elucidate some security features of this new approach to quantum cryptography.

scholarly journals Key Generation based on Henon map and Lorenz system

2020 ◽  
Vol 31 (1) ◽  
pp. 41
Author(s):  
Ansam Sabah Bader ◽  
Shaymaa Hameed ◽  
Maisa’a Abid Ali K.
Keyword(s):  
Lorenz System ◽  
New Method ◽  
Key Generation ◽  
Hénon Map ◽  
Henon Map ◽  
Data Authentication ◽  
Secure Information ◽  
Data Store ◽  
Significant Process ◽  
Encryption Algorithms

Securing information has been the most significant process for communication and data store. Orderly to secure information such as data authentication,  data integrity, and confidentiality must be verified based on algorithms of cryptography. Where, the most important part of any encryption algorithms is the key which specifies if the system is strong enough or not. The proposal of this paper is a new method to generate keys based on two kinds of chaos theory in order to improve the security of cryptographic algorithms. The base of this proposal is to investigate a new method for generating random numbers by using the 3D Lorenz system and 2D Henon map. The newly generated keys have successfully passed the National Institute of Standards and Technology (NIST) statistical test suite

scholarly journals A Two-Stage Offline-to-Online Multiobjective Optimization Strategy for Ship Integrated Energy System Economical/ Environmental Scheduling Problem

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Qing An ◽  
Jun Zhang ◽  
Xin Li ◽  
Xiaobing Mao ◽  
Yulong Feng ◽  
...  
Keyword(s):  
Multiobjective Optimization ◽  
Real World ◽  
Operation Time ◽  
Energy System ◽  
Scheduling Problem ◽  
Storage Space ◽  
Optimization Strategy ◽  
Two Stage ◽  
Integrated Energy System ◽  
And Storage

The economical/environmental scheduling problem (EESP) of the ship integrated energy system (SIES) has high computational complexity, which includes more than one optimization objective, various types of constraints, and frequently fluctuated load demand. Therefore, the intelligent scheduling strategies cannot be applied to the ship energy management system (SEMS) online, which has limited computing power and storage space. Aiming at realizing green computing on SEMS, in this paper a typical SIES-EESP optimization model is built, considering the form of decision vectors, the economical/environmental optimization objectives, and various types of real-world constraints of the SIES. Based on the complexity of SIES-EESPs, a two-stage offline-to-online multiobjective optimization strategy for SIES-EESP is proposed, which transfers part of the energy dispatch online computing task to the offline high-performance computer systems. The specific constraints handling methods are designed to reduce both continuous and discrete constraints violations of SIES-EESPs. Then, an establishment method of energy scheduling scheme-base is proposed. By using the big data offline, the economical/environmental scheduling solutions of a typical year can be obtained and stored with more computing resources and operation time on land. Thereafter, a short-term multiobjective offline-to-online optimization approach by SEMS is considered, with the application of multiobjective evolutionary algorithm (MOEA) and typical schemes corresponding to the actual SIES-EESPs. Simulation results show that the proposed strategy can obtain enough feasible Pareto solutions in a shorter time and get well-distributed Pareto sets with better convergence performance, which can well adapt to the features of real-world SIES-EESPs and save plenty of operation time and storage space for the SEMS.

Sign in / Sign up

Export Citation Format

Share Document