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)
- 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.
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- Title not available (Why is that?)
- Certificateless signature: a new security model and an improved generic construction
- A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- Homomorphic encryption
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Public key protocols over the ring \(E_{p}^{(m)}\)
- A semantically secure public key cryptoscheme using bit-pair shadows
- A provably secure non-iterative hash function resisting birthday attack
- Protocol completion incentive problems in cryptographic Vickrey auctions
- A public key cryptosystem based on three new provable problems
- Scheduling in a dynamic heterogeneous distributed system using estimation error
- Privacy-preserving fingerprint authentication resistant to hill-climbing attacks
- Asymptotic granularity reduction and its application
- Hyperelliptic cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- An implementation for a fast public-key cryptosystem
- A method for obtaining digital signatures and public-key cryptosystems
- Elliptic curve cryptosystems in the presence of permanent and transient faults
- A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
- Electronic voting in a large-scale distributed system
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Certificate-based verifiably encrypted signatures from pairings
- Two-server password-only authenticated key exchange
- An algorithm for modular exponentiation.
- Limits of a conjecture on a leakage-resilient cryptosystem
- Key exchange protocols over noncommutative rings. The case of End(\(\mathbb Z_p \times \mathbb Z_{p^{2}}\))
- Speeding Up the Pollard Rho Method on Prime Fields
- A new digital signature scheme based on chaotic maps
- New designing of cryptosystems based on quadratic fields
- SoK: how (not) to design and implement post-quantum cryptography
- A formal language for cryptographic protocol requirements
- Semi-generic construction of public key encryption and identity-based encryption with equality test
- An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem
- A remote password authentication scheme based on the digital signature method
- New public-key cryptosystem
- Should one always use repeated squaring for modular exponentiation?
- Attacks on provably secure proxy-protected signature schemes based on factoring
- Fast exponentiation by folding the signed-digit exponent in half
- Improvement of Tseng et al.'s authenticated encryption scheme with message linkages
- An iterative modular multiplication algorithm
- Secure parameterized pattern matching
- Providing data confidentiality against malicious hosts in shared data spaces
- A note on the security of \(\text{MST} _{3}\)
- A password authentication scheme over insecure networks
- Cryptanalysis of MV3 Stream Cipher
- Anonymous message communications with user hierarchy in a multicast system
- Algebraic curves and cryptography
- Quantum reversible circuit of AES-128
- Encryption of covert information into multiple statistical distributions
- Reusable fuzzy extractor from the decisional Diffie-Hellman assumption
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
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)
