Results 1 to 10 of about 5,156 (239)
, 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 +3 more sources
Some of the next articles are maybe not open access.
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.
Helmut Knebl, Hans Delfs
openaire +4 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.
Helmut Knebl, Hans Delfs
openaire +4 more sources
2006
Non-secret encryption Until relatively recently cryptosystems were always symmetric. They relied on the use of a shared secret key known to both sender and receiver. This all changed in the 1970s. Public key cryptosystems, as they are now called, revolutionised the theory and practice of cryptography by relying for their impenetrability on the ...
John Talbot, Dominic Welsh
openaire +3 more sources
Non-secret encryption Until relatively recently cryptosystems were always symmetric. They relied on the use of a shared secret key known to both sender and receiver. This all changed in the 1970s. Public key cryptosystems, as they are now called, revolutionised the theory and practice of cryptography by relying for their impenetrability on the ...
John Talbot, Dominic Welsh
openaire +3 more sources
AT&T Technical Journal, 1994
This article explains public key cryptography, its benefits and limitations.
openaire +2 more sources
This article explains public key cryptography, its benefits and limitations.
openaire +2 more sources
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
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
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