一种基于洗牌的加密方案
An Enciphering Scheme Based on a Card Shuffle
摘要:
我们介绍了交换或不洗牌,并表明该技术产生了一种新的方法来转换伪随机函数(PRF)到伪随机置换(PRP)(或者,或者,直接建立一个混淆/扩散块密码)。然后,我们证明,交换或不具有很好的定量安全界限,给出了一个Luby-Rackoff型的结果,确保安全性(假设一个理想的轮函数),以对抗查询的数量是接近建设的域的大小。Swap-or-not提供了一种直接的解决方案,用于构建小域密码并实现格式保持加密,从而为加密信用卡号码的实用方案提供已知的最佳界限。交换或不交换的分析是基于马尔可夫链的混合时间理论。
英文摘要:
We introduce the swap-or-not shuffle and show that the technique gives rise to a new method to convert a pseudorandom function (PRF) into a pseudorandom permutation (PRP) (or, alternatively, to directly build a confusion/diffusion blockcipher). We then prove that swap-or-not has excellent quantitative security bounds, giving a Luby-Rackoff type result that ensures security (assuming an ideal round function) to a number of adversarial queries that is nearly the size of the construction's domain. Swap-or-not provides a direct solution for building a small-domain cipher and achieving format-preserving encryption, yielding the best bounds known for a practical scheme for enciphering credit-card numbers. The analysis of swap-or-not is based on the theory of mixing times of Markov chains.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。