Primality and cryptography
Recognizing primes in random polynomial time
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Algorithmics: theory & practice
Algorithmics: theory & practice
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Riemann's hypothesis and tests for primality
Journal of Computer and System Sciences
| Hi-index | 0.00 |