# Public-Key Cryptography

@inproceedings{Salomaa1996PublicKeyC, title={Public-Key Cryptography}, author={Arto Salomaa}, booktitle={Texts in Theoretical Computer Science. An EATCS Series}, year={1996} }

Public Key Cryptography Unlike symmetric key cryptography, we do not find historical use of public-key cryptography. It is a relatively new concept. Symmetric cryptography was well suited for organizations such as governments, military, and big financial corporations were involved in the classified communication. With the spread of more unsecure computer networks in last few decades, a genuine need was felt to use cryptography at larger scale. The symmetric key was found to be non-practical due…

## 51 Citations

A New Symmetric Key Encryption Algorithm Based on Jumbling Binary Sequence of Message

- Computer Science2018 International Conference on Advances in Computing and Communication Engineering (ICACCE)
- 2018

This paper is introducing a new symmetric key encryption algorithm that involves three steps decoding to obtain final encrypted data.

Public Key Cryptography with a Group of Unknown Order

- Computer Science, Mathematics
- 2000

Algorithms for digital signature generation and verification using public key cryptography over an arbitrary group G, similar to those of ElGamal, but do not require a knowledge of the group order.

Teaching Public-Key Cryptography in School

- Computer ScienceISSEP
- 2010

This work deals with the question of how to teach young students the main concepts, issues, and solutions of public-key systems without being forced to also teach rather complicated theorems of number theory beforehand.

Dual Encryption by Random Segmentation and Random Re-Arrangement (RSRA) using Two Dimensional Array

- Computer Science, Mathematics
- 2016

This paper proposes a new encryption technique with the help of random segmentation and random re-arrangement of cipher text using two dimensional array before transmission over communication channel so that the transmitted cipher text is more complex to decrypt by any attacker.

Time-Based Proxy Re-Encryption for User Revocation with Reduced UAKs in Cloud Storage

- Computer Science
- 2018

Time-based Proxy ReEncryption (PRE) scheme efficiently handles user revocation by re-encrypting the cipher text again at proxy server.

Review of primality testing and integer factorization in public key cryptography by Song Y. Yan

- Computer Science, MathematicsSIGA
- 2012

Although public key cryptography was discovered in the 1970s, it did not percolate through the mathematical community until much later, and it had some interesting side effects in mathematics.

A Survey of Key Management in Mobile Ad Hoc Networks

- Computer Science
- 2008

This article presents a survey of the research work on key management in MANETs according to recent literature and proposes a number of key management schemes for MANET security.

A new Cryptosystem based on Formal Language Theory

- Computer Science
- 2002

A classical cryptos system and a public-key cryptosystem are proposed, based on the passing from a string of production labels to the string generated by the grammar by a (leftmost) derivation with that given control word (thus obtaining the cyphertext).

Mental poker game based on a bit commitment scheme through network

- Computer ScienceComput. Networks
- 2002

Counting Functions to Generate The Primes in the RSA Algorithm and Diffie-Hellman Key Exchange

- Computer Science, Mathematics
- 2018

New construction of the RSA algorithm and DH key exchange is given using the primes p,q from areal number x using some arithmetical function.

## References

SHOWING 1-10 OF 201 REFERENCES

The first ten years of public-key cryptography

- Computer Science, Mathematics
- 1988

The discussion covers exponential key exchange, the trap-door knapsack public-key cryptosystem, the Rivest-Shamir-Adleman (RSA) system, and the breaking of theknapsack cryptos system.

Multiuser cryptographic techniques

- Computer Science, MathematicsAFIPS '76
- 1976

It is shown how such a public key cryptosystem would allow the development of an authentication system which generates an unforgeable, message dependent digital signature.

Public key vs. conventional key encryption*

- Computer Science1979 International Workshop on Managing Requirements Knowledge (MARK)
- 1979

An innovative approach to encryption, called public key algorithms, has recently been proposed as a way to address many of the key distribution and other problems which are present in conventional algorithm-based approaches.

Algorithms for Public Key Cryptosystems: Theory and Application

- Computer Science, MathematicsAdv. Comput.
- 1983

Symmetric and Asymmetric Encryption

- Computer ScienceCSUR
- 1979

This paper opens with a brmf dmcussion of encryptmn principles and then proceeds to a comprehensive discussion of the asymmetric encryptmn/decryp tion channel and its application m secure communmations.

Relativized cryptography

- Computer Science, Mathematics20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
- 1979

The main result presented here is the existence of a relativized model of computation under which there exists a provably secure transientkey cryptosystem.

Digital signatures: A tutorial survey

- Computer Science, MathematicsComputer
- 1983

This article on digital signature schemes is a survey of work done in the area since the concept was introduced in 1976.

An introduction to contemporary cryptology

- Computer Science, Mathematics
- 1988

An appraisal is given of the current status of cryptologic research and the principal concepts of both secret-key and public-key cryptography are described.

On the security of public key protocols

- Computer Science22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
- 1981

Several models are formulated in which the security of protocols can be discussed precisely, and algorithms and characterizations that can be used to determine protocol security in these models are given.

A modification of the RSA public-key encryption procedure (Corresp.)

- Computer Science, MathematicsIEEE Trans. Inf. Theory
- 1980

For this modified version of the RSA scheme, it is shown that, if the encryption procedure can be broken in a certain number of operations, then R can be factored in only a few more operations.