Keywords
CryptosystemPublic-key cryptographyComputer scienceDigital signatureFactorizationFactoringPlaintext-aware encryptionEncryptionTheoretical computer scienceCryptographyKey (lock)Integer factorizationMathematicsDeterministic encryptionComputer securityAlgorithmHash function
Affiliated Institutions
Related Publications
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...
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...
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...
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...
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
- 66-70
- Citations
- 17
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
17
OpenAlex
Cite This
Hywel C Williams
(2007).
Some Public-Key Crypto-Functions as Intractable as Factorization.
Lecture notes in computer science
, 66-70.
https://doi.org/10.1007/3-540-39568-7_7
Identifiers
- DOI
- 10.1007/3-540-39568-7_7