CRYPTO NEWS

Market selling might ease, but traders are on the sidelines until BTC confirms $20K as support

BTC and altcoins could continue to see selling, but a positive is that traders took shelter in stablecoins instead of completely exiting the crypto market.

Proving equivalence of discrete logarithms over a modulus of unknown factorization

A prover has a secret exponent x, two public bases g and h, and a public RSA modulus N of which no party knows the totient/factors. All inputs other than N are caprice with N with overwhelming probability. She publishes a = g^x and b = h^x, but she needs an NIZK that she used::Listen

A prover has a secret exponent x, two public bases g and h, and a public RSA modulus N of which no party knows the totient/factors. All inputs other than N are caprice with N with overwhelming probability. She publishes a = g^x and b = h^x, but she needs an NIZK that she used the same exponent for both a and b. How can she create a proof (assuming access to randomness beacons and commitments)?

This is similar the problem solved by Schnorr’s proof of knowledge of a discrete logarithm, but the difference is the RSA modulus, who’s factors are unknown and not guaranteed to be safe primes.

Market selling might ease, but traders are on the sidelines until BTC confirms $20K as support

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