Pages that link to "Item:Q1317484"
From MaRDI portal
The following pages link to The discrete logarithm modulo a composite hides \(O(n)\) bits (Q1317484):
Displaying 10 items.
- A new cryptosystem using generalized Mersenne primes (Q258874) (← links)
- Paillier's trapdoor function hides \(\Theta(n)\) bits (Q350942) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- On the security of modular exponentiation with application to the construction of pseudorandom generators (Q1402365) (← links)
- Quantum algorithms for computing general discrete logarithms and orders with tradeoffs (Q2048182) (← links)
- Non-malleable functions and their applications (Q2121503) (← links)
- On completely factoring any integer efficiently in a single run of an order-finding algorithm (Q2690484) (← links)
- All Bits in ax + b mod p are Hard (Q3452346) (← links)
- Quantum attacks on pseudorandom generators (Q4925033) (← links)
- A Kilobit Hidden SNFS Discrete Logarithm Computation (Q5738878) (← links)
