Energy big data: A survey <s> C. QUANTUM CRYPTOGRAPHY FOR DATA SECURITY <s> We describe initial results from an apparatus and protocol designed to implement quantum public key distribution, by which two users, who share no secret information initially: 1) exchange a random quantum transmission, consisting of very faint flashes of polarized light; 2) by subsequent public discussion of the sent and received versions of this transmission estimate the extent of eavesdropping that might have taken place on it, and finally 3) if this estimate is small enough, can distill from the sent and received versions a smaller body of shared random information (key), which is certifiably secret in the sense that any third party's expected information on it is an exponentially small fraction of one bit. Because the system depends on the uncertainty principle of quantum physics, instead of usual mathematical assumptions such as the difficulty of factoring, it remains secure against an adversary with unlimited computing power. <s> BIB001 </s> Energy big data: A survey <s> C. QUANTUM CRYPTOGRAPHY FOR DATA SECURITY <s> In this paper, a fast algorithm with its corresponding VLSI architecture is proposed to speed up the modular multiplication with a large modulus. By partitioning the operand (multiplier) into several equal-sized segments, and performing the multiplication and residue calculation of each segment in a pipelined fashion, a performance improvement can be achieved by using our algorithm compared with previous work. We also show an efficient procedure to accelerate the residue calculation and use carry-save addition to implement the architecture such that the critical path is independent of the size of the modulus. Therefore, the resulting architecture and implementation are very suitable to be applied to the high-speed RSA cryptosystem and can be easily implemented in VLSI technology. <s> BIB002
Since the large amount of data is stored in multiple distributed grids, it is difficult to monitor the security of data storage VOLUME 4, 2016 in real time. However, most data involve personal privacy, commercial secrets, financial information, etc. It causes the problem of data larceny, which has become increasingly serious. Therefore, some kinds of cryptography technologies have been proposed by researches to solute security problems of big data in energy domain. Modern cryptography technique is based on the Rack Scale Architecture (RSA), which is especially used for the hardly factoring large data BIB002 . In 1994, Peter Shor discovered that quantum computers can handle discrete logarithm operation  and this would lead to the loss of the efficiency of the RSA architecture. Since the quantum computers have been put into use recently, a new data cryptograph technology called quantum cryptography BIB001 is considered as the next generation cryptography solution. The quantum cryptography can absolutely guarantee the security of smart grid data based on the quantum mechanics. In this technology, the data is encoded as qubits instead of transmitting bits and different directions will affect the qubit's polarization. The quantum key distribution begins when a large amount of qubits are sent from the sender to the receiver. If an eavesdropper wants to get the information about any qubit, he will have to measure it. However, having no idea about the qubit's polarization, the eavesdropper can only process it by guess and then transmit another randomly polarized qubit to the receiver. All these operations are under the surveillance. At the end of quantum key distribution, the key will be identified safe or not by a brief testing.