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.
- On-line/off-line digital signatures (Q1912770) (← links)
- Fibonacci linear forms and parallel arithmetic algorithms for large numbers (Q1918742) (← links)
- On the oracle complexity of factoring integers (Q1918949) (← links)
- Graph coloring applied to secure computation in non-abelian groups (Q1928772) (← links)
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA (Q1934238) (← links)
- Closed-form formula on quantum factorization effectiveness (Q1937229) (← links)
- RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems (Q1938506) (← links)
- Security of ping-pong protocol based on pairs of completely entangled qudits (Q1939440) (← links)
- A secure voting scheme based on rational self-interest (Q1941886) (← links)
- Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\) (Q1944037) (← links)
- Feebly secure cryptographic primitives (Q1946841) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
- An optimization of tree topology based parallel cryptography (Q1955306) (← links)
- A novel true random number generator based on mouse movement and a one-dimensional chaotic map (Q1955366) (← links)
- Analysis of the variable length nonzero window method for exponentiation (Q1963003) (← links)
- Broadcasting cryptosystem in computer networks (Q1963368) (← links)
- A novel ID-based group signature (Q1969685) (← links)
- A method for computing Lucas sequences (Q1975706) (← links)
- A Wiener-type attack on an RSA-like cryptosystem constructed from cubic Pell equations (Q1981778) (← links)
- Cryptanalysis of a code-based full-time signature (Q1981793) (← links)
- Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons (Q1983001) (← links)
- On the algebraic structure of \(E_p^{(m)}\) and applications to cryptography (Q1983336) (← links)
- Generic hardness of inversion on ring and its relation to self-bilinear map (Q1989358) (← links)
- Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution (Q1992109) (← links)
- The error probability of the Miller-Rabin primality test (Q1992114) (← links)
- Quantum conference (Q1993783) (← links)
- An efficient quantum digital signature for classical messages (Q1994716) (← links)
- A multivariate cryptosystem inspired by random linear codes (Q1995213) (← links)
- Coppersmith's lattices and ``focus groups'': an attack on small-exponent RSA (Q1998906) (← links)
- Efficient digital signatures from RSA without random oracles (Q1999174) (← links)
- Composable security against collective attacks of a modified BB84 QKD protocol with information only in one basis (Q2007718) (← links)
- A new public key cryptosystem based on Edwards curves (Q2008069) (← links)
- Robust synchronization of uncertain unified chaotic systems subject to noise and its application to secure communication (Q2017939) (← links)
- New number-theoretic cryptographic primitives (Q2023304) (← links)
- Protecting ECC against fault attacks: the ring extension method revisited (Q2023307) (← links)
- Survey on SAP and its application in public-key cryptography (Q2023804) (← links)
- Complexity bounds on Semaev's naive index calculus method for ECDLP (Q2025337) (← links)
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem (Q2025379) (← links)
- Symmetric and asymmetric cryptographic key exchange protocols in the octonion algebra (Q2032302) (← links)
- Some graph-based encryption schemes (Q2034947) (← links)
- Comment on ``Practical and secure outsourcing algorithms for solving quadratic congruences in Internet of Things'' (Q2043368) (← links)
- Quantum algorithms for computing general discrete logarithms and orders with tradeoffs (Q2048182) (← links)
- Threshold ECDSA with an offline recovery party (Q2053769) (← links)
- The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← links)
- The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes (Q2056690) (← links)
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem (Q2056746) (← links)
- Efficient fully CCA-secure predicate encryptions from pair encodings (Q2070257) (← links)
- Indifferentiability for public key cryptosystems (Q2096477) (← links)
- Fast and secure updatable encryption (Q2096496) (← links)
- Verifiable registration-based encryption (Q2096501) (← links)
