How to Break the Direct RSA-Implementation of Mixes
- 18 May 2001
- book chapter
- Published by Springer Nature
- p. 373-381
- https://doi.org/10.1007/3-540-46885-4_37
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial InformationPublished by Springer Nature ,2000
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- The dining cryptographers problem: Unconditional sender and recipient untraceabilityJournal of Cryptology, 1988
- A chosen text attack on the RSA cryptosystem and some discrete logarithm schemesPublished by Springer Nature ,1986
- Attacks on Some RSA SignaturesPublished by Springer Nature ,1986
- Security without identification: transaction systems to make big brother obsoleteCommunications of the ACM, 1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Digital signatures with RSA and other public-key cryptosystemsCommunications of the ACM, 1984
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981