Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition

Conference paper

DOI: 10.1007/978-1-4614-6642-0_4

Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 43)
Cite this paper as:
Bibak K. (2013) Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition. In: Borwein J., Shparlinski I., Zudilin W. (eds) Number Theory and Related Fields. Springer Proceedings in Mathematics & Statistics, vol 43. Springer, New York, NY


Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define—perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which are used there. One might say that additive combinatorics is a branch of mathematics concerning the study of combinatorial properties of algebraic objects, for instance, Abelian groups, rings, or fields. This emerging field has seen tremendous advances over the last few years and has recently become a focus of attention among both mathematicians and computer scientists. This fascinating area has been enriched by its formidable links to combinatorics, number theory, harmonic analysis, ergodic theory, and some other branches; all deeply cross-fertilize each other, holding great promise for all of them! In this exposition, we attempt to provide an overview of some breakthroughs in this field, together with a number of seminal applications to sundry parts of mathematics and some other disciplines, with emphasis on computer science and cryptography.

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of Combinatorics and OptimizationUniversity of WaterlooWaterlooCanada

Personalised recommendations