Keywords
Public-key cryptographyKey distributionComputer scienceDiscrete logarithmComputer securityKey (lock)CipherCryptographyKey generationTheoretical computer scienceRunning key cipherIdentity (music)AdversaryEncryption
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...
Cryptography and data security
From the Preface (See Front Matter for full Preface) Electronic computers have evolved from exiguous experimental enterprises in the 1940s to prolific practical data processi...
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...
Publication Info
- Year
- 2007
- Type
- book-chapter
- Pages
- 498-507
- Citations
- 160
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
160
OpenAlex
Cite This
Ueli Maurer,
Yacov Yacobi
(2007).
Non-interactive Public-Key Cryptography.
Lecture notes in computer science
, 498-507.
https://doi.org/10.1007/3-540-46416-6_43
Identifiers
- DOI
- 10.1007/3-540-46416-6_43