Hello all, I am currently writing a program where I need to find a generator in VERY large modular prime systems, where p can be anywhere up to 2^1024. Is there an efficent (i.e. hopefully polynomial time on the number of bits) way to do this? For example, the current system I am working in is modulo 177230489166282344015774064377241227587199382967408813262382504707219711331089796381062272830832589652763240077045179410289089586103444172644783259989800867240412448988509325574574304033723512809384370865286355935760236734502077616148946269402098233368030784437031602201910267514742358461638753758087223301499. I am wondering how long it would take to find a generator on a modern system . . .(adsbygoogle = window.adsbygoogle || []).push({});

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

Join Physics Forums Today!

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

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

# Generators of Modular Prime Systems

Loading...

Similar Threads for Generators Modular Prime | Date |
---|---|

I SU(2) generators | Jul 28, 2017 |

A Valence formula- fundamental domain- why truncation height? | May 7, 2017 |

I ##SU(2)## generators in ##1##, ##2## and ##3## dimensions | Mar 16, 2017 |

I Rings Generated by Elements - Lovett, Example 5.2.1 ... ... | Feb 16, 2017 |

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