On the security of server-aided RSA protocols
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 99-116
- https://doi.org/10.1007/bfb0054018
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Attacks on Protocols for Server-Aided RSA ComputationPublished by Springer Nature ,2001
- Lower Bounds for Discrete Logarithms and Related ProblemsLecture Notes in Computer Science, 1997
- Algorithms for Black-Box Fields and their Application to CryptographyLecture Notes in Computer Science, 1996
- Improving Implementable Meet-in-the-Middle Attacks by Orders of MagnitudeLecture Notes in Computer Science, 1996
- Security and Performance of Server-Aided RSA Computation ProtocolsLecture Notes in Computer Science, 1995
- Fast Server-Aided RSA Signatures Secure Against Active AttacksLecture Notes in Computer Science, 1995
- Complexity of a determinate algorithm for the discrete logarithmMathematical Notes, 1994
- On verifiable implicit asking protocols for RSA computationLecture Notes in Computer Science, 1993
- The number field sievePublished by Association for Computing Machinery (ACM) ,1990
- On The Complexity Of Matrix Group Problems IPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984