Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore an innovative enciphering scheme based on card shuffling in this 20-minute talk from Crypto 2012. Delve into the research by Viet Tung Hoang, Ben Morris, and Phillip Rogaway as they present their findings on a novel encryption method. Learn about concrete numbers, theoretical problems, and the concept of preserving encryption. Discover how this approach relates to social security numbers and card shuffles. Examine the 'swap or not' technique, pairing methods, and the theoretical setup behind this encryption scheme. Analyze concrete bounds and upper bound plots, followed by a comprehensive proof. Gain insights into confusion-diffusion ciphers and general domain ciphers. This talk offers a fascinating look at cutting-edge cryptographic research and its potential applications.
