In starting to look into the mathematical side of encryption , I note the heavy dependence upon modular arithmetic. What is the advantage is this? For example, why are finite cyclic groups and rings preferable? Note: I know zilch about programming; I am approaching it from the mathematical side.(adsbygoogle = window.adsbygoogle || []).push({});

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# The advantage of modular arithmetic, e.g. cyclic groups?

Loading...

Similar Threads - advantage modular arithmetic | Date |
---|---|

C/++/# Is my code suffering from an arithmetic error? | Feb 25, 2017 |

Are there any advantages of BitBucket over GitHub? | Sep 5, 2011 |

Is it possible to take advantage of a multicore processor for fortran? | Oct 13, 2009 |

Modular multiplication problem in C | Aug 29, 2008 |

Modular Multiplication | Dec 29, 2006 |

**Physics Forums - The Fusion of Science and Community**