This paper takes further insight into the sparse geometry which offers a larger array aperture than uniform linear array(ULA)with the same number of physical sensors.An efficient method based on closed-form robust Chi...This paper takes further insight into the sparse geometry which offers a larger array aperture than uniform linear array(ULA)with the same number of physical sensors.An efficient method based on closed-form robust Chinese remainder theorem(CFRCRT)is presented to estimate the direction of arrival(DOA)from their wrapped phase with permissible errors.The proposed algorithm has significantly less computational complexity than the searching method while maintaining similar estimation precision.Furthermore,we combine all phase discrete Fourier transfer(APDFT)and the CFRCRT algorithm to achieve a considerably high DOA estimation precision.Both the theoretical analysis and simulation results demonstrate that the proposed algorithm has a higher estimation precision as well as lower computation complexity.展开更多
We propose an unbounded fully homomorphic encryption scheme, i.e. a scheme that allows one to compute on encrypted data for any desired functions without needing to decrypt the data or knowing the decryption keys. Thi...We propose an unbounded fully homomorphic encryption scheme, i.e. a scheme that allows one to compute on encrypted data for any desired functions without needing to decrypt the data or knowing the decryption keys. This is a rational solution to an old problem proposed by Rivest, Adleman, and Dertouzos [1] in 1978, and to some new problems that appeared in Peikert [2] as open questions 10 and open questions 11 a few years ago. Our scheme is completely different from the breakthrough work [3] of Gentry in 2009. Gentry’s bootstrapping technique constructs a fully homomorphic encryption (FHE) scheme from a somewhat homomorphic one that is powerful enough to evaluate its own decryption function. To date, it remains the only known way of obtaining unbounded FHE. Our construction of an unbounded FHE scheme is straightforward and can handle unbounded homomorphic computation on any refreshed ciphertexts without bootstrapping transformation technique.展开更多
A new method of embedding and detecting a joint watermarking is proposed. Itapplies the asmuth-bloom secret sharing scheme, which is based on CRT (Chinese remainder theorem)theorem, to the digital watermarking technol...A new method of embedding and detecting a joint watermarking is proposed. Itapplies the asmuth-bloom secret sharing scheme, which is based on CRT (Chinese remainder theorem)theorem, to the digital watermarking technology. On the base of describing the watermarkingembedding proceeding and analyzing the watermarking detection proceeding, a series of experiments isdone. The experiments emphasize on the method's robust proving and security analysis. And theexperiments show that the method can resistthe attacks of JPEG compress, geometry, noise and grayadjusting. The results of the experiments show that the method has a nice recognition of copyrightfor joint ownership.展开更多
利用中国剩余定理研究了环Z_k上循环码及其对偶码,其中k=（multiply from （p_i） i=1 to s）~m,p_i表示不同的素数,m是一个正整数,并且p_i不能整除码长n,给出了一个非平凡循环自对偶码存在的充要条件,得到了中国积循环码最小距离的上界...利用中国剩余定理研究了环Z_k上循环码及其对偶码,其中k=（multiply from （p_i） i=1 to s）~m,p_i表示不同的素数,m是一个正整数,并且p_i不能整除码长n,给出了一个非平凡循环自对偶码存在的充要条件,得到了中国积循环码最小距离的上界,并且确定了中国积循环码的秩和最小生成集.展开更多
基金supported by the Fund for Foreign Scholars in University Research and Teaching Programs(the 111 Project)(B18039)
文摘This paper takes further insight into the sparse geometry which offers a larger array aperture than uniform linear array(ULA)with the same number of physical sensors.An efficient method based on closed-form robust Chinese remainder theorem(CFRCRT)is presented to estimate the direction of arrival(DOA)from their wrapped phase with permissible errors.The proposed algorithm has significantly less computational complexity than the searching method while maintaining similar estimation precision.Furthermore,we combine all phase discrete Fourier transfer(APDFT)and the CFRCRT algorithm to achieve a considerably high DOA estimation precision.Both the theoretical analysis and simulation results demonstrate that the proposed algorithm has a higher estimation precision as well as lower computation complexity.
文摘We propose an unbounded fully homomorphic encryption scheme, i.e. a scheme that allows one to compute on encrypted data for any desired functions without needing to decrypt the data or knowing the decryption keys. This is a rational solution to an old problem proposed by Rivest, Adleman, and Dertouzos [1] in 1978, and to some new problems that appeared in Peikert [2] as open questions 10 and open questions 11 a few years ago. Our scheme is completely different from the breakthrough work [3] of Gentry in 2009. Gentry’s bootstrapping technique constructs a fully homomorphic encryption (FHE) scheme from a somewhat homomorphic one that is powerful enough to evaluate its own decryption function. To date, it remains the only known way of obtaining unbounded FHE. Our construction of an unbounded FHE scheme is straightforward and can handle unbounded homomorphic computation on any refreshed ciphertexts without bootstrapping transformation technique.
文摘A new method of embedding and detecting a joint watermarking is proposed. Itapplies the asmuth-bloom secret sharing scheme, which is based on CRT (Chinese remainder theorem)theorem, to the digital watermarking technology. On the base of describing the watermarkingembedding proceeding and analyzing the watermarking detection proceeding, a series of experiments isdone. The experiments emphasize on the method's robust proving and security analysis. And theexperiments show that the method can resistthe attacks of JPEG compress, geometry, noise and grayadjusting. The results of the experiments show that the method has a nice recognition of copyrightfor joint ownership.
文摘利用中国剩余定理研究了环Z_k上循环码及其对偶码,其中k=（multiply from （p_i） i=1 to s）~m,p_i表示不同的素数,m是一个正整数,并且p_i不能整除码长n,给出了一个非平凡循环自对偶码存在的充要条件,得到了中国积循环码最小距离的上界,并且确定了中国积循环码的秩和最小生成集.
