Results 291 to 300 of about 511,689 (360)
Some of the next articles are maybe not open access.
A Survey on Post-Quantum Public-Key Signature Schemes for Secure Vehicular Communications
IEEE transactions on intelligent transportation systems (Print), 2022Basic security requirements such as confidentiality, user authentication and data integrity, are assured by using public-key cryptography (PKC). In particular, public-key signature schemes provide non-repudiation, integrity of transmitted messages and ...
Kyung-Ah Shim
semanticscholar +1 more source
Survey on Issues and Recent Advances in Vehicular Public-Key Infrastructure (VPKI)
IEEE Communications Surveys and Tutorials, 2022Public-key infrastructure (PKI) provides the essential foundation for public-key cryptography, and security is often bootstrapped from a PKI. Standardization bodies, organizations, researchers, and experts reached a consensus that deploying Vehicular PKI
Salabat Khan +5 more
semanticscholar +1 more source
2005
Secure transmission of private information is a crucial issue in today’s highly computerized world. Cryptographic algorithms are used to provide privacy of message transmission and to certify authenticity of sender and/or receiver of a message and message integrity as well as undeniability of transmitted messages (Menezes et al., 1996).
Paul Garrett, Daniel Lieman
openaire +4 more sources
Secure transmission of private information is a crucial issue in today’s highly computerized world. Cryptographic algorithms are used to provide privacy of message transmission and to certify authenticity of sender and/or receiver of a message and message integrity as well as undeniability of transmitted messages (Menezes et al., 1996).
Paul Garrett, Daniel Lieman
openaire +4 more sources
2011
This chapter presents an asymmetric approach to cryptography – it uses different keys for encryption and decryption. The key for encryption is announced publically so that everybody can encode a message. Only the owner of the matching secret key can decode the encrypted message.
Dirk Bongartz, Walter Unger
openaire +4 more sources
This chapter presents an asymmetric approach to cryptography – it uses different keys for encryption and decryption. The key for encryption is announced publically so that everybody can encode a message. Only the owner of the matching secret key can decode the encrypted message.
Dirk Bongartz, Walter Unger
openaire +4 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 +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
Introduction to Public-Key Cryptography
2005In this chapter we introduce the basic building blocks for cryptography based on the discrete logarithm problem that will constitute the main motivation for considering the groups studied in this book. We also briefly introduce the RSA cryptosystem as for use in practice it is still an important public-key cryptosystem.
Roberto Avanzi, Tanja Lange
openaire +3 more sources
, 1988 In modern day communication systems the conventional cryptosystems turned out to have two disturbing disadvantages.
openaire +1 more source
Public key versus symmetric key cryptography in client–server authentication protocols
International Journal of Information Security, 2021An Braeken
semanticscholar +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 +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