搜索结果: 1-15 共查到“SVP”相关记录18条 . 查询时间(0.065 秒)
南京农业大学农学院 《Molecular Plant》发表小麦遗传育种创新团队“A natural variation of an SVP MADS-box transcription factor in Triticum petropavlovskyi leads to its ectopic expression and contributes to elongated glume”（图）
小麦遗传育种 新疆稻穗麦
font style='font-size:12px;'>
2022/3/23
2021年5月26日，南京农业大学作物遗传与种质创新国家重点实验室小麦遗传育种创新团队在分子植物杂志（Molecular Plant）发表了“A natural variation of an SVP MADS-box transcription factor in Triticum petropavlovskyi leads to its ectopic expression and contr...
Faster Sieving Algorithm for Approximate SVP with Constant Approximation Factors
foundations lattice techniques
font style='font-size:12px;'>
2019/9/16
Abstract. There is a large gap between theory and practice in the complexities of sieving algorithms for solving the shortest vector problem in an arbitrary Euclidean lattice. In this paper, we work t...
以‘长富2号’苹果短枝顶芽为材料，采用同源重组法克隆得到成花抑制蛋白SHORT VEGETATIVE PHASE（SVP）家族的1个关键基因MdMADS50，开放阅读框（ORF）长度为675 bp，编码224个氨基酸。序列分析发现，该基因含有1个保守的MADS-box结构域和1个K-box结构域，属于MIKC型。氨基酸多重序列比对和系统进化分析表明，MdMADS50蛋白序列与苹果MdSVP具有较高...
On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm
Quantum Cryptanalysis Cyclotomic Ideal Lattices
font style='font-size:12px;'>
2019/3/4
The hardness of finding short vectors in ideals of cyclotomic number fields (hereafter, Ideal-SVP) can serve as a worst-case assumption for numerous efficient cryptosystems, via the average-case probl...
Approx-SVP in Ideal Lattices with Pre-processing
heuristic assumptions pre-processing phase outputs
font style='font-size:12px;'>
2019/2/28
We describe an algorithm to solve the approximate Shortest Vector Problem for lattices corresponding to ideals of the ring of integers of an arbitrary number field KK. This algorithm has a pre-process...
Short Stickelberger Class Relations and application to Ideal-SVP
Lattices Ideal-SVP Cryptanalysis
font style='font-size:12px;'>
2016/12/9
In this work, we generalize the previous result to general ideals. We show an efficient way of finding a close enough principal multiple of any ideal by exploiting the classical theorem that, in our s...
A Parallel Variant of LDSieve for the SVP on Lattices
lattices sieving algorithms parallel algorithms
font style='font-size:12px;'>
2016/12/9
In this paper, we propose a parallel implementation of LDSieve, a recently published sieving algorithm for the SVP, which achieves the best theoretical complexity to this day, on parallel shared-memor...
Orthogonalized Lattice Enumeration for Solving SVP
Lattice-based SVP sparse representations, enumeration
font style='font-size:12px;'>
2016/12/8
In 2014, the orthogonalized integer representation is presented
indepently by Dan Ding etc and Fukase etc to solve SVP respectively
by genetic algorithm and sampling technique, and both work have
a...
Solving Random Subset Sum Problem by $l_{p}$-norm SVP Oracle
SVP random subset sum problems lattice
font style='font-size:12px;'>
2016/1/26
A Genetic Algorithm for Searching Shortest Lattice Vector of SVP Challenge
Shortest Vector Problem (SVP) Genetic Algorithm Chromesome
font style='font-size:12px;'>
2016/1/9
In this paper, we propose a genetic algorithm for solving the shortest vector problem
(SVP) based on sparse integer representations of short vectors in lattices as chromesomes, which,
we prove, can ...
Lock-free GaussSieve for Linear Speedups in Parallel High Performance SVP Calculation
Linear Speedups High Performance Computing
font style='font-size:12px;'>
2016/1/7
Lattice-based cryptography became a hot-topic in the past years because it seems to be quantum immune, i.e., resistant to attacks operated with quantum computers. The security of lattice-based cryptos...
A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors
public-key cryptography Lattice-based Xryptography
font style='font-size:12px;'>
2016/1/5
In this paper, we propose a new phase-based enumeration algorithm based on two
interesting and useful observations for y-sparse representations of short lattice vectors in lattices
from SVP challeng...
Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP
spin-locks compare-and-swap
font style='font-size:12px;'>
2016/1/4
In this paper, we assess the practicability of HashSieve, a recently proposed sieving algorithm for the Shortest Vector Problem (SVP) on lattices, on multi-core shared memory systems. To this end, we ...
Parallel Gauss Sieve Algorithm : Solving the SVP in the Ideal Lattice of 128-dimensions
shortest vector problem lattice-based cryptography
font style='font-size:12px;'>
2014/3/12
In this paper, we report that we have solved the SVP Challenge over a 128-dimensional lattice in Ideal Lattice Challenge from TU Darmstadt, which is currently the highest dimension in the challenge th...
On the Efficacy of Solving LWE by Reduction to Unique-SVP
LWE Lattice-based cryptography FHE
font style='font-size:12px;'>
2014/3/7
We present a study of the concrete complexity of solving instances of the unique shortest vector problem (uSVP). In particular, we study the complexity of solving the Learning with Errors (LWE) proble...