Basic asymmetric crypto question + can you do this with crypto?

  • Context: Undergrad 
  • Thread starter Thread starter cool_arrow
  • Start date Start date
Click For Summary
SUMMARY

This discussion centers on public key cryptography, specifically using OpenPGP for message encryption and the concept of a "master" key for generating public/private key pairs. It is established that once a message is encrypted with a recipient's public key, it cannot be decrypted with the sender's private key. Additionally, the idea of a master key that can decrypt messages encrypted with derived keys is clarified as impractical, as public/private key pairs are inherently linked. The concept of key escrow is mentioned as a potential solution for scenarios requiring a trusted third party to access encrypted messages.

PREREQUISITES
  • Understanding of public key cryptography principles
  • Familiarity with OpenPGP encryption standards
  • Knowledge of key pair generation and management
  • Concept of key escrow and its implications
NEXT STEPS
  • Research the OpenPGP standard and its implementation details
  • Explore the concept of key escrow and its applications in cryptography
  • Learn about hierarchical key management systems in cryptography
  • Investigate alternative asymmetric cryptographic methods and their use cases
USEFUL FOR

Cryptography enthusiasts, security professionals, and developers interested in understanding public key systems and their limitations, particularly in relation to key management and encryption practices.

cool_arrow
Messages
4
Reaction score
0
Hi. Crypto noob here learning a little about the subject lately and I have some questions:

1) If I am using public key cryptography (like openpgp) and I encrypt a message for a recipient using their public key, can I decrypt that message using my private key in the future?

2) Does a method of asymmetric cryptography exist that allows one to generate public and private key pairs based on a "master" key such that the "master" can always decrypt anything encrypted with the keys generated/computed from it?

The reason I ask these questions is that I am wondering if there exists a cryptographic method whererby a hierarchy of keys can be created such that any private key can be used to generate any number of public/private key pairs and any message encrypted using these keys derived from the "master" can not only be decrypted by the recipient (of course), but also by the "master" keys from which it was derived.

Does something like this currently exist? Any info is appreciated.
 
Mathematics news on Phys.org
cool_arrow said:
1) If I am using public key cryptography (like openpgp) and I encrypt a message for a recipient using their public key, can I decrypt that message using my private key in the future?
No. Why would you ever have to do that, considering you would have the plaintext to begin with?

2) Does a method of asymmetric cryptography exist that allows one to generate public and private key pairs based on a "master" key such that the "master" can always decrypt anything encrypted with the keys generated/computed from it?
This does not make sense. The public/private keys are a pair- if something is encrypted with your public key, you can decrypt it with your private key and VV. There is no need for a "master" key.


The reason I ask these questions is that I am wondering if there exists a cryptographic method whererby a hierarchy of keys can be created such that any private key can be used to generate any number of public/private key pairs and any message encrypted using these keys derived from the "master" can not only be decrypted by the recipient (of course), but also by the "master" keys from which it was derived.

Does something like this currently exist? Any info is appreciated.

Sounds like key escrow to me. In that case you'd just give the private key to the trusted escrow authority...like the US Government! Oh, wait...
 
thanks fss. I think I'm clear on how it works now.
 

Similar threads

Replies
45
Views
7K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
5
Views
782
  • · Replies 1 ·
Replies
1
Views
2K
Replies
7
Views
3K
Replies
3
Views
7K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 13 ·
Replies
13
Views
4K
Replies
7
Views
2K