1 question

Tagged

modular_equation×

16k

views

answer

votes

2025-08-31 19:13:52 +0200 Periodic_1_6

How does sagemath solve Xab+Ya+Yb+Z mod N = 0 knowing X,Y,Z,N without factoring N? Is there a computationally efficient way to solve this?

modular_equation

Contributors

Tags

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.

1 question

How does sagemath solve X*a*b+Y*a+Y*b+Z mod N = 0 knowing X,Y,Z,N without factoring N? Is there a computationally efficient way to solve this?

Contributors

Tags

How does sagemath solve Xab+Ya+Yb+Z mod N = 0 knowing X,Y,Z,N without factoring N? Is there a computationally efficient way to solve this?