Abstract: A system and a method for secure multi-party exact homomorphic encryption (SMPEHE) comprising a first participant, a second participant and a third participant, wherein the system further comprises: a key generation module within the first participant to produce an encryption mapping comprising an ordered product of elementary gates; to generate a multivariate polynomial set, serving as a public encryption key, via the encryption mapping; to form an encryption operator serving as a private key; and to create an encrypted polynomial set representing a computational instruction based on an encrypted action; a message encryption module within the second participant to encode a plaintext message into a first ciphertext by the public key provided by the first participant; and to transmit the first ciphertext to the third participant; and a computation module within the third participant to receive the first ciphertext; and to perform a computation on the received first ciphertext by evaluating the encrypted polyno

Abstract: A computer-implemented method based on a framework of Exact Homomorphic Encryption, EHE, protecting information from transmission, to processing and to storage. The EHE framework consists of the message encryption and the computation encryption, safeguarding both data and operations. A crucial step toward the construction of EHE is replacing classical logic gates with quantum gates, which acting on variables to generate multivariate polynomials alongside operating on quantum states conventionally. The generated polynomial sets serve as public keys for encrypting message and computation. Two fundamental traits of quantum gates, invertibility and noncommutativity, establish the success of EHE. As an isomorphism conducting with invertible gates, EHE naturally performs exact encrypted computation in full homomorphism as well as exact decryption.

Abstract: Provided are an unambiguous positioning method for a satellite navigation system B1 wideband composite signal and an apparatus thereof, which can determine observed quantities of a plurality of satellites by means of tracking B1C signals and B1I signals in B1 wideband composite signals, determine a code pseudo-range value and pseudo-range value from each satellite to a receiver by means of the observed quantities, utilize the pseudo-range values and the code pseudo-range values to calculate ambiguity floating-point solutions of propagation delays of the B1 wideband composite signals, and obtain ambiguity integer solutions by means of the ambiguity floating-point solutions, so as to correct erroneously estimated propagation delay ambiguities of the B1 wideband composite signals, thereby obtaining unambiguous pseudo-range values, and implementing unambiguous and highly precise positioning of the location of the receiver.

Abstract: The present inventive concept discloses a method of designing a one-way computational system in QAP-based homomorphic encryption applied to the n-qubit encode operations of a k-qubit action M for public-key and semi-public-key schemes respectively, n?k, wherein the method comprises: preparing a tensor-product operator =I2n-k?M=12 and decomposing it into two parts, wherein is composed of elementary gates, and let =1† and 2=; providing a correction operator, =12 for public-key and =I2k for semi-public-key, and an encoding operator, Qen†V†=W1W2 for public-key and Qp†=W1W2 for semi-public-key, both composed of elementary gates; providing appropriate permutations P, P0 and P1, while P0=P1 for semi-public-key, to obey the nilpotent condition PW1P0=I for the identity operator; through process of merging operators according to sets of identities of gates, including Id-GateELIM, Id-GateEx and Id-GateREP, there obtain the mixed encode for public-key scheme, Uen=PQen†V†=(P1†W1†21W1P1)(P1†P0)(P0†W1†2W1P0) (P0†W2), and t

Abstract: A method of designing a multi-party system in quotient algebra partition-based homomorphic encryption (QAPHE), which is based on the framework of quotient algebra partition (QAP) and the computation of homomorphic encryption (HE), wherein the method comprises: increasing single model provider A to multiple ones, wherein the number of the multiple model providers is L and let A1?i?L and L?2; increasing single data provider B to multiple ones, wherein the number of the multiple data providers is R and let B1?j?R and R?2; and encoding plaintexts, each of which is of kj qubits, from all data providers into ciphertexts respectively; aggregating the ciphertexts by a form of tensor product and generating an encoded state for computation; and preparing a model operation to conduct the encrypted computation via an encoded operator and the encoded state in a cloud. The method can improve the security of public-key/semi-public-key system and be applied to a threshold HE or a multi-key HE to solve actual problems.

Abstract: A method of constructing a procedural threshold in quotient algebra partition-based fault tolerance quantum computation, which is based on the framework of quotient algebra partition (QAP) applied in the fault tolerance quantum computation (FTQC), wherein an n-qubit fault tolerant encode of a k-qubit quantum gate M, is feasible to a threshold, wherein the method comprises: preparing a quantum code, with a stabilizer; creating an n-qubit encoding, in the quantum code, and obtaining an n-qubit fault tolerant encode of M; factorizing each encoded component, of this n-qubit fault tolerant encode; and producing a detection-correction operator by placing n-k ancilla qubits with the original system of n qubits, wherein the detection-correction operator comprises a conditional detection operator and a conditional correction operator to remove r-qubit spinor error.

Abstract: A method for constructing an n-qubit fault tolerant encode for any k-qubit quantum gate M, in any given quantum code [n, k, C], comprising: choosing a number n?k of independent spinors Sr from the first stabilizer C and a first ordered set SC consists of the independent spinors Sr; choosing a number n?k of independent spinors ?r from a second stabilizer ? in the intrinsic coordinate and a second ordered set ?r consists of the independent spinors ?r consist; implementing an encoding Qen, wherein the encoding Qen converts the first ordered set SC to the second ordered set S?, wherein the encoding Qen is a sequential product provided by sequential operations of a number n?k of unitary operators Qr; wherein each of the unitary operator Qr is composed of a single s-rotation or a product of two s-rotations; and wherein the encoding Qen converts and maps the rth independent spinor Sr in the first ordered set SC to the rth independent spinor ?r in the second ordered set S? correspondingly; a fault tolerant action Û i

Abstract: A thermal energy storage device may include a heat storage medium, one or more thermosyphons, a discharging plenum chamber, and a discharging plenum chamber. The one or more thermosyphons may include an evaporative section configured to charge the thermal energy storage device, a condensing section configured to discharge the thermal energy storage device, and a heat transfer section extending between the evaporative section and the condensing section and fluidically coupled to the evaporative section and the condensing section. At least a portion of the heat transfer section may be disposed in the solid heat storage medium. At least a portion of the evaporative section and the condensing section may be disposed outside the solid heat storage medium.

Abstract: The method of constructing QAP-based Homomorphic Encryption (HE) in the semi-public setting is introduced, which comprises: encryption, computation, and decryption. The data receiver produces a semi-public key Keys-pub. The data provider can encode his k-qubit plaintext |x to a k-qubit ciphertext |?en=QP|x via a k-qubit invertible operator QP randomly generated by Keys-pub. From the provider, the message En(?p) of QP encoded by a cryptosystem Gcrypt in Keys-pub is transmitted to the receiver through a small-resource communication channel and the ciphertext |?en is conveyed to the cloud. The receiver creates the instruction of encoded computation Uen=PMQP and transports to the cloud, where M is the required k-qubit arithmetic operation, P a k-qubit permutation, and a k-qubit operator to mingle with M. According the instruction, the cloud performs the encrypted evaluation Uen|?en and transfer to the receiver.

Abstract: A public-key scheme of Homomorphic Encryption (HE) in the framework Quotient Algebra Partition (QAP) comprises: encryption, computation and decryption. With the data receiver choosing a partition or a QAP, [n, k, C], a public key Keypub=(VQen, Gen?) and a private key Keypriv=†P† are produced, where VQen is the product of an n-qubit permutation V and an n-qubit encoding operator Qen, Gen? an error generator randomly provides a dressed operator ?=V†EV spinor error E of [n, k, C]. Then, by Keypub, the sender can encode his k-qubit plaintext Ix) into an n-qubit ciphertext |?en, which is transmitted to the cloud. The receiver prepares the instruction of encoded computation Uen=PV†Qen† for a given k-qubit action M and sends to cloud, where is the error-correction operator of [n, k, C], =I2n?k?M the tensor product of the (n?k)-qubit identity I2n?k and M , and V†Q†en and P the complex-transposes of VQen and †P† respectively.

Abstract: A method of constructing a procedural threshold in quotient algebra partition-based fault tolerance quantum computation, which is based on the framework of quotient algebra partition (QAP) applied in the fault tolerance quantum computation (FTQC), wherein an n-qubit fault tolerant encode of a k-qubit quantum gate M, is feasible to a threshold, wherein the method comprises: preparing a quantum code, with a stabilizer; creating an n-qubit encoding, in the quantum code, and obtaining an n-qubit fault tolerant encode of M; factorizing each encoded component, of this n-qubit fault tolerant encode; and producing a detection-correction operator by placing n-k ancilla qubits with the original system of n qubits, wherein the detection-correction operator comprises a conditional detection operator and a conditional correction operator to remove r-qubit spinor error.

Abstract: The present inventive concept discloses a method of designing a one-way computational system in QAP-based homomorphic encryption applied to the n-qubit encode operations of a k-qubit action M for public-key and semi-public-key schemes respectively, n?k, wherein the method comprises: preparing a tensor-product operator =I2n-k?M=12 and decomposing it into two parts, wherein is composed of elementary gates, and let =1† and 2=; providing a correction operator, =12 for public-key and =I2k for semi-public-key, and an encoding operator, Qen†V†=W1W2 for public-key and Qp†=W1W2 for semi-public-key, both composed of elementary gates; providing appropriate permutations P, P0 and P1, while P0=P1 for semi-public-key, to obey the nilpotent condition PW1P0=I for the identity operator; through process of merging operators according to sets of identities of gates, including Id-GateELIM, Id-GateEx and Id-GateREP, there obtain the mixed encode for public-key scheme, Uen=PQen†V†=(P1†W1†21W1P1)(P1†P0)(P0†2W1P0) (P0†W2), and that

Abstract: A method of designing a multi-party system in quotient algebra partition-based homomorphic encryption (QAPHE), which is based on the framework of quotient algebra partition (QAP) and the computation of homomorphic encryption (HE), wherein the method comprises: increasing single model provider A to multiple ones, wherein the number of the multiple model providers is L and let A1?i?L and L?2; increasing single data provider B to multiple ones, wherein the number of the multiple data providers is R and let B1?j?R and R?2; and encoding plaintexts, each of which is of kj qubits, from all data providers into ciphertexts respectively; aggregating the ciphertexts by a form of tensor product and generating an encoded state for computation; and preparing a model operation to conduct the encrypted computation via an encoded operator and the encoded state in a cloud. The method can improve the security of public-key/semi-public-key system and be applied to a threshold HE or a multi-key HE to solve actual problems.

Abstract: A public-key scheme of Homomorphic Encryption (HE) in the framework Quotient Algebra Partition (QAP) comprises: encryption, computation and decryption. With the data receiver choosing a partition or a QAP, [n, k, C], a public key Keypub=(VQen, ) and a private key Keypriv=†P\ are produced, where VQen is the product of an n-qubit permutation V and an n-qubit encoding operator Qen, an error generator randomly provides a dressed operator ?=V†EV of spinor error E of [n, k, C]. Then, by Keypub, the sender can encode his k-qubit plaintext |x into an n-qubit ciphertext |?en, which is transmitted to the cloud. The receiver prepares the instruction of encoded computation Uen=PV†Qen† for a given k-qubit action M and sends to cloud, where is the error-correction operator of [n, k, C], =I2n?k?M the tensor product of the (n?k)-qubit identity I2n?k and M, and V†Qen† and P the complex-transposes of VQen and †P† respectively.

Abstract: The method of constructing QAP-based Homomorphic Encryption (HE) in the semi-public setting is introduced, which comprises: encryption, computation, and decryption. The data receiver produces a semi-public key Keys-pub.The data provider can encode his k-qubit plaintext |x to a k-qubit ciphertext |?en=QP|x via a k-qubit invertible operator QP randomly generated by Keys-pub. From the provider, the message En(?p) of QP encoded by a cryptosystem Gcrypt in Keys-pub is transmitted to the receiver through a small-resource communication channel and the ciphertext |?en is conveyed to the cloud. The receiver creates the instruction of encoded computation Uen=PMQP and transports to the cloud, where M is the required k-qubit arithmetic operation, P a k-qubit permutation, and a k-qubit operator to mingle with M. According the instruction, the cloud performs the encrypted evaluation Uen|?en and transfer to the receiver.

Abstract: An indirect operating system is suitable for a mobile electronic device to remotely operate a controlled device, and allows the mobile electronic device, after scanning a device barcode of the controlled device, to obtain a corresponding set of user operation pages from a background device and display it on a remote control interface shown by the mobile electronic device, and then, the mobile electronic device converts the user's operation on the user operation page(s) into a control barcode or a driving packet with identification information of the controlled device. Through the driving packet or control barcode, the controlled device can obtain the user's input information and operate according to the input information.

Abstract: A method for recognizing various analog circuit structures is proposed, which is executed by a computer, the method comprising using the computer to perform the following: performing a feature extraction of a training circuit to extract all sub-circuits for generating multiple training samples; classifying multiple training samples by a classifier to obtain classified building blocks; performing a feature extraction of each schematic of a target circuit to convert as a feature graph and encoding feature graph as a feature matrix; classifying feature matrix by the classifier to generate multiple groups of classified devices; and clustering multiple groups of classified devices to acquire identified sub-circuits.

Abstract: Embodiments of the invention may include a ready-to-assemble chair, comprising a seat assembly, wherein said seat assembly comprises a top seat surface, at least three sides, and an underside, wherein the underside has an internal cavity defined by the at least three sides; a seat back assembly, wherein said seat back assembly is configured to fit substantially within the internal cavity of the underside of the seat assembly in a flat orientation when said chair is disassembled; and at least three legs. Some aspects of the present invention may include a method of assembly of a ready-to-assemble chair, as well as methods of packaging the same.

Abstract: A method for constructing an n-qubit fault tolerant encode for any k-qubit quantum gate M, in any given quantum code [n, k, C], comprising: choosing a number n?k of independent spinors Sr from the first stabilizer C and a first ordered set SC consists of the independent spinors Sr; choosing a number n?k of independent spinors ?r from a second stabilizer ? in the intrinsic coordinate and a second ordered set ?r consists of the independent spinors ?r consist; implementing an encoding Qen, wherein the encoding Qen converts the first ordered set SC to the second ordered set S?, wherein the encoding Qen is a sequential product provided by sequential operations of a number n?k of unitary operators Qr; wherein each of the unitary operator Qr is composed of a single s-rotation or a product of two s-rotations; and wherein the encoding Qen converts and maps the rth independent spinor Sr in the first ordered set SC to the rth independent spinor ?r in the second ordered set S? correspondingly; a fault tolerant action Û i

Abstract: A method for recognizing various analog circuit structures is proposed, which is executed by a computer, the method comprising using the computer to perform the following: performing a feature extraction of a training circuit to extract all sub-circuits for generating multiple training samples; classifying multiple training samples by a classifier to obtain classified building blocks; performing a feature extraction of each schematic of a target circuit to convert as a feature graph and encoding feature graph as a feature matrix; classifying feature matrix by the classifier to generate multiple groups of classified devices; and clustering multiple groups of classified devices to acquire identified sub-circuits.