ID 原文 译文
22755 配对友好椭圆曲线在基于配对的密码系统中起关键作用。 Pairing-friendly elliptic curves play a vital role in pairing-based cryptography.
22756 这类曲线的构造不仅极大影响实现效率，更关系到系统安全。 The construction of such curves not only influences the implementation efficiency, but concerns the security of system.
22757 虽然目前已提出很多构造方法，但几乎都依赖穷尽搜索。 Though many methods for constructing such curves are introduced, most of which rely on exhaustive search.
22758 该文提出一种构造该类曲线的系统方法，将寻找配对友好曲线问题转化到解方程，从而避免了穷尽搜索，并设计出具体算法。 In this paper, a new systematic method is proposed for constructing such curves which converts the problem to solving equation systems, instead of exhaustive searching.
22759 最后，将该算法应用到寻找嵌入次数为 5,8,10 和 12 的配对友好曲线中，发现所有类型的椭圆曲线族都可由该方法统一得到，包括完全族、可变判别式的完全族和稀疏族。 The utility of the method is demonstrated by surveying such elliptic curves with embedding degree 5, 8, 10 and 12, and all kinds of families can be explained via the proposed method including complete families, complete families with variable discriminant and sparse families.
22760 特别地，还找到了新的椭圆曲线族。 Specifically, a new family of elliptic curves is found.
22761 针对虚拟网映射算法环境适应度低、拓扑关联性较差且映射开销较大的问题，该文提出一种环境自适应的拓扑联合感知虚拟网映射算法。 In order to solve the problem of low environmental adaptability, poor topology correlation and large embedding cost in virtual network embedding algorithms, an environment adaptive and joint topology aware virtual network embedding algorithm is proposed.
22762 首先提出一种加权相对熵排序方法对具有多指标的节点进行量化处理，依环境变化赋予节点指标不同的权值； At first, a ranking method of weighted relative entropy is proposed to quantify the nodes with multi-index and the weights are changed according to different environment.
22763 在虚拟节点排序阶段采用加权相对熵和广度优先搜索算法双重排序，物理节点排序中引入就近度与加权相对熵算法配合使用，实现了对虚拟拓扑和物理拓扑的联合感知； The weighted relative entropy and breadth first search algorithm are both used in virtual node ranking phase, the nearest degree is introduced into physical node ranking and all these are used to achieve the joint awareness to the virtual topology and physical  topology.
22764 最后利用 k-最短路径算法完成虚拟链路映射。 Finally, the k-shortest path algorithm is introduced into virtual link embedding.