CRYPTO NEWS

White hat finds huge vulnerability in ETH to Arbitrum bridge: Wen max bounty?

The ethical exploiter thanked Arbitrium for the 400 ETH payday but said such a find should be eligible for the max bounty of nearly 1,500 ETH, or $2 million.

Is there a way to systematically calculate the public exponent $e$ in RSA?

I’m learning RSA in one of my classes and we were given a problem: $p = 5$, $q = 11$ I have done the following steps: $n = 5 cdot 11 = 55$ $phi = (5-1)cdot(11-1) = 40$ I know that to find $e$ we have to find an integer co-prime with $phi$, where $phi$::Listen

I’m learning RSA in one of my classes and we were given a problem:

$p = 5$, $q = 11$

I have done the following steps:

$n = 5 cdot 11 = 55$
$phi = (5-1)cdot(11-1) = 40$

I know that to find $e$ we have to find an integer co-prime with $phi$, where $phi$ is $40$ and $gcd(e,40) = 1$.

Is there an algorithm I can use by hand that can give me $e$? I know there can be numerous values. The method the professor has shown is to just enumerate each prime and find the first divisible into the totient $phi$. I assume he will give us small numbers in the exam but still, doing it by trial and error can be time consuming.

I understand one can use extended Euclids algorithm to find the inverse of $e$, which I can do provided I know what $e$ is.

I just struggle with finding $e$.

White hat finds huge vulnerability in ETH to Arbitrum bridge: Wen max bounty?

Shopping cart
There are no products in the cart!
Continue shopping
0