Number theory in science and communication
Number theory in science and communication
An efficient probabilistic public key encryption scheme which hides all partial information
Proceedings of CRYPTO 84 on Advances in cryptology
RSA and Rabin functions: certain parts are as hard as the whole
SIAM Journal on Computing - Special issue on cryptography
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Stronger security proofs for RSA and rabin bits
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Credential Management Enforcement and Secure Data Storage in gLite
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
Onefundamental difference between the use of symmetric and publickey cryptosystems is that the former requires trust between senderand receiver. Typically they will share a secret key and neitherhas any protection from the other. However, many users are nowfinding that they want keys to be used for `one purpose only'and are relying on hardware functionality to introduce the conceptof unidirectional keys for symmetric algorithms. (So, for instance,the hardware functionality might ensure that a key used for encryptingmessages from user A to user B cannot be used for encryptingmessages in the opposite direction.) For public key systems thisconcept of unidirectional keys is automatically satisfied. However,when the encrypting key is made public, the exposure of thiskey means that the deciphering key is only safe from compromisewhen the keys are very large. If, on the other hand, both keyswere kept secret then it might be possible to use much smallerkeys. In this paper we investigate ways of using the primitivesof an RSA public key cryptosystem in a symmetric key `setting'i.e. where neither key is made public.