Which new RSA-signatures can be computed from certain given RSA-signatures?
- 1 January 1992
- journal article
- research article
- Published by Springer Nature in Journal of Cryptology
- Vol. 5 (1) , 41-52
- https://doi.org/10.1007/bf00191320
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic CashPublished by Springer Nature ,2001
- A Secure and Privacy-Protecting Protocol for Transmitting Personal Information Between OrganizationsPublished by Springer Nature ,2000
- N Using RSA with Low Exponent in a Public Key NetworkPublished by Springer Nature ,2000
- Efficient Offline Electronic ChecksPublished by Springer Nature ,1990
- Cryptographic solution to a problem of access control in a hierarchyACM Transactions on Computer Systems, 1983
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- On factorisation, with a suggested new approachMathematics of Computation, 1975
- Approximate formulas for some functions of prime numbersIllinois Journal of Mathematics, 1962