The following pages link to (Q4847943):
Displaying 17 items.
- On reducing factorization to the discrete logarithm problem modulo a composite (Q445245) (← links)
- A note on quadratic residuosity and UP (Q834917) (← links)
- An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme (Q1774928) (← links)
- Computing sparse multiples of polynomials (Q1934308) (← links)
- Integer factoring and compositeness witnesses (Q2023317) (← links)
- Spectral characterizations of tournaments (Q2142659) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Practical convertible authenticated encryption schemes using self-certified public keys (Q2571976) (← links)
- A new forward-secure authenticated encryption scheme with message linkages (Q3443214) (← links)
- (Q3584055) (← links)
- A deterministic version of Pollard’s $p-1$ algorithm (Q3584788) (← links)
- (Q3808149) (← links)
- The Power of Leibniz-Like Functions as Oracles (Q5042247) (← links)
- ON GENERIC COMPLEXITY OF THE PROBLEM OF REPRESENTATION OF NATURAL NUMBERS BY SUM OF TWO SQUARES (Q5151448) (← links)
- New Characterization of the Factor Refinement Algorithm with Applications (Q6081973) (← links)
- Deterministic factoring with oracles (Q6115442) (← links)
- On the generic complexity of the problem of computing the Euler function (Q6646053) (← links)
