Academic literature on the topic 'Elliptic Curve Diffie-Hellman Algorithm (ECDHA)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Elliptic Curve Diffie-Hellman Algorithm (ECDHA).'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Elliptic Curve Diffie-Hellman Algorithm (ECDHA)"
1
Vamsi, Desam, and Pradeep Reddy CH. "Hybrid Image Encryption Using Elliptic Curve Cryptography, Hadamard Transform and Hill Cipher." Webology 19, no. 1 (2022): 2357–78. http://dx.doi.org/10.14704/web/v19i1/web19160.
Full textAbstract:
In this digital world, communication systems have witnessed abundant usage of media over the platforms. Among these, providing security in transmission of images is highly important, and attained a lot of research interest due to its high consideration in both the industry and the academic community. This paper proposes a hybrid asymmetric image encryption algorithm using Elliptic curve cryptosystem (ECC), Hadamard transform and Hill cipher algorithms. Based on the Diffie–Hellman public key exchange method a point on the elliptic curve is selected and agreed between both the sender and receiver. The key relies upon the ECC and it is difficult to resolve the ECDLP to get it. The proposed algorithm involves two stages of encryption, primarily, the XOR function is applied on the Elliptic curve Diffie-Hellman (ECDH) shared secret key and the hadamard image. In the subsequent stage, ECC is combined with the hill cipher algorithm. Encryption and decryption uses self-invertible key matrix, hence the process of finding inverse key becomes redundant during decryption which improves the speed of execution. It also enhances the security and efficiency compared to original hill cipher method. The results are compared with other ECC methods proves that the current cryptosystem attains large key space, highly key sensitive, low correlation and can resist against differential and statistical attacks.
2
Saepulrohman, Asep, and Teguh Puja Negara. "IMPLEMENTASI ALGORITMA TANDA TANGAN DIGITAL BERBASIS KRIPTOGRAFI KURVA ELIPTIK DIFFIE-HELLMAN." Komputasi: Jurnal Ilmiah Ilmu Komputer dan Matematika 18, no. 1 (2021): 22–28. http://dx.doi.org/10.33751/komputasi.v18i1.2569.
Full textAbstract:
In data communication systems, digital signatures are a form of electronic signature security services based on the Elliptic Curve Digital Signature Algorithm (ECDSA) which are considered resistant to certain types of attacks. Attacks on digital signature schemes aim to fake a signature or are called forgery which is said to be successful if the key pair and signature generated by the attacker are accepted by the verifier. Mathematical schemes used to prove the authenticity of messages or digital documents or guarantees that the data and information actually come from the correct source. ECDSA-based digital signatures rely on discrete logarithmic problems as the basis for mathematical calculations. Q = kP where Q and P are the points of the elliptic curve in the finite field or and k is a positive integer number. The hash function generated from the algorithm process is then encoded (encrypted) with an asymmetric key cryptographic algorithm. In this work use p = 149 to encrypt plain text by converting the original message using dots on a curve with the help of Python programs.
3
Di Matteo, Stefano, Luca Baldanzi, Luca Crocetti, Pietro Nannipieri, Luca Fanucci, and Sergio Saponara. "Secure Elliptic Curve Crypto-Processor for Real-Time IoT Applications." Energies 14, no. 15 (2021): 4676. http://dx.doi.org/10.3390/en14154676.
Full textAbstract:
Cybersecurity is a critical issue for Real-Time IoT applications since high performance and low latencies are required, along with security requirements to protect the large number of attack surfaces to which IoT devices are exposed. Elliptic Curve Cryptography (ECC) is largely adopted in an IoT context to provide security services such as key-exchange and digital signature. For Real-Time IoT applications, hardware acceleration for ECC-based algorithms can be mandatory to meet low-latency and low-power/energy requirements. In this paper, we propose a fast and configurable hardware accelerator for NIST P-256/-521 elliptic curves, developed in the context of the European Processor Initiative. The proposed architecture supports the most used cryptography schemes based on ECC such as Elliptic Curve Digital Signature Algorithm (ECDSA), Elliptic Curve Integrated Encryption Scheme (ECIES), Elliptic Curve Diffie-Hellman (ECDH) and Elliptic Curve Menezes-Qu-Vanstone (ECMQV). A modified version of Double-And-Add-Always algorithm for Point Multiplication has been proposed, which allows the execution of Point Addition and Doubling operations concurrently and implements countermeasures against power and timing attacks. A simulated approach to extract power traces has been used to assess the effectiveness of the proposed algorithm compared to classical algorithms for Point Multiplication. A constant-time version of the Shamir’s Trick has been adopted to speed-up the Double-Point Multiplication and modular inversion is executed using Fermat’s Little Theorem, reusing the internal modular multipliers. The accelerator has been verified on a Xilinx ZCU106 development board and synthesized on both 45 nm and 7 nm Standard-Cell technologies.
4
Shareef, Omar Salah F., and Ali Makki Sagheer. "Improved Certificate-Based Encryption Scheme in the Big Data: Combining AES and (ECDSA – ECDH)." Ibn AL- Haitham Journal For Pure and Applied Sciences 2021 (June 1, 2021): 82–95. http://dx.doi.org/10.30526/2021.ihicpas.2655.
Full textAbstract:
Big data usually running in large-scale and centralized key management systems. However, the centralized key management systems are increasing the problems such as single point of failure, exchanging a secret key over insecure channels, third-party query, and key escrow problem. To avoid these problems, we propose an improved certificate-based encryption scheme that ensures data confidentiality by combining symmetric and asymmetric cryptography schemes. The combination can be implemented by using the Advanced Encryption Standard (AES) and Elliptic Curve Diffie-Hellman (ECDH). The proposed scheme is an enhanced version of the Certificate-Based Encryption (CBE) scheme and preserves all its advantages. However, the key generation process in our scheme has been done without any intervention from the certificate issuer and avoiding the risk of compromised CA. The Elliptic Curve Digital Signature Algorithm (ECDSA) has been used with the ECDH to handle the authentication of the key exchange. The proposed scheme is demonstrated on a big dataset of social networks. The scheme is analyzed based on security criteria that have been compared with the previous schemes to evaluate its performance.
5
Zhu, Yuan, Yipeng Liu, Mingzhi Wu, Jinzhao Li, Shiyang Liu, and Jianning Zhao. "Research on Secure Communication on In-Vehicle Ethernet Based on Post-Quantum Algorithm NTRUEncrypt." Electronics 11, no. 6 (2022): 856. http://dx.doi.org/10.3390/electronics11060856.
Full textAbstract:
In the context of the evolution of in-vehicle electronic and electrical architecture as well as the rapid development of quantum computers, post-quantum algorithms, such as NTRUEncrypt, are of great significance for in-vehicle secure communications. In this paper, we propose and evaluate, for the first time, a NTRUEncrypt enhanced session key negotiation for the in-vehicle Ethernet context. Specifically, the time consumption and memory occupation of the NTRUEncrypt Elliptic Curve Diffie–Hellman (ECDH), and Rivest–Shamir–Adleman (RSA) algorithms, which are used for session key negotiation, are measured and compared. The result shows that, besides the NTRUEncrypt’s particular attribute of resisting quantum computer attacks, the execution speed of session key negotiation using NTRUEncrypt is 66.06 times faster than ECDH, and 1530.98 times faster than RSA at the 128-bit security level. The memory occupation of the algorithms is at the same order of magnitude. As the transport layer security (TLS) protocol can fulfill most performance requirements of the automotive industry, post-quantum enhanced session key negotiation will probably be widely used for in-vehicle Ethernet communication.
6
P.Wagh, Dnyaneshwari, Fadewar H.S, Shinde G. N, and Santosh P. Shrikhande. "A Finger Vein Pattern based Key GenerationExchange and Security framework for IoT using ID based cryptography, ECDH and AES." International Journal of Engineering and Computer Science 11, no. 08 (2022): 25553–63. http://dx.doi.org/10.18535/ijecs/v11i08.4695.
Full textAbstract:
Every person has a unique finger vein pattern existing within each finger. Unlike facial features or fingerprints, finger vein authentication systems aren’t vulnerable to forgery. Finger vein authentication systems are more secure and reliable, and less expensive, than biometric security systems using fingerprint. This paper presents a novel security framework based on finger vein pattern. Finger Vein pattern in used in ID based cryptography to generate the keys for data encryption. These keys are combined with generator of Elliptic Curve Cryptography (ECC) to exchange the keys using Diffie Hellman key exchange algorithm. Once the keys are exchanged, the data is encrypted using Advance Encryption Standard (AES). This framework is tested in Internet of Things (IoT) environment for enhancing the security. The IoT based security systems implemented in the banks and other organizations can be enhanced considerably using the proposed security model.
7
Agrawal, Prakhar, and Arvind Upadhyay. "An Implementation of Text and Color Image Steganography Technique Using Cryptographic Algorithm." Asian Journal of Computer Science and Technology 7, no. 1 (2018): 93–98. http://dx.doi.org/10.51983/ajcst-2018.7.1.1818.
Full textAbstract:
The craft of data stowing away has gotten much consideration in the ongoing years as security of data has turned into a major worry in this web time. As sharing of delicate data by means of a typical correspondence channel have become inevitable, Steganography techniques aimed at secretly hiding data in a multimedia carrier such as text, audio, image or video, without raising any suspicion of alteration to its contents. The original carrier is referred to as the cover object. In this paper, we proposed a mechanism of end user data security by means of image steganography technique using ECDH (Elliptic Curve Diffie–Hellman) algorithm for improving image quality while we hide data in image. Our proposed approach is simplified yet efficient algorithm that can be implemented for end user application that strictly enforces the data integrity over the communication channel. The performance of the proposed approach is measured in terms of time, memory, MSE and PSNR which was better improved from the previous approach in the similar parameters.
8
Kamal, Ahmed, Esam Hagras, and H. A. El-Kamchochi. "Dynamic fractional chaotic biometric isomorphic elliptic curve for partial image encryption." Computer Science and Information Systems 18, no. 3 (2021): 1057–76. http://dx.doi.org/10.2298/csis200502018k.
Full textAbstract:
In this paper, a Modular Fractional Chaotic Sine Map (MFC-SM) has been introduced to achieve high Lyapunov exponent values and completely chaotic behavior of the bifurcation diagram for high level security. The proposed MFC-SM is compared with the conventional non MFC-SM and it has an excellent chaotic analysis. In addition, the randomness test results indicate that the proposed MFC-SM shows better performance and satisfy all randomness tests. Due to the excellent chaotic properties and good randomization results for the proposed MFC-SM, it is used to be cooperated with the biometric digital identity to achieve dynamic chaotic biometric digital identity. Also, for real time image encryption, both Discrete Wavelet Transform (DWT)partial image encryption and Isomorphic Elliptic Curve (IEC)key exchange are used. In addition, the biometric digital identity is extracted from the user fingerprint image as fingerprint minutia data incorporated with the proposed MFC-SM and hence, a new Dynamic Fractional Chaotic Biometric Digital IdentityIEC (DFC-BID-IEC) has been introduced. Dynamic Fractional Chaotic Key Generator (DFC-KG) is used to control the key schedule for all encryption and decryption processing. The encryption process consists of the confusion and diffusion steps. In the confusion step, the 2D Arnold Cat Map (ACM) is used with secret parameters taken from DFC-KG. Also, the diffusion step is based on the dynamic chaotic self-invertible secret key matrix which can be generated from the proposed MFC-SM. The IEC key exchange secret parameters are generated based on Elliptic Curve Diffie?Hellman(ECDH) key exchange and the isomorphism parametre. Statistical analysis, differential analysis and key sensitivity tests are performed to estimate the security strengths of the proposed DFC-BID-IEC system. The experimental results show that the proposed algorithm is robust against common signal processing attacks and provides a high security level and high speed for image encryption application.
9
Riffi Boualam, Soukayna, Mariyam Ouaissa, Mariya Ouaissa, and Abdellatif Ezzouhairi. "Privacy Preservation Authentication Model for a Secure Infrastructure over Vehicular Communications." International Journal of Interactive Mobile Technologies (iJIM) 16, no. 12 (2022): 52–71. http://dx.doi.org/10.3991/ijim.v16i12.31533.
Full textAbstract:
Vehicle Ad-hoc Networks (VANET) are considered among recent wireless communication technologies. Nowadays, vehicles are no more than simple means of transport, they are endowed with a source of intelligence through their interaction with the road environment due to embedded equipment on board vehicles and integrated into stations along roads and highways. The mechanisms of security and protection of messages exchanged in VANET, thus preserving the privacy of users and satisfying the various security requirements, are a prerequisite for the deployment of vehicle networks. Increasingly, several research have been proposed to improve protocols for maintaining security and preserving privacy. This paper presents a hierarchical revocable infrastructure based privacy preservation authentication protocol for vehicles that involves authentication of each vehicle and the corresponding Road Side Unit (RSU) by a Certification Authority (CA). The proposed protocol used Elliptic Curve Diffie Hellman (ECDH) algorithm for reliable key exchange and Edwards-curve Digital Signature Algorithm (EdDSA) to speed up the execution of the authentication process especially at the key management level, message signing and verification of this signature. On the other hand, the creation of sub-lists of revoked certificates based on vehicle type makes it possible to minimize the response time by looking for a certificate if it is revoked or not. Our solution was checked by the security verification tool, Automated Validation of Internet Security Protocols and Applications (AVISPA), which indicated that it is a very secure level. Performance analysis illustrates that the protocol greatly saves computation resources.
10
Abikoye, Oluwakemi Christiana, Esau Taiwo Oladipupo, Agbotiname Lucky Imoize, Joseph Bamidele Awotunde, Cheng-Chi Lee, and Chun-Ta Li. "Securing Critical User Information over the Internet of Medical Things Platforms Using a Hybrid Cryptography Scheme." Future Internet 15, no. 3 (2023): 99. http://dx.doi.org/10.3390/fi15030099.
Full textAbstract:
The application of the Internet of Medical Things (IoMT) in medical systems has brought much ease in discharging healthcare services by medical practitioners. However, the security and privacy preservation of critical user data remain the reason the technology has not yet been fully maximized. Undoubtedly, a secure IoMT model that preserves individual users’ privacy will enhance the wide acceptability of IoMT technology. However, existing works that have attempted to solve these privacy and insecurity problems are not space-conservative, computationally intensive, and also vulnerable to security attacks. In this paper, an IoMT-based model that conserves the privacy of the data, is less computationally intensive, and is resistant to various cryptanalysis attacks is proposed. Specifically, an efficient privacy-preserving technique where an efficient searching algorithm through encrypted data was used and a hybrid cryptography algorithm that combines the modification of the Caesar cipher with the Elliptic Curve Diffie Hellman (ECDH) and Digital Signature Algorithm (DSA) were projected to achieve user data security and privacy preservation of the patient. Furthermore, the modified algorithm can secure messages during transmission, perform key exchanges between clients and healthcare centres, and guarantee user authentication by authorized healthcare centres. The proposed IoMT model, leveraging the hybrid cryptography algorithm, was analysed and compared against different security attacks. The analysis results revealed that the model is secure, preserves the privacy of critical user information, and shows robust resistance against different cryptanalysis attacks.
Dissertations / Theses on the topic "Elliptic Curve Diffie-Hellman Algorithm (ECDHA)"
1
Abu-Mahfouz, Adnan Mohammed. "Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices." Diss., University of Pretoria, 2004. http://hdl.handle.net/2263/25330.
Full textAbstract:
Data security will play a central role in the design of future IT systems. The PC has been a major driver of the digital economy. Recently, there has been a shift towards IT applications realized as embedded systems, because they have proved to be good solutions for many applications, especially those which require data processing in real time. Examples include security for wireless phones, wireless computing, pay-TV, and copy protection schemes for audio/video consumer products and digital cinemas. Most of these embedded applications will be wireless, which makes the communication channel vulnerable. The implementation of cryptographic systems presents several requirements and challenges. For example, the performance of algorithms is often crucial, and guaranteeing security is a formidable challenge. One needs encryption algorithms to run at the transmission rates of the communication links at speeds that are achieved through custom hardware devices. Public-key cryptosystems such as RSA, DSA and DSS have traditionally been used to accomplish secure communication via insecure channels. Elliptic curves are the basis for a relatively new class of public-key schemes. It is predicted that elliptic curve cryptosystems (ECCs) will replace many existing schemes in the near future. The main reason for the attractiveness of ECC is the fact that significantly smaller parameters can be used in ECC than in other competitive system, but with equivalent levels of security. The benefits of having smaller key size include faster computations, and reduction in processing power, storage space and bandwidth. This makes ECC ideal for constrained environments where resources such as power, processing time and memory are limited. The implementation of ECC requires several choices, such as the type of the underlying finite field, algorithms for implementing the finite field arithmetic, the type of the elliptic curve, algorithms for implementing the elliptic curve group operation, and elliptic curve protocols. Many of these selections may have a major impact on overall performance. In this dissertation a finite field from a special class called the Optimal Extension Field (OEF) is chosen as the underlying finite field of implementing ECC. OEFs utilize the fast integer arithmetic available on modern microcontrollers to produce very efficient results without resorting to multiprecision operations or arithmetic using polynomials of large degree. This dissertation discusses the theoretical and implementation issues associated with the development of this finite field in a low end embedded system. It also presents various improvement techniques for OEF arithmetic. The main objectives of this dissertation are to --Implement the functions required to perform the finite field arithmetic operations. -- Implement the functions required to generate an elliptic curve and to embed data on that elliptic curve. -- Implement the functions required to perform the elliptic curve group operation. All of these functions constitute a library that could be used to implement any elliptic curve cryptosystem. In this dissertation this library is implemented in an 8-bit AVR Atmel microcontroller.<br>Dissertation (MEng (Computer Engineering))--University of Pretoria, 2006.<br>Electrical, Electronic and Computer Engineering<br>unrestricted
2
Fujdiak, Radek. "Analýza a optimalizace datové komunikace pro telemetrické systémy v energetice." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2017. http://www.nusl.cz/ntk/nusl-358408.
Full textAbstract:
Telemetry system, Optimisation, Sensoric networks, Smart Grid, Internet of Things, Sensors, Information security, Cryptography, Cryptography algorithms, Cryptosystem, Confidentiality, Integrity, Authentication, Data freshness, Non-Repudiation.
3
Das, Saptarsi. "A Polymorphic Finite Field Multiplier." Thesis, 2011. https://etd.iisc.ac.in/handle/2005/2100.
Full textAbstract:
Cryptography algorithms like the Advanced Encryption Standard, Elliptic Curve Cryptography algorithms etc are designed using algebraic properties of finite fields. Thus performance of these algorithms depend on performance of the underneath field operations. Moreover, different algorithms use finite fields of widely varying order. In order to cater to these finite fields of different orders in an area efficient manner, it is necessary to design solutions in the form of hardware-consolidations, keeping the performance requirements in mind. Due to their small area occupancy and high utilization, such circuits are less likely to stay idle and therefore are less prone to loss of energy due to leakage power dissipation. There is another class of applications that rely on finite field algebra namely the various error detection and correction techniques. Most of the classical block codes used for detection of bit-error in communications over noisy communication channels apply the algebraic properties of finite fields. Cyclic redundancy check is one such algorithm used for detection of error in data in computer network. Reed-Solomon code is most notable among classical block codes because of its widespread use in storage devices like CD, DVD, HDD etc.
In this work we present the architecture of a polymorphic multiplier for operations over various extensions of GF(2). We evolved the architecture of a textbook shift-and-add multiplier to arrive at the architecture of the polymorphic multiplier through a generalized mathematical formulation. The polymorphic multiplier is capable of morphing itself in runtime to create data-paths for multiplications of various orders. In order to optimally exploit the resources, we also introduced the capability of sub-word parallel execution in the polymorphic multiplier. The synthesis results of an instance of such a polymorphic multipliershowsabout41% savings in area with 21% degradation in maximum operating frequency compared to a collection of dedicated multipliers with equivalent functionality. We introduced the multiplier as an accelerator unit for field operations in the coarse grained runtime reconfigurable platform called REDEFINE. We observed about 40-50% improvement in performance of the AES algorithm and about 52×improvement in performance of Karatsuba-Ofman multiplication algorithm.
4
Das, Saptarsi. "A Polymorphic Finite Field Multiplier." Thesis, 2011. http://hdl.handle.net/2005/2100.
Full textAbstract:
Cryptography algorithms like the Advanced Encryption Standard, Elliptic Curve Cryptography algorithms etc are designed using algebraic properties of finite fields. Thus performance of these algorithms depend on performance of the underneath field operations. Moreover, different algorithms use finite fields of widely varying order. In order to cater to these finite fields of different orders in an area efficient manner, it is necessary to design solutions in the form of hardware-consolidations, keeping the performance requirements in mind. Due to their small area occupancy and high utilization, such circuits are less likely to stay idle and therefore are less prone to loss of energy due to leakage power dissipation. There is another class of applications that rely on finite field algebra namely the various error detection and correction techniques. Most of the classical block codes used for detection of bit-error in communications over noisy communication channels apply the algebraic properties of finite fields. Cyclic redundancy check is one such algorithm used for detection of error in data in computer network. Reed-Solomon code is most notable among classical block codes because of its widespread use in storage devices like CD, DVD, HDD etc.
In this work we present the architecture of a polymorphic multiplier for operations over various extensions of GF(2). We evolved the architecture of a textbook shift-and-add multiplier to arrive at the architecture of the polymorphic multiplier through a generalized mathematical formulation. The polymorphic multiplier is capable of morphing itself in runtime to create data-paths for multiplications of various orders. In order to optimally exploit the resources, we also introduced the capability of sub-word parallel execution in the polymorphic multiplier. The synthesis results of an instance of such a polymorphic multipliershowsabout41% savings in area with 21% degradation in maximum operating frequency compared to a collection of dedicated multipliers with equivalent functionality. We introduced the multiplier as an accelerator unit for field operations in the coarse grained runtime reconfigurable platform called REDEFINE. We observed about 40-50% improvement in performance of the AES algorithm and about 52×improvement in performance of Karatsuba-Ofman multiplication algorithm.
5
Lin, Jhih-Yun, and 林志耘. "The Implementation of Elliptic Curve Diffie-Hellman and Elliptic Curve Digital Signature Algorithm on Altera DE2-70." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/bvjpkm.
Full textAbstract:
碩士<br>逢甲大學<br>資訊工程學系<br>103<br>Abstract—In recent years, Elliptic Curve Cryptography (ECC) to be attracted the attention of researcher and product developer. There are two reasons, first is having powerful mathematical structure; attackers need to know background of elliptic curve arithmetic will be easy attack. Second, for using less bit of key to reach the same safety with RSA encryption algorithm, therefore, to keep enough safety, when bit of key increase gradually, relative to RSA encryption algorithm, process time of ECC will reduce, with this characteristic, when we keep same safety in resource-constrained device, ECC will be suitable to use in the environment.
This paper is based on implementation of ECC to design two safety protocols; one is Diffie–Hellman key exchange (D-H). This target of protocol is to give both communications can exchange a key in safety to provide following using encryption and decryption. The second one is digital signature algorithm (DSA) .Its purpose is to prevent non-repudiation. However digital signature can be divided into two parts, signature and verification. These two protocols are based on point arithmetic, includes point addition and point doubling. And these two point arithmetic are both from finite field arithmetic, this paper is based on GF(
Book chapters on the topic "Elliptic Curve Diffie-Hellman Algorithm (ECDHA)"
1
Mogollon, Manuel. "Elliptic Curve Cryptograpy." In Cryptography and Security Services. IGI Global, 2008. http://dx.doi.org/10.4018/978-1-59904-837-6.ch008.
Full textAbstract:
For the same level of security that public-key cryptosystems such as RSA have, elliptic curve cryptography (ECC) offers the benefit of smaller key sizes, hence smaller memory and processor requirements. The Diffie-Hellman key exchange, ElGamal encryption, digital signatures, and the Digital Signature Algorithm (DSA) can all be implemented in ECC. This makes ECC a very attractive algorithm for wireless devices such as handhelds and PDAs, which have limited bandwidth and processing power. Running on the same platform, ECC runs more TLS/SSL transactions per second than RSA. This chapter describes the basic concepts and definitions of elliptic curve cryptography.
2
Sathish, A., S. Ravimaran, and S. Jerald Nirmal Kumar. "A Well-Organized Safeguarded Access on Key Propagation by Malleable Optimization in Blend With Double Permutation." In Research Anthology on Artificial Intelligence Applications in Security. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-7705-9.ch037.
Full textAbstract:
With the rapid developments occurring in cloud computing and services, there has been a growing trend of using the cloud for large-scale data storage. This has led to a major security dispute on data handling. Thus, the process can be overcome by utilizing an efficient shielded access on a key propagation (ESAKP) technique along with an adaptive optimization algorithm for password generation and performing double permutation. The password generation is done by adaptive ant lion optimization (AALO) which tackles the problem of ineffiency. This build has stronger security which needs an efficient selection property by eliminating the worst fit in each iteration. The optimized password is utilized by an adaptive vignere cipher for efficient key generation in which adaptiveness is employed to prevent the dilemma of choosing the first letter of alphabet which in turn reduces the computation time and improves the security. Additionally, there is a need to encrypte the symmetric key asymmetrically with a Elliptic Curve-Diffie Hellman algorithm (EC-DH) with a double stage permutation which produces a scrambling form of data adding security to the data.
3
Sathish, A., S. Ravimaran, and S. Jerald Nirmal Kumar. "A Well-Organized Safeguarded Access on Key Propagation by Malleable Optimization in Blend With Double Permutation." In Research Anthology on Artificial Intelligence Applications in Security. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-7705-9.ch037.
Full textAbstract:
With the rapid developments occurring in cloud computing and services, there has been a growing trend of using the cloud for large-scale data storage. This has led to a major security dispute on data handling. Thus, the process can be overcome by utilizing an efficient shielded access on a key propagation (ESAKP) technique along with an adaptive optimization algorithm for password generation and performing double permutation. The password generation is done by adaptive ant lion optimization (AALO) which tackles the problem of ineffiency. This build has stronger security which needs an efficient selection property by eliminating the worst fit in each iteration. The optimized password is utilized by an adaptive vignere cipher for efficient key generation in which adaptiveness is employed to prevent the dilemma of choosing the first letter of alphabet which in turn reduces the computation time and improves the security. Additionally, there is a need to encrypte the symmetric key asymmetrically with a Elliptic Curve-Diffie Hellman algorithm (EC-DH) with a double stage permutation which produces a scrambling form of data adding security to the data.
4
Krishna, A. V. N. "A Randomized Cloud Library Security Environment." In Cloud Security. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-8176-5.ch056.
Full textAbstract:
Cloud computing is leading the technology development of today's communication scenario. This is because of its cost-efficiency and flexibility. In Cloud computing vast amounts of data are stored in varied and distributed environments, and security to data is of prime concern. RSA or Elliptic Curve Cryptography (ECC) provides a secure means of message transmission among communicating hosts using Diffie Hellman Key Exchange algorithm or ElGamal algorithm. By having key lengths of 160 bits, the ECC algorithm provides sufficient strength against crypto analysis and its performance can be compared with standard algorithms like RSA with a bit length of 1024 bits. In the present work, the plain text is converted to cipher text using RSA or ECC algorithms. As the proposed model is intended to be used in Cloud environment, a probabilistic mathematical model is also used. While the data is being retrieved from the servers, a query is being used which uses the mathematical model to search for the data which is still in encryption form. Final decryption takes place only at user's site by using the private keys. Thus the security model provides the fundamental security services like Authentication, Security, and Confidentiality to the transmitted message and also provides sufficient strength against crypto analysis in Cloud environment.
5
Krishna, A. V. N. "A Randomized Cloud Library Security Environment." In Advances in Library and Information Science. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-4631-5.ch016.
Full textAbstract:
Cloud computing is leading the technology development of today’s communication scenario. This is because of its cost-efficiency and flexibility. In Cloud computing vast amounts of data are stored in varied and distributed environments, and security to data is of prime concern. RSA or Elliptic Curve Cryptography (ECC) provides a secure means of message transmission among communicating hosts using Diffie Hellman Key Exchange algorithm or ElGamal algorithm. By having key lengths of 160 bits, the ECC algorithm provides sufficient strength against crypto analysis and its performance can be compared with standard algorithms like RSA with a bit length of 1024 bits. In the present work, the plain text is converted to cipher text using RSA or ECC algorithms. As the proposed model is intended to be used in Cloud environment, a probabilistic mathematical model is also used. While the data is being retrieved from the servers, a query is being used which uses the mathematical model to search for the data which is still in encryption form. Final decryption takes place only at user’s site by using the private keys. Thus the security model provides the fundamental security services like Authentication, Security, and Confidentiality to the transmitted message and also provides sufficient strength against crypto analysis in Cloud environment.
Conference papers on the topic "Elliptic Curve Diffie-Hellman Algorithm (ECDHA)"
1
Toyran, Mustafa, and Savas Berber. "Efficient implementation of elliptic curve Diffie-Hellman (ECDH) key distribution algorithm in pool-based cryptographic systems (PBCSs)." In 2010 IEEE 18th Signal Processing and Communications Applications Conference (SIU). IEEE, 2010. http://dx.doi.org/10.1109/siu.2010.5653023.
Full text
2
Zhen Cheng, Yufang Huang, and Jin Xu. "Algorithm for elliptic curve Diffie-Hellman key exchange based on DNA tile self-assembly." In 2008 3rd International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2008). IEEE, 2008. http://dx.doi.org/10.1109/bicta.2008.4656700.
Full text
3
Ahmedova, Oydin, Zarif Khudoykulov, Ulugbek Mardiyev, and Akbar Ortiqboyev. "Conversion of the Diffie-Hellman Key Exchange Algorithm Based on Elliptic Curve Equations to Elliptic Curve Equations with Private Parameters." In 2021 International Conference on Information Science and Communications Technologies (ICISCT). IEEE, 2021. http://dx.doi.org/10.1109/icisct52966.2021.9670074.
Full text
4
Jin, Xiyou, and Jonathan Sahagun. "Deuterium: A Secure Protocol for Group Messaging with Rotating Keys and Identity Verification." In 11th International Conference on Signal Image Processing and Multimedia. Academy and Industry Research Collaboration Center (AIRCC), 2023. http://dx.doi.org/10.5121/csit.2023.130908.
Full textAbstract:
Deuterium is a protocol for instant messaging that allows users to join a channel, securely exchange messages, and rotate the group key for security purposes. When a user wants to join a channel, they must first send their public key, wallet address, and a digital signature to verify their identity. If the user's identity is successfully verified, the channel’s creator will perform an elliptic Elliptic Curve Diffie-Hellman key exchange with the user using curve25519,generating a group key for encrypting messages in the channel. The group key is periodically rotated for security purposes. Users can send messages to the channel by encrypting them with the X25519-XSalsa-Poly1305 algorithm, including a Galois Message Authentication Code instead of an index after keys are exchanged, and attaching a digital signature to verify the authenticity of the message. The protocol also includes a "Termination event" for handling errors or exceptions that may occur during key exchange or message exchange.
Reports on the topic "Elliptic Curve Diffie-Hellman Algorithm (ECDHA)"
1
Housley, R. Use of the Elliptic Curve Diffie-Hellman Key Agreement Algorithm with X25519 and X448 in the Cryptographic Message Syntax (CMS). RFC Editor, 2018. http://dx.doi.org/10.17487/rfc8418.
Full text