- 期刊
- OpenAccess
The Pseudorandomness of Many-Round Lai-Massey Scheme
並列摘要
In this paper we prove beyond-birthday-bound for the (strong) pseudorandomness of many-round Lai-Massey scheme. Motivated by Hoang and Rogaway's analysis of generalized Feistel networks, we use the coupling technology from Markov chain theory and prove that for any ε ＞ 0, with enough rounds, the Lai-Massey scheme is indistinguishable from a uniform random permutation by any computationally unbounded distinguisher making at most q~N^(1-ε) combined chosen plaintext/ciphertext (CCA) queries, where N is the range size of the round function. Previous works by Vaudenay et al. and Yun et al. only proved the birthday-bound CCA security of Lai-Massey scheme.
延伸閱讀
- 范光治（2001）。A Study of Secondary Dominant and Its Expansion of Tonality。藝術學報，(67)，79-92。https://www.airitilibrary.com/Article/Detail?DocID=10213686-200102-x-67-79-92-a
- D.Berdel, & A.V.Berg (1989). Use of Parasympatholytics. Acta Paediatrica Sinica, 30(6), 378-388. https://www.airitilibrary.com/Article/Detail?DocID=00016578-198912-30-6-378-388-a
- Bosch, C., Kucera, J., & McKennon, K. (1991). NOTE ON QUASI-BOUNDED SETS. International Journal of Mathematics and Mathematical Sciences, 1991(), 413-414. https://doi.org/10.1155/S0161171291000522
- Galtier, T., Gupta, S., & Rychlik, I. (2010). Crossings of Second-Order Response Processes Subjected to LMA Loadingsa. Journal of Probability and Statistics, 2010(), 443-464. https://doi.org/10.1155/2010/752452
- Liu, Y. H. (2009). A Study of the Prosody in Seediq [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2009.02149