A public key cryptosystem and a signature scheme based on discrete logarithms
From MaRDI portal
Publication:3689092
DOI10.1109/TIT.1985.1057074zbMATH Open0571.94014DBLPconf/crypto/Gamal84WikidataQ52600627 ScholiaQ52600627MaRDI QIDQ3689092FDOQ3689092
Authors: Taher Elgamal 
Publication date: 1985
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Probabilistic encryption
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security
- Title not available (Why is that?)
- Chosen-Ciphertext Security via Correlated Products
- Orthogonality between Key Privacy and Data Privacy, Revisited
Cited In (only showing first 100 items - show all)
- Signcryption schemes with insider security in an ideal permutation model
- Message transmission for GH-public key cryptosystem
- Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
- A password authentication scheme based on discrete logarithms
- Public key cryptography using semigroup actions and semirings
- A new signature scheme based on factoring and discrete logarithms
- Some basics on privacy techniques, anonymization and their big data challenges
- Partial information in public key cryptography
- Improved authenticated multiple-key agreement protocol without using conventional one-way function.
- Nonrepudiable proxy multi-signature scheme
- Input-trees of finite automata and application to cryptanalysis
- Round-optimal secure multi-party computation
- Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
- Modular Reduction in GF(2 n ) without Pre-computational Phase
- Memory lower bounds of reductions revisited
- An XML multisignature scheme.
- Fast direct computation of modular reduction
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Non-interactive key exchange
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\)
- Efficient on-line electronic checks
- Partially structure-preserving signatures: lower bounds, constructions and more
- Elliptic curve based hardware architecture using cellular automata
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- A design of fast pipelined modular multiplier based on a diminished-radix algorithm
- User impersonation in key certification schemes
- Chosen ciphertext secure keyed-homomorphic public-key encryption
- An efficient post-quantum one-time signature scheme
- Bounds in various generalized settings of the discrete logarithm problem
- Privacy-preserving ridge regression on distributed data
- A Calculus for Game-Based Security Proofs
- Batch RSA signature scheme
- Improvement of the Miyazaki-Takaragi threshold digital signature scheme
- Formal security proofs with minimal fuss: implicit computational complexity at work
- Cryptography from learning parity with noise
- Provably secure and pairing-free certificateless digital signature scheme using elliptic curve cryptography
- Properties of certain semigroups and their potential as platforms for cryptosystems
- Cryptosystems based on semi-distributive algebras
- Improvement of signature scheme based on factoring and discrete logarithms
- Self-certified multi-proxy signature schemes with message recovery
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
- Integrating authentication in public key distribution system
- Probabilistic functions and cryptographic oracles in higher order logic
- Speeding up the computations of elliptic curves cryptoschemes
- How to sign digital streams
- Carryless addition
- New efficient and secure protocols for verifiable signature sharing and other applications
- Dynamic threshold secret reconstruction and its application to the threshold cryptography
- Fault Attacks on Public Key Elements: Application to DLP-Based Schemes
- Privacy preserving distributed optimization using homomorphic encryption
- Cryptanalysis and an Improvement of New Remote Mutual Authentication Scheme using Smart Cards
- Strong Designated Verifier Signature Scheme Based on Discrete Logarithm Problem
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Low complexity normal bases
- An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem
- A new cryptosystem using generalized Mersenne primes
- An ID-based cryptographic mechanisms based on GDLP and IFP
- Pairings in local fields and cryptography
- Traps to the BGJT-algorithm for discrete logarithms
- Multi-use and unidirectional identity-based proxy re-encryption schemes
- An efficient collision detection method for computing discrete logarithms with Pollard's rho
- A novel text and image encryption method based on chaos theory and DNA computing
- Concurrent knowledge extraction in public-key models
- Efficient set intersection with simulation-based security
- Gauss periods: orders and cryptographical applications
- Mean-set attack: cryptanalysis of Sibert et al. authentication protocol
- (EC)DSA lattice attacks based on Coppersmith's method
- Security Analysis of the Strong Diffie-Hellman Problem
- Some lattice attacks on DSA and ECDSA
- A key distribution system equivalent to factoring
- A fair and efficient solution to the socialist millionaires' problem
- Coin-based multi-party fair exchange
- New field of cryptography: DNA cryptography
- Accelerating Pollard's rho algorithm on finite fields
- Discrete logarithm based additively homomorphic encryption and secure data aggregation
- A public key cryptosystem based on non-abelian finite groups
- How to construct efficient signcryption schemes on elliptic curves
- New lattice attacks on DSA schemes
- Digital signature algorithm for securing digital identities
- Tightly secure signatures and public-key encryption
- Efficient signature generation by smart cards
- A variant of digital signature algorithm
- Synchronization and an application of a novel fractional order King Cobra chaotic system
- Improved Pollard rho method for computing discrete logarithms over finite extension fields
- Identity-based cryptosystems and signature schemes
- A \((t,n)\) multi-secret sharing scheme
- Measurement-device-independent semiquantum key distribution
- Parallel algorithms for modular multi-exponentiation
- Asymmetric Group Key Agreement
- Public key cryptosystem MST\(_{3}\): cryptanalysis and realization
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- Synchronization of chaotic systems using feedback controller: an application to Diffie-Hellman key exchange protocol and elgamal public key cryptosystem
- Threshold cryptography based on Asmuth-Bloom secret sharing
- Bug attacks
- Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\)
- Computation of discrete logarithms in prime fields
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- Public key signatures in the multi-user setting.
This page was built for publication: A public key cryptosystem and a signature scheme based on discrete logarithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689092)
