Keywords
CryptosystemDiscrete logarithmScheme (mathematics)Realization (probability)Computer scienceIdentity (music)Theoretical computer scienceThreshold cryptosystemConstant (computer programming)Integer (computer science)LogarithmCryptographyMathematicsEncryptionAlgorithmPublic-key cryptographyComputer securityPublic key cryptosystem
Affiliated Institutions
Related Publications
An ID-based cryptosystem based on the discrete logarithm problem
In a modern network system, data security technologies such as cryptosystems, signature schemes, etc., are indispensable for reliable data transmission. In particular, for a lar...
SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
In the RSA public-key crypto system a message M (<R) is encrypted by calculating K≡me (mod R), where 0<K<R and R, e are integers which are made public. The recipient of K can de...
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...
Cryptanalysis of the Chor-Rivest cryptosystem
Knapsack-based cryptosystems used to be popular in the beginning of public key cryptography before being all broken, all but the Chor-Rivest cryptosystem. We show how to break t...
Publication Info
- Year
- 1988
- Type
- book-chapter
- Pages
- 340-349
- Citations
- 97
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
97
OpenAlex
Cite This
Hatsukazu Tanaka
(1988).
A Realization Scheme for the Identity-Based Cryptosystem.
Lecture notes in computer science
, 340-349.
https://doi.org/10.1007/3-540-48184-2_29
Identifiers
- DOI
- 10.1007/3-540-48184-2_29