Pages that link to "Item:Q3689092"
From MaRDI portal
The following pages link to A public key cryptosystem and a signature scheme based on discrete logarithms (Q3689092):
Displaying 50 items.
- A new cryptosystem using generalized Mersenne primes (Q258874) (← links)
- Pairings in local fields and cryptography (Q266208) (← links)
- A novel text and image encryption method based on chaos theory and DNA computing (Q269066) (← links)
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- (EC)DSA lattice attacks based on Coppersmith's method (Q280950) (← links)
- How to construct efficient signcryption schemes on elliptic curves (Q293455) (← links)
- New lattice attacks on DSA schemes (Q293717) (← links)
- Digital signature algorithm for securing digital identities (Q294882) (← links)
- Tightly secure signatures and public-key encryption (Q300383) (← links)
- Bug attacks (Q321310) (← links)
- Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\) (Q324277) (← links)
- Public key protocols over the ring \(E_{p}^{(m)}\) (Q340183) (← links)
- A semantically secure public key cryptoscheme using bit-pair shadows (Q344780) (← links)
- A provably secure non-iterative hash function resisting birthday attack (Q344781) (← links)
- An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem (Q396599) (← links)
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- Two-server password-only authenticated key exchange (Q414937) (← links)
- A public key cryptosystem based on three new provable problems (Q418738) (← links)
- Some lattice attacks on DSA and ECDSA (Q429782) (← links)
- Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
- Discrete logarithm based additively homomorphic encryption and secure data aggregation (Q433021) (← links)
- Scheduling in a dynamic heterogeneous distributed system using estimation error (Q436905) (← links)
- Improved Pollard rho method for computing discrete logarithms over finite extension fields (Q442714) (← links)
- Computing elliptic curve discrete logarithms with the negation map (Q454851) (← links)
- An ID-based cryptographic mechanisms based on GDLP and IFP (Q456110) (← links)
- Lossy trapdoor functions from homomorphic reproducible encryption (Q456129) (← links)
- A note on asynchronous multi-exponentiation algorithm using binary representation (Q456161) (← links)
- An efficient IND-CCA2 secure Paillier-based cryptosystem (Q456166) (← links)
- Creation of identity-based digital signature schemes from bilinear maps (Q466389) (← links)
- Synchronization of chaotic systems using feedback controller: an application to Diffie-Hellman key exchange protocol and elgamal public key cryptosystem (Q467057) (← links)
- A general construction for monoid-based knapsack protocols (Q476358) (← links)
- An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem (Q477687) (← links)
- Linear decomposition method in analyzing hidden information protocols on algebraic platforms (Q498303) (← links)
- Privacy protection in on-line shopping for electronic documents (Q506124) (← links)
- Practical verifiably encrypted signatures without random oracles (Q506783) (← links)
- Secure multiparty computation of solid geometric problems and their applications (Q507770) (← links)
- Public-key cryptosystem based on invariants of diagonalizable groups (Q524643) (← links)
- Practical electronic auction scheme with strong anonymity and bidding privacy (Q545374) (← links)
- A new blind signature based on the discrete logarithm problem for untraceability (Q556120) (← links)
- Electronic jury voting protocols (Q596143) (← links)
- On the design of time-stamped signatures (Q596319) (← links)
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- Efficient proxy signcryption scheme with provable CCA and CMA security (Q623106) (← links)
- Fair exchange of valuable information: a generalised framework (Q632798) (← links)
- Calculating optimal addition chains (Q644848) (← links)
- Star reduction among minimal length addition chains (Q644852) (← links)
- Restricted adaptive oblivious transfer (Q650878) (← links)
- Fault-based attack on Montgomery's ladder algorithm (Q656523) (← links)
- Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system (Q666168) (← links)