Is there any literature/survey/papers/books regarding the factorization of Strong PseudoPrimes (wrt. to a given base). I am aware of the fact that weak Pseudo Primes can be factorized in Polynomial time. But, I was unable to get anything significant/detailed regarding Strong PseudoPrime factorization (I am aware the general Problem is considered hard), but I am looking for much more detailed analysis of the subsets that are easy (factorizable in polynomial time, sub exponential time etc.) rather than this blanket generalization.
Reference Request: Factorization of PseudoPrimes?
algorithms;reference request;primes