Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for RSA problem 4 found (85 total)

alternate case: rSA problem

Verifiable random function (1,462 words) [view diff] exact match in snippet view article find links to article

function thus proposed, which is provably secure if a variant of the RSA problem is hard, is defined as follows: The public key PK is (m,r,Q,coins){\displaystyle
Commitment scheme (7,469 words) [view diff] exact match in snippet view article find links to article
The security of the above commitment relies on the hardness of the RSA problem and has perfect hiding and computational binding. The Pedersen commitment
Digital credential (2,455 words) [view diff] exact match in snippet view article find links to article
discrete logarithm problem for groups of known order and the special RSA problem for groups of hidden order form the foundation for most modern group
Routing and wavelength assignment (2,479 words) [view diff] no match in snippet view article find links to article
problem. The authors study a constrained routing and spectrum assignment (RSA) problem, which can be reduced to a constrained RWA problem by requesting one