Abstract
In a modern network system, data security technologies such as cryptosystems, signature schemes, etc., are indispensable for reliable data transmission. In particular, for a large-scale network, ID-based systems such as the ID-based cryptosystem, the ID-based signature scheme, or the ID-based key distribution system are among the better countermeasures for establishing efficient and secure data transmission systems. The concept of an ID-based cryptosystem has been proposed by A. S?hamir (1985), and it is advantageous to public-key cryptosystems because a large public-key file is not required for such a system. An ID-based cryptosystem based on the discrete logarithm problem is proposed which is one of the earliest realizations in Shamir's sense. The security against a conspiracy of some entities in the proposed system is considered, along with the possibility of establishing a more secure system.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
CryptosystemComputer scienceDiscrete logarithmPublic-key cryptographyTheoretical computer scienceKey (lock)Hybrid cryptosystemCryptographyComputer securityLogarithmDigital signatureEncryptionMathematicsHash function
Affiliated Institutions
Related Publications
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
A cryptographic system is described which is secure if and only if computing logarithms over <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1...
Elliptic curve cryptosystems using curves of smooth order over the ring Z/sub n/
We present a new cryptosystem based on elliptic curves over the ring Z/sub n/, where n=pq, in which the message is held in the exponent and not the group element. The security o...
A public key cryptosystem and a signature scheme based on discrete logarithms
A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem. The security of both s...
Algorithms for quantum computation: discrete logarithms and factoring
A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation tim...
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two import...
Publication Info
- Year
- 1989
- Type
- article
- Volume
- 7
- Issue
- 4
- Pages
- 467-473
- Citations
- 190
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
190
OpenAlex
Cite This
Shigeo Tsujii,
Toshiya Itoh
(1989).
An ID-based cryptosystem based on the discrete logarithm problem.
IEEE Journal on Selected Areas in Communications
, 7
(4)
, 467-473.
https://doi.org/10.1109/49.17709
Identifiers
- DOI
- 10.1109/49.17709