Pseudo-Random Permutation

Description

A Pseudo-Random Permutation (PRP) is a fundamental cryptographic primitive used in symmetric-key cryptography. It is a function that takes a key and an input from a finite set and produces an output in the same set, such that the function is a bijection (a one-to-one and onto mapping). Without knowledge of the key, the output appears indistinguishable from a truly random permutation to any computationally bounded adversary. Unlike a Pseudo-Random Function (PRF), which does not need to be invertible, a PRP is efficiently invertible when the key is known. This property makes PRPs essential for constructing block ciphers, message authentication codes, and authenticated encryption schemes.

In the context of 3GPP, PRPs are introduced in Release 19 as part of the security architecture for 5G-Advanced and future networks. They are specified in technical reports 35.234 and 35.235, which study new security mechanisms, and in specification 38.161, which likely details the security requirements for the radio interface. The use of PRPs in 3GPP is motivated by the need for robust, efficient, and provably secure cryptographic algorithms that can protect user data and control signaling in increasingly complex network deployments, including those with network slicing, edge computing, and massive IoT.

Architecturally, a PRP is implemented as a keyed permutation, often based on a block cipher such as AES. The security of a PRP is typically analyzed in the framework of provable security, where the advantage of an adversary in distinguishing the PRP from a random permutation is bounded. In 3GPP, PRPs may be used in the generation of keystreams for encryption, in the construction of integrity protection algorithms, or as building blocks for more complex protocols like key derivation and authentication. The specifications 35.234 and 35.235 likely define the exact usage, key sizes, and modes of operation.

Key components of a PRP include the key space, the input/output domain (e.g., 128-bit blocks), and the permutation algorithm itself. The algorithm must be designed to resist cryptanalytic attacks such as differential and linear cryptanalysis. In 3GPP, the PRP may be part of a suite of algorithms that can be negotiated during security mode procedures. The introduction in Rel-19 reflects the ongoing evolution of 5G security to address new threat vectors and to comply with regulatory requirements for cryptographic strength.

The role of PRPs in the network is to provide a foundational security service that ensures confidentiality and integrity of data. They are used in both the control plane and user plane, and can be applied to protect signaling messages (e.g., NAS, RRC) and user data (e.g., SDAP PDUs). As networks move towards 6G, PRPs will continue to be a critical component of the security toolbox, enabling efficient and secure communication.

Purpose & Motivation

The primary purpose of a Pseudo-Random Permutation (PRP) in 3GPP is to provide a strong, efficient cryptographic primitive that can be used to build secure communication protocols. Traditional cryptographic algorithms, such as those based on simple XOR or non-invertible functions, may not offer the necessary security guarantees against modern cryptanalytic attacks. PRPs offer a provably secure way to encrypt and authenticate data, ensuring that even if an attacker observes many input-output pairs, they cannot predict the output for a new input without the key.

Historically, 3GPP has relied on algorithms like SNOW 3G, AES, and ZUC for confidentiality and integrity. However, as networks evolve towards 5G-Advanced and beyond, there is a need for more flexible and robust cryptographic primitives that can be adapted to new use cases, such as ultra-reliable low-latency communication (URLLC) and massive machine-type communication (mMTC). PRPs provide a modular building block that can be used in various constructions, such as counter mode encryption or CMAC for integrity, offering a high level of security with efficient implementation.

The introduction of PRPs in Rel-19 addresses the limitations of older algorithms by providing a formal security model and enabling the design of new security protocols that are resistant to quantum computing threats (when combined with post-quantum cryptography). It also supports the growing demand for security in network slicing, where different slices may require different security policies. By standardizing PRPs, 3GPP ensures interoperability and a common baseline for security across vendors and operators.