检索结果-内蒙古大学图书馆

International Conference on Information Science and Cloud computing (ISCC)

作者： Xinkai Yan Guiming Wu Dong Wu Fang Zheng Xianghui Xie State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China State Key Lab. of Math. Eng. & Adv. Comput. Wuxi China

Modular multiplication is one of the most important operations in the public key cryptographic algorithms. In order to design a high-performance modular multiplier, we present a novel hybrid Montgomery modular multiplier over GF(p) on FPGAs, which employs Karatsuba and Knuth multiplication algorithms in different levels to implement large integer multiplication. A 9-stage pipeline full-word multiplier is proposed for the 256-bit multiplication with 4-level recursion. The performance of our modular multiplier is improved through optimizing the pipeline and reducing carry-chain latency of the modular adder. On average, our modular multiplier can perform one 256-bit modular multiplication in 3 cycles. We can integrate 13 modular multipliers on a Xilinx Virtex-6 V6VSX475T FPGA. The experimental results show that the throughput of 856.9 million modular multiplications per second can be achieved and the hybrid Montgomery modular multiplier has an outstanding performance in the situations which need continuous multiplications.

关键词： Adders Pipelines Digital signal processing Field programmable gate arrays Algorithm design and analysis Elliptic curve cryptography Table lookup

来源：评论

学校读者我要写书评

暂无评论

Research of function disable energy-saving hardware trojan detection technology

引用

Energy Education Science and Technology Part A: Energy Science and Research 2013年第2期31卷 1035-1040页

作者： Xiao, Da Zhu, Yuefei Liu, Shengli Li, Qinbao National Digital Switching System Engineering and Technological Research Center Zhengzhou 450002 China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou 450002 China

Aiming at the function disable Energy-saving hardware Trojan detection application requirements, has resarech the Energy-saving hardware Trojan generation principle and the trigger mechanism deeply, gives the function disable hardware Trojan definition, hase induced the function disable hardware Trojan basic characteristics. And then, has builded the function disablehardware Trojan detection model, put forward the function disable Energy-saving hardware Trojan detection algorithm, and it is proved that the detection algorithm is correct. At last has design function disable Energy-saving hardware Trojans in FPGA chip, after simulation and testing the chip, has detected function disable Energy-saving hardware Trojan successfuly, which verified the feasibility of the algorithm. © Sila Science.

关键词： Energy conservation

来源：评论

学校读者我要写书评

暂无评论

Fixing the sender-equivocable encryption scheme in eurocrypt 2010

Fixing the sender-equivocable encryption scheme in eurocrypt...

引用

5th IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2013

作者： Huang, Zhengan Liu, Shengli Qin, Baodong Chen, Kefei Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China College of Computer Science and Technology Southwest University of Science and Technology Mianyang China School of Science Hangzhou Normal University Hangzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China

ISBN: (纸本)9780769549880

There are two main approaches to achieve selective opening chosen-cipher text security (SO-CCA security): lossy encryption (including all-but-many lossy trapdoor functions) and sender-equivocable encryption. The second approach was proposed in Euro crypt 2010 by Fehr et al., who proved that sender equivocability under chosen-cipher text attacks (NC-CCA security) implies SO-CCA security. They also proposed a new primitive called "cross-authentication code", and used it to construct a public-key encryption (PKE) scheme (the FHKW scheme) achieving NC-CCA security. However, recently in PKC 2013, Huang et al. pointed out that the properties of cross-authentication code cannot guarantee the NC-CCA security of the FHKW scheme, i.e., the security proof of the FHKW scheme is flawed. In this paper, we propose the notion of "strong cross-authentication code", which helps to fix the security proof of the FHKW scheme. This strong notion captures the ability of a cross-authentication code to efficiently generate a new key, based on all the other keys and the cross-authentication tag, such that the new key is statistically indistinguishable from the original key. With this code as a building block, we construct a new version of the FHKW scheme, and prove it to be NC-CCA secure for multi-bit plaintexts. Our work makes possible the instantiation of simulation-based SO-CCA secure PKE with a multi-bit message space from NC-CCA secure PKEs. © 2013 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Operand stack dependence based Java static software birthmark

Operand stack dependence based Java static software birthmar...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Yong Wang Fenlin Liu Zheng Zhao Bin Lu Xin Xie Zhengzhou Institute of Information Science and Technology Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781467352512

Due to the problem of semantic lost when extracting birthmark with k-gram algorithm, the operand stack dependence based static software birthmark is proposed in this paper. Before the birthmark extraction, the stack dependence bytecode fragments are got through analysis the stack dependence relation of stack behaviors in Java program. The birthmark is comprised of the stack dependence bytecode fragments and their occurrence frequencies in program. The experimental results show that the proposed birthmark has good credibility and robustness, and the performance is improved.

关键词： Software Java Resilience Semantics Heuristic algorithms Resistance Vectors

来源：评论

学校读者我要写书评

暂无评论

A New Algorithm to Exploit Superword Level Parallelism

A New Algorithm to Exploit Superword Level Parallelism

引用

IEEE International Symposium on Dependable, Autonomic and Secure computing (DASC)

作者： Peng Liu Rong-cai Zhao Wei Gao Shuai Wei State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China National Digital Switching System Engineering & Technology Research Center Zhengzhou China

Nowadays SIMD extensions became ubiquitous for computational platform, being widely used in signal processing, multimedia, and scientific applications. However, compilers still have difficult in vectorizing some applications, such as computations on non-contiguous and especially interleaved data, and loop nest for which inner loops that carry all the dependencies and external loops with strided memory accesses. In order to solve these problems, we adopt Isomorphic statements Grouping (ISG) after extending group following UD and DU chains, which group isomorphic computation statements that perform the same operation. And correspondingly, we generate vector permutation instructions according to the target ISA SIMD instructions at the SIMD code generation phase. This approach has been implemented in a compiler based on Open64 which translate C source program to C source program with SIMD intrinsic functions. Experiments with this compiler show that ISG Super Level Parallelism(ISG-SLP) can be used to compile a number of real-world kernels, achieving up to 3.11 speedup.

关键词： Vectors Arrays Finite impulse response filters Program processors Indexes Algorithm design and analysis Image processing

来源：评论

学校读者我要写书评

暂无评论

G Bytes Data Hiding Method Based on Cluster Chain Structure

G Bytes Data Hiding Method Based on Cluster Chain Structure

引用

第七届中国可信计算与信息安全学术会议

作者： NIU Xiaopeng LI Qingbao WANG Wei WANG Yulong State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou 450002HenanChina PLA Information Engineering University Zhengzhou 450001HenanChina

Protecting the security of sensitive information has become a matter of great concern to *** hiding tech nique solves the problem to some extent, but still, some short comings remain for *** improve the capability of hid ing huge data file in disk with high *** this paper, we propose a novel approach called CryptFS, which is achieved by utilizing the file access mechanism and modifying the cluster chain structure to hide *** can quickly hide data file with G bytes size in less than *** time used for hiding and recovering data is irrelevant to the size of data file, and the reli ability of the hidden file is high, which will not be overlaid by new created file and disk defragment.

关键词： data hiding file system cluster chain index entry efficiency robustness

来源：评论

学校读者我要写书评

暂无评论

Creating cluster states in flux qubits with XY-type exchange interactions

引用

Physical Review A 2013年第4期88卷 044303-044303页

作者： Zu-Rong Zhang Chun-Yan Li Chun-Wang Wu Hong-Yi Dai Cheng-Zu Li College of Science National University of Defense Technology Changsha 410073 People's Republic of China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou 450000 People's Republic of China

We propose a theoretical scheme to generate flux-qubit clusters using XY interactions. In our scheme, two neighboring qubits are coupled via a dc superconducting quantum interference device (SQUID). All flux qubits are always biased at their optimal points. The XY interaction can be controlled by the bias current applied to the SQUID for the two coupled qubits with the same resonance frequencies or by the frequency of a microwave pulse applied to the SQUID for the two coupled qubits with unequal resonance frequencies. The generation of a d-dimensional cluster state needs only 2d steps. Existing technology allows us to rapidly modulate the bias current and easily control the frequency of the pulse, and thus our scheme is experimentally feasible.

关键词： Creating cluster states Scheme Bias currents Countries (nations) flux Clusters resonant frequencies microwave pulse Exchange interaction Superconducting quantum interference devices

来源：评论

学校读者我要写书评

暂无评论

Practical decoy-state measurement-device-independent quantum key distribution

引用

Physical Review A 2013年第5期87卷 052329-052329页

作者： Shi-Hai Sun Ming Gao Chun-Yan Li Lin-Mei Liang Department of Physics National University of Defense Technology Changsha 410073 People's Republic of China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou 450002 People's Republic of China State Key Laboratory of High Performance Computing National University of Defense Technology Changsha 410073 People's Republic of China

Measurement-device-independent quantum key distribution (MDI-QKD) is immune to all the detection attacks; thus when it is combined with the decoy-state method, the final key is unconditionally secure, even if a practical weak coherent source is used by Alice and Bob. However, until now, the analysis of decoy-state MDI-QKD with a weak coherent source is incomplete. In this paper, we derive, with only vacuum+weak decoy state, some tight formulas to estimate the lower bound of yield and the upper bound of error rate for the fraction of signals in which both Alice and Bob send a single-photon pulse to the untrusted third party Charlie. The numerical simulations show that our method with only vacuum+weak decoy state can asymptotically approach the theoretical limit of the infinite number of decoy states. Furthermore, the statistical fluctuation due to the finite length of date is also considered based on the standard statistical analysis.

关键词： QUANTUM states COHERENT states PHOTONS COMPUTER simulation FLUCTUATIONS (Physics) DISTRIBUTION (Probability theory)

来源：评论

学校读者我要写书评

暂无评论

Parallel constraint solution method combining search and consistency

引用

Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (Science and Technology) 2013年第SUPPL.2期44卷 268-272页

作者： Cao, Yan Wang, Qingxian Wei, Qiang Yin, Zhongxu State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou 450001 China

Due to continuous development of multi-core hardware architectures, how to make time-consuming constraint solution have the ability of running in parallel is particularly important. Based on analyzing the relation between backtracking search and consistency technology, the constraint solution method combing parallel search and parallel consistency was proposed. In parallel consistency, a centralized storage-based parallel consistency model was proposed for global constraints to cut off the search space and optimize the search process. The division of search space was studied. Scheduling search space into different processors ensures disjoint and complete in parallel search. The experiments represent that the method is feasible and has higher speedup.

关键词： Consistency Constraint solution Parallelization Search

来源：评论

学校读者我要写书评

暂无评论

Parallelizing Sparse LU Decomposition on FPGAs

Parallelizing Sparse LU Decomposition on FPGAs

引用

11th International Conference on Field-Programmable Technology (FPT)

作者： Wu, Guiming Xie, Xianghui Dou, Yong Sun, Junqing Wu, Dong Li, Yuan State Key Laboratory of Mathematical Engineering and Advanced Computing China

ISBN: (纸本)9781467328463;9781467328449

Sparse LU decomposition is the core computation in the direct method that solves sparse systems of linear equations. Only little work has been conducted on parallelizing it on FPGAs. In this paper, we study parallelization strategies for sparse LU decomposition on FPGAs. We first analyze how to parallelize the right-looking algorithm and find that this algorithm is not suitable for FPGAs. Then the left-looking algorithm is analyzed and considered as better candidate than the right-looking version. Our design derived from the left-looking algorithm is based on a simple yet efficient parallel computational model for FPGAs. Our design mainly consists of multiple parallel processing elements (PEs). A total of 14 PEs can be integrated into a Xilinx Virtex-5 XC5VLX330. Unlike related work, where their designs are applied to sparse matrices from particular application domains, our hardware design can be applied to any symmetric positive definite or diagonally dominant matrices.

关键词： Sparse matrices Random access memory Algorithm design and analysis Parallel processing Field programmable gate arrays Matrix decomposition Hardware

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：