A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Survey on Asymmetric Key Cryptographic Algorithms
2020
International Journal of Scientific Research in Science Engineering and Technology
Preserved Fulltext
In this paper, certain asymmetric key algorithms such as RSA, Rabin, Diffie-Hellman, ElGamal and Elliptical curve cryptosystem, their security aspects and the processes involved in design and implementation ...
The public key is used for encryption and the private key is used for decryption. ...
Fig. 5 . 5 Diffie -Hellman Cryptosystem Diffie -Hellman is vulnerable to man-in-the-middle attack. E. ...
doi:10.32628/ijsrset207292
fatcat:zfeqwmby3nc4zpglaqs4se6rw4
A survey of encryption standards
1993
IEEE Micro
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In its broadest sense cryptography addresses a number of practical problems: Burt Kaliski RSA Laboratories confidentiality, keeping messages secret; origin authentication, verlfying a message's source; ...
This survey discusses the standards and their algorithms, how they compare, how they e r , and where they're headed. ryptography is the science, or some would say the art, of secret codes. ...
Because the encryption and decryption keys in a public-key cryptosystem differ, such systems are often called asymmetric in the literature. The idea comes from Diffie and Hellman." ...
doi:10.1109/40.248057
fatcat:pio7rznzbneytnuxsrrd5mne4e
Secure Hybrid Crypto-system AES/RSA on FPGA for Data Communication
2020
Malaysian Journal of Computing and Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The security of client-server communication is ensured by the AES protocol and the Diffie-Hellman key exchange protocol. ...
To offer a good management of keys and their sharing, a dedicated system for generating keys is designed to fit with public key infrastructures. ...
ACKNOWLEDGEMENT The authors would like to thank the Directorate General for Scientific Research and Technological Development of Algeria for funding this work through research. ...
doi:10.37231/myjcam.2020.3.1.38
fatcat:km62hkfqjbhb5hlv62c43kqgue
Encryption and decryption techniques for video data: a survey
[chapter]
2015
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The current paper analyses the available tools, techniques and a few selected algorithms for encryption and decryption. ...
and decryption. ...
It is based on a problem related to discrete logarithms, namely the Diffie-Hellman problem. This problem is considered hard, and it is in some instances as hard as the discrete logarithm problem. ...
doi:10.5281/zenodo.4383715
fatcat:t3qfbbogz5glzjesbvgr2btnle
Fast generators for the Diffie–Hellman key agreement protocol and malicious standards
2006
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The Diffie-Hellman key agreement protocol is based on taking large powers of a generator of a prime-order cyclic group. Some generators allow faster exponentiation. ...
On the other hand, we show that if there is some case in which fast generators are less secure, then this could be used by a malicious authority to generate a standard for the Diffie-Hellman key agreement ...
We thank Steven Galbraith and Alfred Menezes for their useful comments. ...
doi:10.1016/j.ipl.2005.11.025
fatcat:p35atwh3bfhf3hvzyrx3j37tle
Cryptography: A Comparison of Public Key Systems
2013
Algorithms Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
These are cryptosystems which allow any user, completely unaware of the methods of encryption and decryption, i.e. of the intricate details of the system, to use them for variety of purposes in their daily ...
This examinat ion includes an in-depth look at: the RSA algorithm, the Diffie-Hellman key exchange protocol, the elliptic curve cryptosystems, the ElGamal encryption method and the knapsack approach. ...
Andrew Twizell would like to acknowledge the help and support of Dr. Vassilev during the work on this paper. ...
doi:10.5923/j.algorithms.20120105.01
fatcat:67b3nojgznhdvktslc7cx6dpr4
Elliptic Curve Cryptosystem in securing Communication across Unsecure Channel
2017
Circulation in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The basisof using ECC is because there is no known technique of finding solution of discrete logarithm problem, in a reasonable time, on a properly chosen elliptic curve. ...
With the rapid grow of internet technology and increasing computational power of computer, securing privilege information against unauthorized access is a source of concern to the business managers. ...
large prime numbers while the Diffie-Hellman approach is based on finding the log of a number mod p of discrete logarithm problem for finite groups, which has been proven to be very difficult. ...
doi:10.22632/ccs-2017-251-97
fatcat:nls3tr2uvzhnxh4o3scd7k75ly
MaTRU: A New NTRU-Based Cryptosystem
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
MaTRU works under the same general principles as the NTRU cryptosystem, except that it operates in a different ring with a different linear transformation for encryption and decryption. ...
In this paper, we propose a new variant of the NTRU public key cryptosystem − the MaTRU cryptosystem. ...
The hard problem underlying this cryptosystem is related to finding short vectors in a lattice due to the properties of short polynomials used in the system [2, 16, 20] . ...
doi:10.1007/11596219_19
fatcat:vl7do4gqcrertosivesnathuli
Key management for large scale end-to-end encryption
1994
Proceedings of IEEE International Carnahan Conference on Security Technology CCST-94
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
manner of Diffie-Hellman. ...
(This is the same point made by Diffie and Hellman
Each confidant participating in this system must generate a pair of keys (one private, one public) suitable for use with the Digital Signature Standard ...
doi:10.1109/ccst.1994.363791
fatcat:oyc7iqflibg45ejlnfyohhlaqa
Chaotic-Based Public Key Cryptosystem for PGP Protocol
2013
International Conference on Aerospace Sciences and Aviation Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The new chaotic key exchange protocol is evaluated against the Diffie-Hellman elliptic curve cryptosystem (DHECC). ...
The large prime numbers is considered a big problem in public key cryptosystem. The chaotic public key cryptosystem is new trend in cryptography. ...
Asymmetric algorithms such as (RSA) [5] and Diffie-Hellman [6] . The security of a symmetric algorithm is based on the security of the key. The key is used for both encryption and decryption. ...
doi:10.21608/asat.2013.22102
fatcat:nhn2a4z7ezgsxowmyvsf5h6hjy
Symmetric Subgroup Membership Problems
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We define and discuss symmetric subgroup membership problems and their properties, including a relation to the Decision Diffie-Hellman problem. ...
We modify the Cramer-Shoup framework, so that we can derive a chosen ciphertext secure cryptosystem in the standard model from symmetric subgroup membership problems. ...
The main result of the theoretic discussion is a relation between the Decision Diffie-Hellman problem and the symmetric subgroup membership problem. ...
doi:10.1007/978-3-540-30580-4_8
fatcat:ehxsphcoivcdbdkwatse6f75b4
New Approach for CCA2-Secure Post-Quantum Cryptosystem Using Knapsack Problem
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Chosen-ciphertext security, which guarantees confidentiality of encrypted messages even in the presence of a decryption oracle, has become the defacto notion of security for public-key encryption under ...
Our construction is a precoding-based encryption algorithm and uses the knapsack problem to perform a permutation and pad some random fogged data to the message bits. ...
INTRODUCTION HE notion of public-key cryptography was introduced by Diffy and Hellman [18] and the ultimate goal of public-key encryption is the production of a simple and efficient encryption scheme ...
arXiv:1211.6984v5
fatcat:f6nucc7pfrblbetoso7h6awf2e
A Survey on Audit Free Cloud Storage via Deniable Attribute Based Encryption
2016
IRA-International Journal of Technology & Engineering (ISSN 2455-4480)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The TPA, who has expertise and abilities that users do not, can occasionally check the honesty of all the data stored in the cloud on behalf of the users, which provides a much more better and reasonable ...
While the storage space of shared data on remote servers is not a new development, current development of cloud computing validates a more careful look at its actual consequences involving privacy and ...
ABE is a new public key based one-tomany encryption that allows access control over encrypted data using access policies and ascribed attributes related with private keys and cipher texts the cryptosystem ...
doi:10.21013/jte.v5.n1.p1
fatcat:dvrueplzmjgynkv6johg6u2je4
Self-Escrowed Public-Key Infrastructures
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
In simple words, a self-escrowed public-key cryptosystem features the property that the scheme's public and private keys are connected to each other by the mean of an other cryptosystem, called the master ...
We apply this notion to the design of auto-recoverable autocertifiable cryptosystems, a solution to software key escrow due to Young and Yung, and provide a new cryptographic escrow system called selfescrowed ...
Acknowledgements The authors are grateful to Marc Joye for constructive comments and suggestions. We also thank the anonymous referees for useful comments. ...
doi:10.1007/10719994_20
fatcat:afkxlod25fbihhepq6d3tg32qi
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
provides security relative to RSA but also to the Diffie-Hellman problem or the factorization; 2. it is possible to integrate symmetric encryption (block and stream ciphers) to reach very high speed rates ...
paper presents REACT, a new conversion which applies to any weakly secure cryptosystem, in the random oracle model: it is optimal from both the computational and the security points of view. ...
Acknowledgements We thank Markus Jakobsson and Moti Yung for helpful discussions. Thanks also to the anonymous reviewers for their comments. ...
doi:10.1007/3-540-45353-9_13
fatcat:vo467se7d5ecrfik5eglsi7zou
« Previous
Showing results 1 — 15 out of 1,038 results