A low complexity probabilistic test for integer multiplication

A probabilistic test for equality a=bca=bc for given nn-bit integers a,b,ca,b,c is designed within complexity n(loglogn)exp{O(log∗n)}n(loglogn)exp{O(log∗n)}.