检索结果-南通市图书馆

The Generalization of the chinese remainder theorem

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2002年第3期18卷 531-538页

作者： Li Rong YU Digital Communication. Technical Research Institute. Beijing 100083. P. R. China Li Bo LUO Department of Mathematics. Beijing Normal University. Beijing 100875. P. R. China Guangdong Women’s Professional College. Guangdong 510300. P. R. China Digital Communication Technical Research Institute Beijing P. R. China Department of Mathematics Beijing Normal University Beijing P. R. China Guangdong Women's Professional College Guangdong P. R. China

We generalize the chinese remainder theorem. use it to study number theory models, compare and analyse several number theory theorems in non-standard number theory models.

关键词： Non-standard number THN model chinese remainder theorem

An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and chinese remainder theorem

在线全文

学校读者我要写书评

暂无评论

Journal of Information Security 2023年第4期14卷 366-395页

作者： Zhiyong Zheng Fengxia Liu Kun Tian Engineering Research Center of Ministry of Education for Financial Computing and Digital Engineering Henan Academy of Sciences Renmin University of China Beijing China Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing Institute of Artificial Intelligence Beijing China

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.

关键词： Fully Homomorphic Encryption Ideal Lattices chinese remainder theorem General Compact Knapsacks Problem

An efficient ranging method based on chinese remainder theorem for RIPS measurement

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2010年第6期53卷 1233-1241页

作者： WANG Chen , YIN QinYe & WANG WenJie Ministry of Education Key Lab for Intelligent Networks and Network Security, Xi’an Jiaotong University, Xi’an 710049, China Ministry of Education Key Lab for Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an China

The radio interferometric positioning system(RIPS) measures the phase difference of the interference signal to provide high accuracy and at the same time maintain simple hardware configuration for wireless sensor ***, it suffers from phase ambiguity problem because of the periodicity of phase, which makes it hard to determine the actual distance difference only from a single phase *** solve the problem, RIPS makes multiple measurements at different frequencies so as to determine the distance difference from multiple ***, this is a computationally intensive searching process and not suitable for energyconstrained wireless sensor *** this paper, we introduce the chinese remainder theorem(CRT) to RIPS to solve the phase ambiguity ***, we utilize some properties of the coefficients in the CRT algorithm to avoid the over-sensitivity of the traditional CRT, which increases the robustness of the *** apply this robust CRT algorithm to the ranging process which calculates the distance difference directly from a closed-form equation and therefore reduces the response time and the energy consumption of the ranging procedure.

关键词： ranging phase ambiguity chinese remainder theorem robustness energy efficiency wireless sensor networks

A simple construction of CRT-based ideal secret sharing scheme and its security extension based on common factor

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2022年第1期16卷 155-163页

作者： Lei WU Fuyou MIAO Keju MENG Xu WANG School of Computer Science and Technology University of Science and Technology of ChinaHefei230026China

Secret sharing(SS)is part of the essential techniques in cryptography but still faces many challenges in efficiency and ***,SS schemes based on the chinese remainder theorem(CRT)are either low in the information rate or complicated in *** solve the above problems,1)a simple construction of an ideal(t,n)-SS scheme is proposed based on CRT for a polynomial *** with Ning’s scheme,it is much more efficient in generating n pairwise coprime modular polynomials during the scheme construction ***,Shamir’s scheme is also a special case of our *** further improve the security,2)a common-factor-based(t,n)-SS scheme is proposed in which all shareholders share a common polynomial *** enables both the verification of received shares and the establishment of a secure channel among shareholders during the reconstruction *** a result,the scheme is resistant to eavesdropping and modification attacks by outside adversaries.

关键词： ideal secret sharing chinese remainder theorem coprime polynomial generation common factor

PUMTD:Privacy-Preserving User-Profile Matching Protocol in Social Networks

在线全文

学校读者我要写书评

暂无评论

China Communications 2022年第6期19卷 77-90页

作者： Jianhong Zhang Haoting Han Hongwei Su Zhengtao Jiang Changgen Peng School of Information Sciences and Technology North China University of TechnologyBeijing 100043China Key Laboratory of Cryptography of Zhejiang Province Hangzhou Normal UniversityHangzhou 311121China Guizhou Provincial Key Laboratory of Public Big Data Guizhou UniversityGuiyang 550025China School of Computer and Cyber Sciences Communication University of ChinaBeijing 100025China

User profile matching can establish social relationships between different users in the social *** the user profile is matched in plaintext,the user's privacy might face a security *** there exist some schemes realizing privacypreserving user profile matching,the resource-limited users or social service providers in these schemes need to take higher computational complexity to ensure the privacy or matching of the *** overcome the problems,a novel privacy-preserving user profile matching protocol in social networks is proposed by using t-out-of n servers and the bloom filter technique,in which the computational complexity of a user is reduced by applying the chinese remainder theorem,the matching users can be found with the help of any t matching servers,and the privacy of the user profile is not ***,if at most t-1 servers are allowed to collude,our scheme can still fulfill user profile privacy and user query ***,the performance of the proposed scheme is compared with the other two schemes,and the results show that our scheme is superior to them.

关键词： user profile matching chinese remainder theorem privacy-preserving query privacy

Research and design of CRT-based homomorphic ciphertext database system

在线全文

学校读者我要写书评

暂无评论

High-Confidence Computing 2022年第4期2卷 1-7页

作者： De Zhao Zhenzhen Li Haiyang Ding Zhenzhen Zhang Zichen Li College of Information Engineering Beijing Institute of Graphic CommunicationBeijingChina Digital Copyright Protection Technology Research Center Beijing Institute of Graphic CommunicationBeijingChina

The cloud’s storage and query of private information have the cryptographic scholar due to the proliferation of cloud *** the traditional query mode,the private information stored in the cloud is at risk of being *** order to solve this problem,a cloud ciphertext database system based on homomorphic encryption is a valid *** paper presents a new cloud ciphertext database system model,which is based on the existing ciphertext database mode research and homomorphic *** paper also implements a ciphertext database system based on a CRT-based additive homomorphic scheme according to the *** theoretical analysis,the model is CPA-level safe and *** experimental results show that users can correctly query and download the data in the ciphertext database on the untrusted cloud server through the model,and it has efficiency advantages.

关键词： Ciphertext database Homomorphic encryption chinese remainder theorem

Application of Polynomial Interpolation in the chinese remainder Problem

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Mathematical Research with Applications 2017年第1期37卷 90-96页

作者： Tianxiao HE Scott MACDONALD Peter J.-S.SHIUE Department of Mathematics Illinois Wesleyan University Math Learning Center University of Nevada Las Vegas Department of Mathematical Sciences University of Nevada

This paper presents an application of polynomial interpolation in the solution of the chinese remainder Problem for bother integers and polynomials.

关键词： chinese remainder problem chinese remainder theorem Lagrange interpolation Newton interpolation

chinese remainder Codes

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Southwest Jiaotong University(English Edition) 2004年第1期12卷 73-78页

作者：张爱丽刘秀峰靳蕃 Department of Applied Mathematics School of Computer and Communication Engineering

chinese remainder Codes are constructed by applying weak block designs and chinese remainder theorem of ring theory. The new type of linear codes take the congruence class in the congruence class ring R/I 1∩I 2∩...∩I n for the information bit, embed R/J i into R/I 1∩I 2∩...∩I n, and asssign the cosets of R/J i as the subring of R/I 1∩I 2∩...∩I n and the cosets of R/J i in R/I 1∩I 2∩...∩I n as check lines. There exist many code classes in chinese remainder Codes, which have high code rates. chinese remainder Codes are the essential generalization of Sun Zi Codes.

关键词： Block design chinese remainder theorem Error-correcting codes Sun Zi Codes

Cryptanalysis of a Type of CRT-Based RSA Algorithms

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2008年第2期23卷 214-221页

作者：秦宝东李明孔凡玉 College of Computer Science and Technology Southwest University of Science and TechnologyMianyang 621010China Institute of Network Security Shandong UniversityJinan 250100China Key Laboratory of Cryptographic Technology and Information SecurityJinan 250100China

It is well known that the chinese remainder theorem （CRT） can greatly improve the performances of RSA cryptosystem in both running times and memory requirements. However, if the implementation of CRT-based RSA is careless, an attacker can reveal some secret information by exploiting hardware fault cryptanalysis. In this paper, we present some fault attacks on a type of CRT-RSA algorithms namely BOS type schemes including the original BOS scheme proposed by Blomer, Otto, and Seifert at CCS 2003 and its modified scheme proposed by Liu et al. at DASC 2006. We first demonstrate that if some special signed messages such as m = 0, ±1 are dealt carelessly, they can be exploited by an adversary to completely break the security of both the BOS scheme and Liu et al.＇s scheme. Then we present a new permanent fault attack on the BOS scheme with a success probability about 25%. Lastly, we propose a polynomial time attack on Liu et al.＇s CRT-RSA algorithm, which combines physical fault injection and lattice reduction techniques when the public exponent is short.

关键词： chinese remainder theorem RSA BOS scheme cryptanalysis fault attack LLL