A pseudorandom permutation is a deterministic algorithm that transforms an input data block into an output block of identical size, appearing as a random permutation to an observer without the secret key. It functions as a reversible mapping, meaning the original input can be accurately recovered from the output using the same key. These functions are central to block ciphers, providing robust cryptographic scrambling properties. The resulting output sequence exhibits statistical properties closely resembling truly random permutations.
Context
Pseudorandom permutations serve as foundational components in symmetric-key cryptography, forming the core of many widely adopted encryption standards. Their security relies on the computational difficulty of distinguishing their output from a truly random permutation without knowledge of the key. Continuous evaluation of their resilience against novel cryptanalytic techniques remains a critical priority in cryptographic research and development.
A new cryptographic primitive, permutable pseudorandom permutations, enables the first standard-model one-shot signatures, securing single-use digital transactions.
We use cookies to personalize content and marketing, and to analyze our traffic. This helps us maintain the quality of our free resources. manage your preferences below.
Detailed Cookie Preferences
This helps support our free resources through personalized marketing efforts and promotions.
Analytics cookies help us understand how visitors interact with our website, improving user experience and website performance.
Personalization cookies enable us to customize the content and features of our site based on your interactions, offering a more tailored experience.
