Skip to search formSkip to main contentSkip to account menu

Pseudorandom permutation

Known as: Pseudo-random permutation 
In cryptography, the term pseudorandom permutation, abbreviated PRP, refers to a function that cannot be distinguished from a random permutation… 
Wikipedia (opens in a new tab)

Related topics

Related topics

16 relations
Block cipherCBC-MACComputer securityCryptography

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Trick or Tweak: On the (In)security of OTR's Tweaks
Tweakable blockcipher (TBC) is a powerful tool to design authenticated encryption schemes as illustrated by Minematsu’s Offset… 
2014
2014
XLS is Not a Strong Pseudorandom Permutation
In FSE 2007, Ristenpart and Rogaway had described a generic method XLS to construct a length-preserving strong pseudorandom… 
2009
2009
On the pseudorandomness of Shabal ’ s keyed permutation
We report observations suggesting that the permutation used in Shabal does not behave pseudorandomly. This does not affect the… 
2009
2009
The Chameleon Cipher-192 (CC-192) - A Polymorphic Cipher
The Chameleon Cipher-192 is a polymorphic cipher that utilizes a variable word size and variable-size user’s key. In the… 
2007
2007
How to Construct Super-Pseudorandom Permutations with Short Keys
It is known that a super-pseudorandom permutation can be constructed from a pseudorandom function f and two universal hash… 
Highly Cited
2006
Highly Cited
2006
Wavelet-Based Audio Watermarking Using Adaptive Tabu Search
In this paper, we present an algorithm for robust audio watermarking in wavelet transform domain. Using Daubechies wavelet… 
2004
2004
Image Watermarking Based On Wavelet Packet Transform With Best Tree
This paper proposes a watermarking embedding and extracting methods in the frequency domain based on a selection of a high… 
2003
2003
Permutation modulation for fading channels
Permutation codes are special spherical codes designed for the band-limited Gaussian channel. Their application to fading… 
1994
1994
Construction of pseudorandom permutations
The permutation from {0, 1}2n to {0, 1}2n represented by S(f) in DES (Data Encryption Standard) is used as the basic operation… 
1986
1986
Capability of the error-trapping technique in decoding cyclic codes
The error-trapping technique, whenever applicable, is easy to implement. Here we investigate the capability of this technique… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)