Cryptography
- 1 January 1990
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 72 references indexed in Scilit:
- A Provably Secure Oblivious Transfer ProtocolPublished by Springer Nature ,2000
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- How to Generate Factored Random NumbersSIAM Journal on Computing, 1988
- A fair protocol for signing contractsPublished by Springer Nature ,1985
- Key exchange using ‘keyless cryptography’Information Processing Letters, 1983
- Quantum Cryptography, or Unforgeable Subway TokensPublished by Springer Nature ,1983
- On Distinguishing Prime Numbers from Composite NumbersAnnals of Mathematics, 1983
- CryptographyPublished by Springer Nature ,1983
- An efficient algorithm for constructing a cryptosystem which is harder to break than two other cryptosystemsComputers & Mathematics with Applications, 1981
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970