The Short Vegetative Phase (SVP) gene is a key regulator for floral transition and development. Although SVP-like genes have been identified characterized in many plant species, their orthologs bamboo not characterized. In this study, one SVP homolog was isolated from lei based on the P. edulis transcriptome database designated as PvSVP2. Phylogenetic analysis showed that PvSVP2 closely related...

Given an LLL-basis B of dimension n = hk we accelerate slide-reduction with blocksize k to run under a reasonable assumption in 1 6 nh log1+ε α local SVP-computations in dimension k, where α ≥ 4 3 measures the quality of the given LLL-basis and ε is the quality of slide-reduction. If the given basis B is already slide-reduced for blocksize k/2 then the number of local SVP-computations for slide...

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 guarantee finding the shortest lattice vector under a Markov chain analysis. Moreover, we also suggest some improvements by introducing heuristic techniques: local search and heuristic pruning. The e...

Efficient adhesion of gas bubbles in aqueous environments has great application potentials various gas-related processes, especially wastewater treatment. In previous research, much attention been paid to the design underwater transport platforms, however, bubble abilities them are explored insufficiently. Herein, we investigated superhydrophobic V-shaped pattern (SVP) and a designed tapered gr...

In this paper, we prove that finding the approximate shortest vector with length in [λ1, γλ1] could be reduced to GapSVP. We also prove that shortest vector problem could also be reduced to GapSVP with a small gap. As the complexity of uSVP is not very clear, we improve crurrent complexity results[19] of uSVP, proving uSVP could be reduced from SVP deterministically. What’s more, we prove that ...

Recently, it was shown that angular locality-sensitive hashing (LSH) can be used to significantly speed up lattice sieving, leading to a heuristic time complexity for solving the shortest vector problem (SVP) of 2 (and space complexity 2. We study the possibility of applying other LSH methods to sieving, and show that with the spherical LSH method of Andoni et al. we can heuristically solve SVP...

The security of lattice-based cryptosystems is determined by the performance of practical implementations of, among others, algorithms for the Shortest Vector Problem (SVP). In this paper, we conduct a comprehensive, empirical comparison of two SVP-solvers: ListSieve and GaussSieve. We also propose a practical parallel implementation of ListSieve, which achieves super-linear speedups on multi-c...

Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic scheme related to L. This paper concerns short vectors for lattices with gaps. In the first part, a λ2-gap estimation of LWE lattices with cryptographic significance is given. For some γ′, a better reduction from BDDγ′ to uSV Pγ is obtained in t...

1 Electronic Structure Calculations All electronic structure calculations were carried out with the ORCA program1. Density functional theory calculations on the BP862–6 (methanol and the tripeptide) and BLYP2–4,7 (only tripeptide) level of theory were performed using the def2-SVP basis8 set and the RI approximation with the def2-SVP/J auxilary basis set.9,10 B2PLYP11 computations (n-alkanes) us...

We propose a cheap micropayment scheme based on reasonable requirements. It is exible in the sense that many security options are possible depending on the policy of the involved participants. We avoid large data storage, heavy computations. The scheme is software based for the user and hardware based for the service provider. Possibilities of having software-based solution for both are also pr...