2016年安全计算数学理论国际研讨会日程表

2016年安全计算数学理论国际研讨会

International workshop on the mathematical theory of secure computation

2016年6月2-4日

福建·福州（Fujian·Fuzhou）

日

程

表

主办单位：福建师范大学数学与计算机科学学院

福建省网络安全与密码技术重点实验室

日程表

会议日期：2016年6月2日-6月4日

报到地点：福州阳光城希尔顿花园酒店（大堂）

会议地址：福州阳光城希尔顿花园酒店“仓山厅”（酒店二层）

联系人：林昌露（手机号：15280102192）

报告摘要

报告1: An improvement to the Hasse-Weil bound and applications

邢朝平（Nanyang Technological University, Singapore）

Motivated by applications to character sum, coding theory and sequences, number of zeros for trace of polynomials is considered. This talk is to introduce an improvement to the bound from the Hasse-Weil theorem.

报告2：对称密码研究进展

吴文玲（中国科学院软件所）

对称密码是许多安全系统的核心要素，是保障信息机密性、完整性和认证性的重要技术。对称密码主要包括流密码、分组密码、杂凑函数、消息鉴别码和认证加密算法，它们的设计理念相互借鉴且有融合发展的趋势，安全性分析评估相互促进，在某个点上有所突破，则会在各方面产生很大的影响力。近些年，依据学术界的研究进展和产业界的应用需求，国际标准化组织发布了轻量级密码标准ISO/IEC29192，欧洲和美国相继发起了SHA3、CAESAR等密码算法征集和评估活动，引领并推动着密码算法的研究和标准化。我国公布了商用密码杂凑函数SM3和流密码祖冲之（ZUC）算法。本报告首先介绍对称密码近五年的研究进展、我国对称密码的发展现状及近年来取得的重要成果，然后比较分析国内外对称密码的研究进展，最后展望对称密码的发展趋势。

报告3：穿刺程序的应用

唐飞（重庆邮电大学）

不可区分混淆器（indistinguishability obfuscation, iO）是近年来的研究热点。Sahai和Waters在STOC 2014会议上基于不可区分混淆器设计了一种名为“穿刺程序”（punctured program）的技术。此外，他们基于这一技术构造了多种密码体制，包括公钥加密、可否认加密、密钥封装、数字签名、不经意传输、非交互式零知识证明等。本报告将主要介绍穿刺程序的定义，同时也将介绍如何基于这一技术构造不同性质的密码体制，如标准模型下的常数规模的环签名体制等。

报告4：Adjacency, signless Laplacian and Laplacian H-eigenvalues of hypergraphs

陆玫（清华大学）

In this talk, we first introduction the definitions of the H-eigenvalues of adjacency, signless Laplacian and Laplacian tensors ofhypergraphs. Some results about the H-eigenvalues of adjacency, signlessLaplacian and Laplacian tensors of loose path, hyperstar and sunflower were given.

报告5：On automorphism groups of cyclotomic function fields over finite fields

马立明（扬州大学）

The Weierstrass semigroup of the unique totally ramified place in the cyclotomic function field with modulus $x^{n+1}$ over the rational function field $\mathbb{F}_q(x)$is explicitly computed for each positive integer $n$. As a consequence, the automorphism groups of cyclotomic function fields with modulus $x^{n+1}$ over the finite fields can be determined. Similarly, the automorphism groups of the cyclotomic function fields with modulus $P$ where $P$ is an irreducible polynomial of degree two are investigated as well.

报告6：The center of the quantized enveloping algebra

李立斌（扬州大学）

Let g be a complex simple finite dimensional Lie algebra and Uq(g) the quantized enveloping algebra in Jantzen's sense with q being generic. As a continuous work on the center of the quantized enveloping algebra of finite dimensional semisimple Lie algebra , we prove that the center Z(Uq(g)) of the quantum group Uq(g) is isomorphic to a monoid algebra, and Z(Uq(g)) is a polynomial algebra if and only if g is of type A1, Bn, Cn, D2k+2, E7, E8, F4 and G2. It turns out that when g is of type Dn with n odd then Z(Uq(g)) is isomorphic to a quotient algebra of polynomial algebra with n+1 variables and one relation, and while when g is of type E6 then Z(Uq(g)) is isomorphic to a quotient algebra of polynomial algebra with 14 variables and eight relations.

报告7：On lattice-based algebraic feedback shift registers synthesis algorithms for multisequences

王丽萍（中国科学院信息工程研究所）

In this talk we show that algebraic feedback shift registers synthesis problems over both some residue class rings and quadratic integer rings for multisequences are reduced to the successive minima problem in lattice theory. Therefore they can be solved by polynomial-time algorithms whenthe number of multiple sequences is fixed.

报告8：The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields

常祖领（郑州大学）

Abstract: The cycle structure of an LFSR contains all the distinct cycles generated by this LFSR. It has important applications in many domains. We determine the cycle structure of linear feedback shift register with arbitrary monic characteristic polynomial over any finite field. For each cycle, a method to find a state and a new way to represent the state are proposed.

报告9：关于Legendre-Sidelnikov序列和two-prime Sidelnikov序列的改进研究

叶智钒（福建师范大学）

具有良好伪随机性质的序列在编码、密码、通信等领域应用广泛。基于数论函数可以构造许多具有良好性质的伪随机序列。在Legendre-Sidelnikov序列和two-prime Sidelnikov序列的基础上，我们改进了上述序列的平衡性，并进一步地分析了改进后序列的自相关性质。