报告题目: “The transparency order of (n,m)-functions”报告时间:2023年10月24日 9:00-12:00报告地点:理科楼B211主持人:张磊报告摘要:The transparency order (denoted by TO) is an useful measure of the robustness of (n, m)-functions to Differential Power Analysis (DPA). At first, we resolve this open problem which (n, m)- functions reach the upper bound on TO for odd n. We also investigate the tightness of upper and lower bounds related to RTO (redefined transparency order) and derive some relationships between RTO and main crypto