Results 281 to 290 of about 80,772 (303)
Some of the next articles are maybe not open access.
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 +2 more sources
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 +2 more sources
, 1988 In modern day communication systems the conventional cryptosystems turned out to have two disturbing disadvantages.
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 +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
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 +2 more sources
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 +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 +2 more sources
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 +2 more sources
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
2003
The problem of key distribution has been mentioned many times in this book. For many years it was strongly believed that this problem has no satisfactory solution, but in the 1970s, an ideal, simple solution was found and has since become the foundation upon which much of modern cryptography is based.
openaire +2 more sources
The problem of key distribution has been mentioned many times in this book. For many years it was strongly believed that this problem has no satisfactory solution, but in the 1970s, an ideal, simple solution was found and has since become the foundation upon which much of modern cryptography is based.
openaire +2 more sources
Public-Randomness in Public-Key Cryptography
1991In 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 ...
Giuseppe Persiano, Alfredo De Santis
openaire +2 more sources
A tutorial on public key cryptography
Computers & Security, 1982Abstract Public key cryptography provides the means for establishing instantaneous, secure communication between any two persons or any two computers. The prior exchange of a secret quantity, called the cryptographic key, is not necessary. In this paper, the underlying mathematical principles of public key (PK) cryptography are informally introduced ...
openaire +2 more sources