Computer Science, Cryptography.
groups. The multiplicative group of powers 2’s would look like: Cryptography is primarily concerned with bounded groups. A group is said to be bounded when its elements are constrained within a given range. An example of a bounded group is the additive group mod a number n, denoted as (Z/nZ).