Ask Your Question
0

Generating two integers with conditions

asked 2024-06-23 01:40:07 +0100

hamouda gravatar image

Let $\phi=1103481364240094378710324387523817552607307673089944349316644000826050949$ and $N=1050467212358431669174928621845479661$. I want to generate an integer $e=N^{\alpha}$ of $59$ bits and an integer $d=N^{\delta}$ satisfying $ed\equiv 1\bmod \phi$ and $\delta<2-\sqrt{\alpha}.$ How to do this rapidly ?

edit retag flag offensive close merge delete

Comments

Is $\alpha$ a real number? Is $\delta$ a real number? Is the situation relevant in real life? If yes, please give references. And moreover, what has this to do with sagemath? Why not https://puzzling.stackexchange.com ?

dan_fulea gravatar imagedan_fulea ( 2024-06-23 03:40:19 +0100 )edit

Yes alpha and delta are small real numbers

hamouda gravatar imagehamouda ( 2024-06-23 12:56:55 +0100 )edit

1 Answer

Sort by ยป oldest newest most voted
2

answered 2024-06-23 18:11:52 +0100

Max Alekseyev gravatar image

This question has nothing to do with Sage, and furthermore what is asked is impossible. We have $\log_N(2^{58}) \leq \alpha <\log_N(2^{59})$ and $\delta < 2-\sqrt{\log_N(2^{58})}$. Hence, $$\alpha+\delta < 2 + \log_N(2^{59}) - \sqrt{\log_N(2^{58})}\approx 1.797.$$ On the other hand, since $ed > \phi$, we have $$\alpha+\delta > \log_N(\phi)\approx 2.000.$$

edit flag offensive delete link more

Comments

thank you so much for this observation, what if we take e of 150 bits ? since the inequalities hold

hamouda gravatar imagehamouda ( 2024-06-23 22:44:53 +0100 )edit

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

1 follower

Stats

Asked: 2024-06-23 01:40:07 +0100

Seen: 157 times

Last updated: Jun 23