In this paper, the induced group homomorphism was studied. It is proved that for any ideal I of a ring R contained in J(R), K 0(π):K 0(R)→K 0(R/I) is isomorphic if and only if K 0(π) + is a sem...In this paper, the induced group homomorphism was studied. It is proved that for any ideal I of a ring R contained in J(R), K 0(π):K 0(R)→K 0(R/I) is isomorphic if and only if K 0(π) + is a semigroup isomorphism; characterizations are given for the semilocal rings being semiperfect.展开更多
In this paper , we have established an intimate connection between near-nings and linear automata,and obtain the following results: 1) For a near-ring N there exists a linear GSA S with N ≌ N(S) iff (a) (N, +) is abe...In this paper , we have established an intimate connection between near-nings and linear automata,and obtain the following results: 1) For a near-ring N there exists a linear GSA S with N ≌ N(S) iff (a) (N, +) is abelian, (b) N has an identity 1, (c) There is some d ∈ Nd such that N0 is generated by {1,d};2) Let h: S → S’ be a GSA- epimorphism. Then there exists a near-ring epimorphism from N(S) to N(S’) with h(qn) = h(q)h(n) for all q ∈ Q and n ∈ N(S);3) Let A = (Q,A,B,F,G) be a GA. Then (a) Aa:=(Q(N(A)) =: Qa,A,B,F/Qa × A) is accessible, (b) Q = 0N(A), (c) A/~:= (Q/~,A,B,F~), Q~) with F^([q], a):= [F(q,a)] and G^([q], a):= G(q,a) is reduced, (d) Aa/~ is minimal.展开更多
全同态加密为云计算中数据全生命周期隐私保护等难题的解决都提供了新的思路.公钥尺寸较大是现有全同态加密体制普遍存在的问题.本文将基于身份加密的思想和全同态加密体制相结合,利用环上容错学习问题(Ring Learning With Errors,RLWE)...全同态加密为云计算中数据全生命周期隐私保护等难题的解决都提供了新的思路.公钥尺寸较大是现有全同态加密体制普遍存在的问题.本文将基于身份加密的思想和全同态加密体制相结合,利用环上容错学习问题(Ring Learning With Errors,RLWE),其中将环的参数m扩展到任意正整数,提出了一种基于身份的全同态加密体制.体制以用户身份标识作为公钥,在计算效率和密钥管理方面都具有优势,安全性在随机喻示模型下可规约为判定性RLWE问题难解性假设.展开更多
文摘In this paper, the induced group homomorphism was studied. It is proved that for any ideal I of a ring R contained in J(R), K 0(π):K 0(R)→K 0(R/I) is isomorphic if and only if K 0(π) + is a semigroup isomorphism; characterizations are given for the semilocal rings being semiperfect.
文摘In this paper , we have established an intimate connection between near-nings and linear automata,and obtain the following results: 1) For a near-ring N there exists a linear GSA S with N ≌ N(S) iff (a) (N, +) is abelian, (b) N has an identity 1, (c) There is some d ∈ Nd such that N0 is generated by {1,d};2) Let h: S → S’ be a GSA- epimorphism. Then there exists a near-ring epimorphism from N(S) to N(S’) with h(qn) = h(q)h(n) for all q ∈ Q and n ∈ N(S);3) Let A = (Q,A,B,F,G) be a GA. Then (a) Aa:=(Q(N(A)) =: Qa,A,B,F/Qa × A) is accessible, (b) Q = 0N(A), (c) A/~:= (Q/~,A,B,F~), Q~) with F^([q], a):= [F(q,a)] and G^([q], a):= G(q,a) is reduced, (d) Aa/~ is minimal.
文摘全同态加密为云计算中数据全生命周期隐私保护等难题的解决都提供了新的思路.公钥尺寸较大是现有全同态加密体制普遍存在的问题.本文将基于身份加密的思想和全同态加密体制相结合,利用环上容错学习问题(Ring Learning With Errors,RLWE),其中将环的参数m扩展到任意正整数,提出了一种基于身份的全同态加密体制.体制以用户身份标识作为公钥,在计算效率和密钥管理方面都具有优势,安全性在随机喻示模型下可规约为判定性RLWE问题难解性假设.
