Nigel P. Smart – författare

Since the appearance of the authors' first volume on elliptic curve cryptography in 1999 there has been tremendous progress in the field. In some topics, particularly point counting, the progress has been spectacular. Other topics such as the Weil and Tate pairings have been applied in new and important ways to cryptographic protocols that hold great promise. Notions such as provable security, side channel analysis and the Weil descent technique have also grown in importance. This second volume addresses these advances and brings the reader up to date. Prominent contributors to the research literature in these areas have provided articles that reflect the current state of these important topics. They are divided into the areas of protocols, implementation techniques, mathematical foundations and pairing based cryptography. Each of the topics is presented in an accessible, coherent and consistent manner for a wide audience that will include mathematicians, computer scientists and engineers.

Beginning with a brief introduction to algorithms and diophantine equations, this volume aims to provide a coherent account of the methods used to find all the solutions to certain diophantine equations, particularly those procedures which have been developed for use on a computer. The study is divided into three parts, the emphasis throughout being on examining approaches with a wide range of applications. The first section considers basic techniques including local methods, sieving, descent arguments and the LLL algorithm. The second section explores problems which can be solved using Baker's theory of linear forms in logarithms. The final section looks at problems associated with curves, mainly focusing on rational and integral points on elliptic curves. Each chapter concludes with a useful set of exercises. A detailed bibliography is included. This book will appeal to graduate students and research workers, with a basic knowledge of number theory, who are interested in solving diophantine equations using computational methods.

Beginning with a brief introduction to algorithms and diophantine equations, this volume aims to provide a coherent account of the methods used to find all the solutions to certain diophantine equations, particularly those procedures which have been developed for use on a computer. The study is divided into three parts, the emphasis throughout being on examining approaches with a wide range of applications. The first section considers basic techniques including local methods, sieving, descent arguments and the LLL algorithm. The second section explores problems which can be solved using Baker's theory of linear forms in logarithms. The final section looks at problems associated with curves, mainly focusing on rational and integral points on elliptic curves. Each chapter concludes with a useful set of exercises. A detailed bibliography is included. This book will appeal to graduate students and research workers, with a basic knowledge of number theory, who are interested in solving diophantine equations using computational methods.

This book constitutes the refereed proceedings of the 18th International Conference on Cryptology in India, INDOCRYPT 2017, held in Chennai, India, in December 2017.