Recommendation for Key Management, Part 1: General (Revision 3)

By Elaine B. Barker, William Barker, William E. Burr, W. Polk, M. Smid. 2006

574 citations recorded by the source corpus.

This Recommendation provides cryptographic key management guidance. It consists of three parts. Part 1 provides general guidance and best practices for the management of cryptographic keying material. Part 2 provides guidance on policy and security planning requirements for U.S. government agencies. Finally, Part 3 provides guidance when using the cryptographic features of current systems.

Subfields: Political Science and International Relations

View Paper: https://www.semanticscholar.org/paper/cb1c3477320618d7d9944ba2de981d9d55aad717

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Political Science and International Relations

Daniel J. Bernstein

Citations in the corpus

Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups (2010, background): “On the other hand, the size of a prime-order elliptic curve group that provides an equivalent level of security is 160 bits [2].”
Sphinx: A Compact and Provably Secure Mix Format (2009, background): “We will be generous to the competing formats and stipulate that an RSA or Diffie-Hellman modulus of 2048 bits (256 bytes) is sufficient to offer 128-bit security, even though NIST [2] suggests that 3072-bit moduli are more appropriate for that security level.”
The Security Impact of a New Cryptographic Library (2012, methodology): “, [32] for an analysis by Shamir (the S in RSA) and Tromer; [25] for an end-of-2010 recommendation from the RSA company; and [5] for an end-of-2010 recommendation from the U.”
Performance evaluation of Attribute-Based Encryption: Toward data privacy in the IoT (2014, background): “According to [10] and [14], with a fixed k = 2, the bitlength choices of r and q and their equivalent security levels in terms of symmetric key encryption and RSA are summarized in Table I.”
Intel SGX Explained (2016, background): “RSA has variable key sizes, and 3072-bit key pairs are considered to provide the same security as 128-bit AES keys [20].”
New Software Speed Records for Cryptographic Pairings (2010, background): “According to [5], such a curve achieves 128 bits of security, while according to [17] this is 124 bits.”
Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks (2020, background): “Reference security levels for popular symmetric and asymmetric cryptosystems (source: [31]).”
BatchCrypt: Efficient Homomorphic Encryption for Cross-Silo Federated Learning (2020, background): “As of 2019, the minimum secure key size for Paillier is 2048 [6], whilst a gradient is typically a 32-bit ﬂoating point.”