The Bit Security of Modular Squaring given Partial Factorization of the Modulos
- 1 December 2000
- book chapter
- Published by Springer Nature
- p. 448-457
- https://doi.org/10.1007/3-540-39799-x_35
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Efficient And Secure Pseudo-Random Number GenerationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial InformationPublished by Springer Nature ,2000
- Verifiable secret sharing and achieving simultaneity in the presence of faultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- On the cryptographic security of single RSA bitsPublished by Association for Computing Machinery (ACM) ,1983
- Why and how to establish a private code on a public networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A modification of the RSA public-key encryption procedure (Corresp.)IEEE Transactions on Information Theory, 1980
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976