Mats Näslund. All Bits ax+b mod p are Hard (Extended Abstract). In Neal Koblitz, editor, Advances in Cryptology - CRYPTO 96, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 1996, Proceedings. Volume 1109 of Lecture Notes in Computer Science, pages 114-128, Springer, 1996. [doi]
Abstract is missing.