Attack Algorithm for a Keystore-Based Secret Key Generation Method.

Area of Science:

• Computer Science
• Cryptography
• Network Security

Background:

• The Yang-Wu key generation method was proposed for secure key management in cloud systems.
• It claimed information-theoretic security and long-term key storage solutions using a keystore seed.
• The method's security relied on the difficulty of recovering the keystore seed.

Purpose of the Study:

• To propose a new attack algorithm targeting the Yang-Wu key generation and management method.
• To demonstrate the vulnerability of the Yang-Wu method to seed reconstruction.
• To challenge the claimed information-theoretic security of the Yang-Wu method.

Main Methods:

• Development of a novel attack algorithm to reconstruct the keystore seed.
• Analysis of the algorithm's effectiveness with a small number of collected keys.
• Comparison of the number of keys required for seed reconstruction versus claimed security parameters.

Main Results:

• The proposed attack algorithm successfully reconstructs the keystore seed from a limited number of collected keys.
• For instance, with t=5 and l=2^7, the seed can be recovered using only 84 keys, contrary to claims of generating over 2^53 secure keys.
• The Yang-Wu method is shown to be vulnerable when an attacker can gather multiple keys.

Conclusions:

• The Yang-Wu key generation method is not information-theoretically secure.
• The keystore seed can be compromised if an attacker collects sufficient keys.
• The security of the Yang-Wu method is critically dependent on preventing key leakage.