The modulus problem for families of classes of curves in a circular annulus

1987 ◽  
Vol 38 (4) ◽  
pp. 2114-2124 ◽  
Author(s):  
G. V. Kuz'mina



2014 ◽  
Vol 11 (10) ◽  
pp. 1450084
Author(s):  
Gabriel Y. H. Avossevou ◽  
Bernadin D. Ahounou

In this paper we study the stationary scattering problem of the Aharonov–Bohm (AB) effect. To achieve this goal we construct a Hamiltonian from the most general representations of the Heisenberg algebra. Such representations are defined on a non-simply-connected manifold which we set as the flat circular annulus. By means of the von Neumann's self-adjoint extensions formalism, the scattering data are then provided. No solenoid is considered in this paper. The corresponding Hamiltonian is based on a topological quantum degree of freedom inherent in such representations. This variable stands for the magnetic vector gauge potential at quantum level. Our outcomes confirm the topological nature of this effect.



2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Fucai Luo ◽  
Fuqun Wang ◽  
Kunpeng Wang ◽  
Jie Li ◽  
Kefei Chen

Very recently, Costache and Smart proposed a fully homomorphic encryption (FHE) scheme based on the Learning with Rounding (LWR) problem, which removes the noise (typically, Gaussian noise) sampling needed in the previous lattices-based FHEs. But their scheme did not work, since the noise of homomorphic multiplication is complicated and large, which leads to failure of decryption. More specifically, they chose LWR instances as a public key and the private key therein as a secret key and then used the tensor product to implement homomorphic multiplication, which resulted in a tangly modulus problem. Recall that there are two moduli in the LWR instances, and then the moduli will tangle together due to the tensor product. Inspired by their work, we built the first workable LWR-based FHE scheme eliminating the tangly modulus problem by cleverly adopting the celebrated approximate eigenvector method proposed by Gentry et al. at Crypto 2013. Roughly speaking, we use a specific matrix multiplication to perform the homomorphic multiplication, hence no tangly modulus problem. Furthermore, we also extend the LWR-based FHE scheme to the multikey setting using the tricks used to construct LWE-based multikey FHE by Mukherjee and Wichs at Eurocrypt 2016. Our LWR-based multikey FHE construction provides an alternative to the existing multikey FHEs and can also be applied to multiparty computation with higher efficiency.



1951 ◽  
Vol 22 (12) ◽  
pp. 1499-1501 ◽  
Author(s):  
W. R. Smythe
Keyword(s):  


2020 ◽  
Vol 402 ◽  
pp. 132257
Author(s):  
Juan Sánchez Umbría ◽  
Marta Net ◽  
José M. Vega


1999 ◽  
Vol 79 (1) ◽  
pp. 201-214 ◽  
Author(s):  
Dimitrios Betsakos


2015 ◽  
Vol 91 (1) ◽  
Author(s):  
Yantao Yang ◽  
Rodolfo Ostilla-Mónico ◽  
Jiezhi Wu ◽  
Paolo Orlandi




Sign in / Sign up

Export Citation Format

Share Document