Public key cryptography

International Journal of Psychosocial Rehabilitation

Cryptography plays a vital role in securing data for IT infrastructure by enabling an adequate level of security to the business. The increased significance of security in the IT infrastructure has raised the demand for public key cryptography. Public key cryptography eliminates the primary concern in private key cryptography, i.e. exchanging the key between the sender and the receiver by having a pair of keys. Public key cryptography enables the exchange of the key even in an unsecured network. After the introduction of public key cryptography, this type of cryptography is the best solution in securing the transmitted data between the sender and the receiver. However, there are vulnerabilities in this type of cryptography that both the sender and the receiver need to know. This research is focused on determining the vulnerabilities of public key cryptography. It also emphasizes how security specialists can overcome these vulnerabilities in public key cryptography.

IEEE Access

Nowadays, enormous data is being generated by the interconnected digital world, and the need to secure data is highly demanding. Advancement in technologies and new innovative methods applied by the attackers play an instrumental role in breaching data security. Public key Cryptography provides a set of cryptographic algorithms in achieving data security through confidentiality, integrity and authentication. Among all cryptographic algorithms in general and public key cryptography in particular, RSA is one of the most widely used and applied algorithms. Since its inception, it is commonly being adopted in securing data across different domains such as cloud, image etc. Despite its importance and wide application, no such systematic and extensive survey exists in the literature. A systematic and thorough study of RSA based cryptography is presented in this work covering several domains. All the available works in this direction are divided into 11 different categories, viz, Hybrid, Parallel, Cloud, Image, Multiple-Keys, Chinese-Remainder-Theorem-based, Digital-Signatures, K-Nearest-Theorem-based, Batch, Wireless, and Core-Modifications. This study aims to explore RSA-based cryptosystems, either modifications in core RSA or application of enhanced RSA across different domains, systematically categorizing in various categories and eventually providing finding and indications. As a result, this study will guide researchers and practitioners in understanding the past and present status of RSA cryptography and the possibility of its applications in other domains.

IEEE Transactions on Information Theory, 1980

Rivest, Shamir, and Adfeman (RSA) public-key encryp-tionalgorithmcanbebrdreniftheintegerRusedssthemoduluscanbe factored. It may however be possible to brew& this system witbuut factoring R. A modification of the. RSA scheme is described. For this modified version it is shown that, if the encryption procedure can be broken in a awtain number of operatfons, then R can be factored in only a few more operations. Fwthermorq this technique can also be used to produce digital signa~inmucbtbesamecmanne rastheRSAs&eme.

2003

This memo represents a republication of PKCS #1 v2.1 from RSA Laboratories' Public-Key Cryptography Standards (PKCS) series, and change control is retained within the PKCS process. The body of this document is taken directly from the PKCS #1 v2.1 document, with certain corrections made during the publication process. Table of Contents 1. Introduction.

Viele haben auf die eine oder andere Weise dazu beigetragen, dass diese Dissertation so entstehen konnte, wie sie nun vorliegt. Der Versuch einer vollständigen Aufzählung müsste scheitern; hier seien zunächst die erwähnt, die nicht mit Namen genannt werden können, weil sie als anonyme Gutachter für Konferenzen tätig waren und dabei Anregungen zur Darstellung einiger der hier präsentierten Ergebnisse beigetragen haben. Außerdem zu nennen ist David Hopwood, der in einer früheren Fassung der Ausführungen zur beweisbaren Sicherheit des Mix-Verfahrens (hier in Abschnitt 4.2) eine Lücke aufgespürt hat. Prof. Johannes Buchmann hat es auf bemerkenswerte Weise verstanden, die Arbeitsbedingungen zu schaffen, in denen diese Dissertation gedeihen konnte, und hat wertvolle Anregungen geliefert. Auch alle anderen am Fachgebiet Theoretische Informatik hatten teil daran, eine angenehme und fruchtbare Arbeitsatmosphäre zu schaffen. Danke!

This paper provides an overview of the RSA algorithm, exploring the foundations and mathematics in detail. It then uses this base information to explore issues with the RSA algorithm that detract from the algorithms security.

IRJMETS, 2020

There are many aspects in which security can be provided, even many applications too like secure payments, private communications. One such indispensable aspect is Cryptography. Though it's probably the oldest art, still the techniques used in Cryptography are a crucial means in achieving security. It not only clinches in making information restricted but also delivers various protection and security features like system security, digital signatures. So, the methods, encryption, and decryption of cryptography play a vital role in achieving the security mentioned above. The quality of the security provided will be entirely dependent on the quality of the encryption and decryption algorithms which in turn can be said to be based on the structure of mathematics and the confidentiality of key. The key can be said as the essence of encryption, as by knowing the key a person can encrypt or decrypt the information. Hence, choosing the key is the most vital process. This paper provides an overview and implementation of RSA, a public-key cryptosystem.

Algebra for Cryptologists, 2016

In this chapter we describe, at an elementary level, some of the applications of the Group Theory and Number Theory we have developed so far to Cryptology. We emphasise that these "textbook versions" of the applications do not do justice to the complexities that arise in practice, and warn the reader that implementing the mechanisms that we discuss in the form given here would lead to severe vulnerabilities of the schemes. 1 The reader is encouraged to start by reading the paper on Why textbook ElGamal and RSA encryption are insecure. 2 Our discussion falls into two components: in the first we exploit the difficulty of factoring integers into their prime factors. In the second we use large cyclic groups in order to establish secrets known only to the participating parties. 1 And if those sentences read like just another of those painful "Disclaimers" one finds everywhere, I apologise.

2011

In this paper we introduce an approach which is more secure than original RSA algorithm, which is used for digital signatures and encryption in public key cryptography. This approach eliminates the need to transfer n, the product of two random but essentially big prime numbers, in the public key due to which it becomes difficult for the intruder to guess the factors of n and hence the encrypted message remains safe from the hackers. Thus this approach provides a more secure path for transmission and reception of messages through public key cryptography.

Information is a valuable asset and must be kept confidential, have integrity and be available in order to be worth its name and be credible. Therefore in a bid to ensure this, strong mathematical algorithms, that involve the use of a pair of keys which are different from one another (public and private) like the ones that are used by RSA and CISCO to mention but a few, are employed and used in the processes of data encryption and decryption. This system of using two keys, one public and the other private that are different but mathematically related, to secure information has given rise to the concept of Public Key Cryptography; a concept that attempts to use key management in ensuring the security of information and data against hacker's attacks while both in storage and moving over the internet from one place to another. This paper thus, sets out to analyze the working of the public key cryptography and find ways in which it can be improved to give better information security.