Results 201 to 210 of about 16,425,580 (227)

Public-Randomness in Public-Key Cryptography

1991
In this work we investigate the power of Public Randomness in the context of Public-key cryptosystems. We consider the Diffie-Hellman Public-key model in which an additional short random string is shared by all users. This, which we call Public-Key Public-Randomness (PKPR) model, is very powerful as we show that it supports simple non-interactive ...
Alfredo De Santis, Giuseppe Persiano
openaire   +1 more source

Public Key Cryptography in Action

Information Systems Security, 1994
(1994). Public Key Cryptography in Action. Information Systems Security: Vol. 3, No. 1, pp. 57-70.
openaire   +1 more source

Public key cryptography

1993
This paper deals with public key cryptosystems and some of their applications such as password encryption and digital signatures. The necessary mathematical background is also provided.
openaire   +2 more sources

Public-Key Cryptography

2010
In this chapter, we will explore some computational aspects of modular arithmetic, which we studied in Chapter 6. We will be concerned about how to compute certain numbers in a most efficient way. There is a whole field at work here, of which we barely scratch the surface, called computational complexity.
Matthias Beck, Ross Geoghegan
openaire   +1 more source

Public Key Cryptography

2021
In this chapter we will discuss public-key cryptography(PKC) and it’s various applications and its probable use. Limitations and disadvantages of symmetric-key cryptography(private-key cryptography) motivates the extensive use of public-key cryptography. Well known limitations are: Key exchange is a major problem in symmetric key cryptography. you
Satyanarayana Vollala, N. Ramasubramanian, Utkarsh Tiwari   +2 more
openaire   +1 more source

Public-Key Cryptography

Abstract The basic idea of public-key cryptography as a means for two untrusting parties to establish secure communication is outlined. The use of public-key cryptography to establish a key for a symmetric cryptosystem by using a protocol such as the Diffie-Hellman protocol or quantum key distribution (QKD) is explained. Two major public-
Eric L. F. Roettger, Hugh C. Williams
openaire   +2 more sources

Public-Key Cryptography

2008
Part I: Theory Provable security is an important goal in the design of public-key cryptosystems. For most security properties, it is computational security that has to be considered: an attack scenario describes how adversaries interact with the cryptosystem, trying to attack it; the system can be called secure if adversaries with reasonably bounded ...
Christiane Rousseau, Yvan Saint-Aubin
openaire   +2 more sources

The Public Key Cryptography

2003
A cryptographic system consists of a one to one enciphering transformation f from a set \(\mathcal{P}\) of plaintext message units to a set \(\mathcal{C}\) of ciphertext message units. For example, for a fixed N- letter alphabet, identified with ℤ/Nℤ, consider the mapping f : \(\mathcal{P}\) = ℤ/Nℤ → 𝑪 = ℤ/Nℤ given by f(P) = \(\mathcal{C}\) ≡ aP + b ...
openaire   +1 more source

Public key cryptography

Computer, 1996
The RSA algorithm can be used for a kind of unforgeable digital signature. In this application, the secret key is used to encrypt a message, which can then itself be decrypted by anyone possessing the public key. Digital signatures can play a role in many activities that do not require secrecy but require sender authentication and guaranteed message ...
openaire   +1 more source

Public key cryptography

XRDS: Crossroads, The ACM Magazine for Students, 2000
  +5 more sources