Pages that link to "Item:Q4145254"
From MaRDI portal
The following pages link to A method for obtaining digital signatures and public-key cryptosystems (Q4145254):
Displaying 50 items.
- From quantum cellular automata to quantum lattice gases (Q1285147) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Access control in a hierarchy using a one-way trap door function (Q1309742) (← links)
- A design of fast pipelined modular multiplier based on a diminished-radix algorithm (Q1312101) (← links)
- The discrete logarithm modulo a composite hides \(O(n)\) bits (Q1317484) (← links)
- Functional inversion and communication complexity (Q1335026) (← links)
- Conducting secret ballot elections in computer networks: Problems and solutions (Q1339204) (← links)
- On dynamic threshold schemes (Q1341683) (← links)
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications (Q1344528) (← links)
- Efficient data structures for Boolean functions (Q1344625) (← links)
- A highly safe self-stabilizing mutual exclusion algorithm (Q1351623) (← links)
- Speeding up the computations of elliptic curves cryptoschemes (Q1356851) (← links)
- Batch RSA (Q1363068) (← links)
- Batch Diffie-Hellman key agreement systems (Q1363070) (← links)
- Carryless addition (Q1364070) (← links)
- The security of the birational permutation signature schemes (Q1364903) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- On the simulation of quantum Turing machines. (Q1401393) (← links)
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- Improved low-computation partially blind signatures. (Q1412496) (← links)
- A practical anonymous multi-authority e-cash scheme. (Q1412636) (← links)
- Unmediated communication in repeated games with imperfect monitoring. (Q1420518) (← links)
- An XML multisignature scheme. (Q1427894) (← links)
- Cryptanalysis of short secret exponents modulo RSA primes. (Q1429863) (← links)
- Fast direct computation of modular reduction (Q1570258) (← links)
- Secure distributed storage and retrieval (Q1575652) (← links)
- Input-trees of finite automata and application to cryptanalysis (Q1581120) (← links)
- The multi-dimension RSA and its low exponent security (Q1589779) (← links)
- A traceable group signature scheme. (Q1597121) (← links)
- Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm (Q1603547) (← links)
- A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\) (Q1606999) (← links)
- An iterative modular multiplication algorithm (Q1609170) (← links)
- Some basics on privacy techniques, anonymization and their big data challenges (Q1616158) (← links)
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations (Q1629427) (← links)
- Certifying trapdoor permutations, revisited (Q1629429) (← links)
- On the security loss of unique signatures (Q1629431) (← links)
- Registration-based encryption: removing private-key generator from IBE (Q1629445) (← links)
- High-performance generic-point parallel scalar multiplication (Q1640404) (← links)
- A fast parallel modular exponentiation algorithm (Q1640600) (← links)
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm (Q1643980) (← links)
- Efficient information hiding based on theory of numbers (Q1646258) (← links)
- Factoring RSA moduli with primes sharing bits in the middle (Q1647745) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- Quantum reversible circuit of AES-128 (Q1654144) (← links)
- New constructions of permutation polynomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\) (Q1671644) (← links)
- A generalized attack on RSA type cryptosystems (Q1680536) (← links)
- RSA: a number of formulas to improve the search for \(p+q\) (Q1684046) (← links)
- On the impossibility of cryptography with tamperable randomness (Q1688399) (← links)
- A class of new permutation trinomials (Q1696755) (← links)
- Permutation polynomials of the form \(cx+\mathrm{Tr}_{q^l/ q}(x^a)\) and permutation trinomials over finite fields with even characteristic (Q1699267) (← links)
