Results 211 to 220 of about 5,171 (251)
Some of the next articles are maybe not open access.
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 +2 more sources
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 +2 more sources
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 +1 more source
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 +1 more source
2002
The basic idea of public-key cryptography are public keys. Each person’s key is separated into two parts: a public key for encryption available to everyone and a secret key for decryption which is kept secret by the owner. In this chapter we introduce the concept of public-key cryptography.
Hans Delfs, Helmut Knebl
openaire +2 more sources
The basic idea of public-key cryptography are public keys. Each person’s key is separated into two parts: a public key for encryption available to everyone and a secret key for decryption which is kept secret by the owner. In this chapter we introduce the concept of public-key cryptography.
Hans Delfs, Helmut Knebl
openaire +2 more sources
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 +2 more
openaire +1 more source
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 +2 more
openaire +1 more source
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
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 Complexity of Public-Key Cryptography
2017We survey the computational foundations for public-key cryptography. We discuss the computational assumptions that have been used as bases for publickey encryption schemes, and the types of evidence we have for the veracity of these assumptions.
openaire +3 more sources
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
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
2009
This chapter contains sections titled: Introduction This chapter contains sections titled: Cryptosystems and Cryptanalysis Key Management Digital Signatures and Hash Functions Examples of Public Key Systems and Hash Functions Implementations of Public Key Cryptography A Sample Proposal for a LAN ...
openaire +1 more source
This chapter contains sections titled: Introduction This chapter contains sections titled: Cryptosystems and Cryptanalysis Key Management Digital Signatures and Hash Functions Examples of Public Key Systems and Hash Functions Implementations of Public Key Cryptography A Sample Proposal for a LAN ...
openaire +1 more source
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
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