專題演講 主講人：鄧利源教授 (Department of Mathematical Sciences, University of Memphis)

  • 事件日期: 2025-12-11
  • 演講者:  /  主持人:
這是一張圖片


題　目：Enhanced Secure And Fast Encryption (eSAFE) Scheme for Constructing Efficient and Secure Random Number Generators

主講人：鄧利源教授 (Department of Mathematical Sciences, University of Memphis)

時　間：114年12月11日(星期四)上午10:40-11:30
　　　　(上午10:20-10:40茶會於綜合一館428室舉行)

地　點：綜合一館427室

摘要
 
The main idea behind the recently proposed SAFE (Enhanced Secure And Fast Encryption) design is to transform two classical linear generators as baseline generators into a highly non-linear generator via a mutual table shuffling method with some ARX (Addition, Rotation, XOR) operations on selected table entries. SAFE generators have been shown to be highly effective allowing flexibility in the choice of the two baseline generators with known good statistical properties such as huge period length and high-dimensional equi-distribution. The only weakness is its generating efficiency when compared with the most popular generator, PCG64 (Permuted Congruential Generator), used in the Python research community. The eSAFE design is to enhance the SAFE design generating efficiency with a scheme to produce multiple possible output transformations at each iteration. In this talk, we show that the proposed eSAFE design has clear advantages over the popular PCG64 in terms of better statistical distribution properties, huge period length, parallelization, security, and better generating efficiency.

 

1/0