This text introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. They are based on b... » 

This text introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. They are based on bounds of character sums and number solutions of some polynomial equations over finite fields and residue rings. «