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.
- An efficient quantum somewhat homomorphic symmetric searchable encryption (Q1705121) (← links)
- Privacy preserving distributed optimization using homomorphic encryption (Q1716476) (← links)
- Preimage selective trapdoor function: how to repair an easy problem (Q1718474) (← links)
- Further improvement of factoring \(N=p^rq^s\) with partial known bits (Q1726017) (← links)
- Public key compression for constrained linear signature schemes (Q1726681) (← links)
- A generalized attack on some variants of the RSA cryptosystem (Q1726690) (← links)
- Parallel algorithms for modular multi-exponentiation (Q1732855) (← links)
- More classes of permutation trinomials with Niho exponents (Q1733978) (← links)
- Compositional inverses of permutation polynomials of the form \(x^rh(x^s)\) over finite fields (Q1733982) (← links)
- An arbitrated proxy blind signature based on hyper entanglement analysis (Q1740893) (← links)
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- On the optimality of lattices for the Coppersmith technique (Q1745898) (← links)
- Deterministic MDI QKD with two secret bits per shared entangled pair (Q1746865) (← links)
- Attacks to some verifiable multi-secret sharing schemes and two improved schemes (Q1750542) (← links)
- On the security of RSA with primes sharing least-significant bits (Q1762562) (← links)
- Improvement of signature scheme based on factoring and discrete logarithms (Q1763218) (← links)
- A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli (Q1763231) (← links)
- Digital signature with message recovery using self-certified public keys without trustworthy system authority (Q1763234) (← links)
- Efficient on-line electronic checks (Q1765865) (← links)
- An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme (Q1774928) (← links)
- Meta-He digital signatures based on factoring and discrete logarithms (Q1780491) (← links)
- Chaotic synchronization cryptosystems combined with RSA encryption algorithm (Q1795139) (← links)
- Fast group operations on elliptic curves in Maple (Q1806495) (← links)
- Two varieties of finite automaton public key cryptosystem and digital signatures (Q1820751) (← links)
- Factoring with the quadratic sieve on large vector computers (Q1825224) (← links)
- A \((t,n)\) multi-secret sharing scheme (Q1826661) (← links)
- Threshold verification scheme to a valid-signature using identity only on specialized approval (Q1826788) (← links)
- Improvements of generalization of threshold signature and authenticated encryption for group communications (Q1847376) (← links)
- A model-theoretic characterization of the weak pigeonhole principle (Q1849868) (← links)
- Qubit authentication (Q1850347) (← links)
- How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps. (Q1853119) (← links)
- Adaptively secure distributed public-key systems. (Q1853497) (← links)
- Proxy signature schemes based on factoring (Q1853688) (← links)
- Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
- Robust threshold DSS signatures (Q1854399) (← links)
- How to sign digital streams (Q1854413) (← links)
- Regular languages accepted by quantum automata (Q1854417) (← links)
- ID-based multisignatures with distinguished signing authorities for sequential and broadcasting architectures (Q1855792) (← links)
- Digital signature with message recovery using self-certified public keys and its variants (Q1856026) (← links)
- A practical anonymous payment scheme for electronic commerce (Q1876490) (← links)
- A one-way function from thermodynamics and applications to cryptography (Q1879458) (← links)
- Efficient algorithms for NMR quantum computers with small qubits (Q1880338) (← links)
- An application of algebraic geometry to encryption: tame transformation method (Q1884054) (← links)
- Repairing ElGamal-like multi-signature schemes using self-certified public keys (Q1886557) (← links)
- Robust key authentication scheme resistant to public key substitution attacks (Q1888257) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- Password authentications using triangles and straight lines (Q1903210) (← links)
- Analysis of sliding window techniques for exponentiation (Q1903214) (← links)
- Redundant integer representations and fast exponentiation (Q1910428) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
