mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 5 of 5
Search took 0.00 seconds.
Search: Posts Made By: charybdis
Forum: Factoring 2021-06-29, 00:27
Replies: 17
Views: 1,473
Posted By charybdis
I don't think this is going to work. The change...

I don't think this is going to work. The change from y to y2 will make the algorithm run differently, so e2 will probably look nothing like e1 apart from having the same general structure of lots of...
Forum: Factoring 2021-06-28, 16:55
Replies: 17
Views: 1,473
Posted By charybdis
It's a feature, not a limitation. The problem...

It's a feature, not a limitation. The problem reduces to solving a system of simultaneous linear equations with respect to different moduli. The number of equations is determined by x, and since each...
Forum: Factoring 2021-06-28, 00:51
Replies: 17
Views: 1,473
Posted By charybdis
This is doable as the prime factors are all...

This is doable as the prime factors are all small. I thought this might be hard to program but it turns out PARI has some helpful functions:...
Forum: Factoring 2021-06-27, 21:04
Replies: 17
Views: 1,473
Posted By charybdis
Ah, this completely changes the nature of the...

Ah, this completely changes the nature of the problem. Brute force has no chance of working when x and y are this large. If x is prime, then even if we are told that for a given p there exists e such...
Forum: Factoring 2021-06-25, 23:19
Replies: 17
Views: 1,473
Posted By charybdis
What's really being asked here is whether y is in...

What's really being asked here is whether y is in the subgroup of the multiplicative group of Z/xZ generated by the set P - and, if so, how to find an expression for y as a product of elements of P....
Showing results 1 to 5 of 5

 
All times are UTC. The time now is 22:55.


Mon Dec 6 22:55:35 UTC 2021 up 136 days, 17:24, 1 user, load averages: 1.59, 1.68, 1.67

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.