Results 271 to 280 of about 84,134 (310)
Some of the next articles are maybe not open access.
2003
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 ...
+4 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 ...
+4 more sources
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 +2 more sources
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 +2 more sources
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
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
1999
Today’s widespread use of electronic networks in the economic world has raised cryptography from a speciality of the military and secret services to a topic of public interest, which concerns international organisations like the UNO ([UNCITRAL, 1998a] and [UNCITRAL, 1998b]) and the EU ([Commission of the European Communities, 1998]).
openaire +2 more sources
Today’s widespread use of electronic networks in the economic world has raised cryptography from a speciality of the military and secret services to a topic of public interest, which concerns international organisations like the UNO ([UNCITRAL, 1998a] and [UNCITRAL, 1998b]) and the EU ([Commission of the European Communities, 1998]).
openaire +2 more sources
2018
In this short chapter, we talk a bit about cryptography. First, we discuss some classical sorts of private key methods, and their limitations in the modern world. We then look at the first public key cryptographic method.
openaire +1 more source
In this short chapter, we talk a bit about cryptography. First, we discuss some classical sorts of private key methods, and their limitations in the modern world. We then look at the first public key cryptographic method.
openaire +1 more source
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
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
Cancer treatment and survivorship statistics, 2022
Ca-A Cancer Journal for Clinicians, 2022Kimberly D Miller +2 more
exaly