Search

Copyright of Journal of Guangxi Normal University - Natural Science Edition is the property of Gai Kan Bian Wei Hui and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Beijing University of Technology is the property of Journal of Beijing University of Technology, Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of South China University of Technology (Natural Science Edition) is the property of South China University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Agricultural product supply chain and blockchain are closely integrated with the continuous acceleration of agricultural modernization. The clustered supply chain has gradually developed from a single supply chain in recent years. There is heat competition among peer enterprises in the clustered agricultural product supply chain blockchain. Among them, the data on the blockchain is publicly available to all participants. The private data on the chain has been adopted as an encrypted storage model, in order to protect users' privacy. The existing single-department supervision scheme is unsuitable for the complex cluster agricultural supply chain. The multi-sector supervision can be expected to serve as a promising way in the current reality. However, multi-department supervision is still challenging to ensure the sharing of encrypted data on the chain without redundant information for irrelevant departments. It is a high demand to improve supervision efficiency and credibility. Fortunately, the ciphertext-policy attribute-based encryption (CP-ABE) can be a one-to-numerous encryption, essentially a public key encryption system. The CP-ABE can realize the sharing of data for the users with specified attributes suitable for the application environment of multi-department supervision of the blockchain in the clustered agricultural supply chain. In this research, a multi-department supervision scheme was proposed in the verifiable blockchain ciphertext policy for the cluster agricultural supply chains using CP-ABE. A chain of custody was set up outside the business chain, including the supervisors from various departments to facilitate the management of supervisors. The chain of custody managed data on the business chain through “cross-chain governance.” Different supervision strategies were set for the data on the chain, according to the data type. The administrator of the supervision department was set as the department's supervisor to supervise the specific data of the specific chain. According to the supervision strategy on the chain, the enterprise users encrypted the data using CP-ABE to realize the disclosure of data for privacy. A CP-ABE-based access tree verification scheme was designed to combine the smart contracts and supervision strategies, and then to verify the CP-ABE access tree before the data was uploaded to the chain, in order to ensure that the data was available to the designated supervisor. The direct use of CP-ABE was inefficient for data encryption. Therefore, hybrid encryption was used to encrypt and share the data. The specific implementation was to encrypt the original data with symmetric encryption and then use the CP-ABE to encrypt the symmetric encryption key. A supervision prototype system was constructed under the blockchain ciphertext of the clustered agricultural supply chain using Hyperledger Fabric. The system was tested in two aspects of function and performance. The functional test showed that the system fully met the needs of essential multi-department supervision. The performance test showed that each time the number of supervisors in the supervision strategy increased by 10, while the average on-chain time was extended by about 500 ms, and the average throughput was 438 (number of transactions/s, transactions/s). When the number of supervisors for a single data type of a single enterprise was within a reasonable range, the clustered system was adept to the multi-department supervision under the condition of the primary clustered agricultural supply chain blockchain ciphertext-application requirements. Security analysis indicated the high-security system. As such, this scheme can be expected suitable for the multi-departmental, specialized, and fine-grained supervision of data on the blockchain under data encryption. The pressure of regulators can be inspired by the development of blockchain supervision of cluster agricultural supply chains. [ABSTRACT FROM AUTHOR]

Copyright of Acta Materiae Compositae Sinica is the property of Acta Materiea Compositae Sinica Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In view of the security problem of food traceability system, the traditional centralized data storage has the trust problem among enterprises, and consumers also have the security problem when conducting traceability query. Taking rice as the research object, a grain supply chain traceability model was constructed, an anti-counterfeiting traceability system was built based on Hyperledger Fabriced, and a smart contract for data up-link and query was designed. Organize nodes to added crop generation number and associated traceability ID, combined two-dimensional code, traceability ID and blockchain to achieve anti-counterfeiting traceability, designed local and on-chain dual storage methods, and returned information after data verification. In order to ensure the security of the QR (quick response) code, the improved RSA encryption algorithm was used to generate a key pair, and the form of public key encryption and private key decryption was used to generate an encrypted QR code for the traceability ID. The consumer obtained the private key from the chain to decrypt the ciphertext. Designed small program and verified the effectiveness of improved RSA algorithm, applied small program in blockchain traceability and test application. The test results show that the combination of blockchain network with tamper-proof function and small program can meet the basic demand of consumer traceability query, realize a safer and faster traceability mode, and ensure the security of food information. [ABSTRACT FROM AUTHOR]

In order to ensure the online information security of users, the public key cryptosystem is used to encrypt the data information. As the core operation of public key cryptosystem, the computation efficiency of large integer modular multiplication is very important to the performance of public key cryptosystem. In this study, a polynomial expanded cross Montgomery modular multiplication algorithm is proposed, which is based on the classical Montgomery modular multiplication algorithm. By decomposing large bit-width logic operations, and performing modular multiplication and modular reduction operations with polynomial expansion, this algorithm can effectively improve the calculation efficiency of large integer modular multiplication operations, and reduce the resource consumption of hardware implementation. FPGA experiment verification shows that compared with other methods, the proposed algorithm can reduce AT1 and AT2（the products of area and time） by 96.5% and 69% respectively, indicating that the proposed method achieves the balance between computing time and hardware overhead, has high flexibility and universality, and is suitable for cost-sensitive applications with a large number of encryption requirements. [ABSTRACT FROM AUTHOR]

Elasric oprical networks (EONs), as the promiring next generation oprical networks, have received extenrive attention in recent years. Rouiing and spectrum allocation (RSA) is one of the core technologies for network derign and control. This paper systematically analyzes the concept of EONs and describes the key issue of RSA in detall. From the static and dynamic perspective, state-of-the-art RSA algorithms are summarized and into the exact algorithm, the intelligent optimization algorithm, the heuristic algorithm, and the learning-based algorithm on the baris of the algorithmic framework wtth different characteristics. Combined wtth the future application requirements of EONs, the difficulties and challenges faced by the RSA algorithm are discussed, and the development trend of the RSA algorithm is prospected. [ABSTRACT FROM AUTHOR]

The quasi-cyclic medium-density parity-check (QC-MDPC ) code based McEliece public key cryptography (PKC) has good performance characteristics: both the key size and the algorithm complexity of the scheme are low. However, a key recovery attack can crack the scheme against its security. The attacker can collect reaction information of the decoding failure from the receiver by adding specific error patterns to the massage, then somehow reconstruct the secret key. To copy with this attack, this paper proposed some possible countermeasure. The countermeasure combined the automatic repeat-request (ARQ) with pseudo-random sequence to eliminate the validity of feedback information. The simulation results show that the countermeasure can effectively resist this attack. Finally, this paper compared the difference between the proposed countermeasure and other schemes, and analyzed its future improvement direction. [ABSTRACT FROM AUTHOR]

The NTRU system, with its simple structure, fast decryption speed and natural multi-key processing, has attracted much attention in post-quantum cryptographic algorithms, so this paper reviewed the research related to the NTRU system. Firstly, it introduced the research and development of NTRU, system introduction, analyzed the reasons for decryption failure, and summarized the key technologies based on NTRU system. Secondly, it gave the analysis and comparison of five fully homomorphic encryption schemes based on NTRU system, and summarized several general optimization methods. Finally, it pointed out the key problems to be solved by NTRU-based encryption schemes, indicates the future research direction, and provides reference for those who study NTRU system. [ABSTRACT FROM AUTHOR]

With the widespread application of embedded cryptographic equipments,SCA has become one of its security threats.The key information is recovered by analyzing the leaked information during the physical implementation of the cryptographic algorithm,furthermore,the security of the cryptographic algorithm can be evaluated.In order to streamline the MLP network structure for energy analysis and reduce the training parameters and training time of the model,this paper studied the models based on Hamming weight(HW) and bit-based MLP neural networks,and it reduced the output categories from 256 to9 and 2 respectively.It used the power trace during the operation of the AES cryptographic algorithm to train and test the proposed MLP neural network.The experimental results show that the model can reduce the training parameters of the MLP neural network by 84% and the training time by 28%,and reduce the number of power traces required during the key recovery phase,while ensuring the prediction accuracy.At least only one power trace is needed to complete the recovery of the AES algorithm’s complete key.The experiments verify the validity of the proposed model,and the model can analyze and evaluate the security of the block cipher algorithm. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of the traditional 3D model information hiding technology, this paper proposed a novel algorithm based on OBJ 3D model redundant texture. First, it verified the feasibility of the texture mapping rule of the orthogonal projection to perform the patch map. Second, it constructed the model quaternion wavelet transform space with surface color attributes, and selected the key information to be transmitted for encryption. Last, it embedded the secret message into the robust transform space to generate the secret OBJ model, and saved the texture and state information into MTL. Additionally, it performed the encrypted model file encryption process by RSA programming means. Simulation experiments show that the proposed algorithm has strong anti-attack capability in special rendering environment compared with 3D model watermarking and steganography without surface mapping properties. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Agricultural Science & Technology (1008-0864) is the property of Journal of Agricultural Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The small Qubit quantum algorithm attack to RSA was proposed,the need Qubit of the first quantum register from 2L to L1,it can be reduced to 2 Qubit,the overall space complexity denoted (L1,L),where 2L1≥r,r is the period of decomposed.Because of the reduce of the first quantum register,it reduces the algorithm’s complexity and success rates,and use the binary look-up table method to compute the modular exponentiation,it enhances the computing speed.The improved algorithm’s quantum circuit complexity is T=O(2L2).It have a significant improvement on the time complexity and space complexity.Although the success rate is reduced,the overall success solution time is still lower than the Shor algorithm and the current major improvements Shor algorithm.Completed a simulation experiment.Respectively use the 11、10、9 Qubit decomposing the quantum circuit 119.The new algorithm explore the reality of using a universal quantum computer device to decipher the public key cryptography.

Aiming at the problems that the existing watermark embedding and extraction algorithms are sensitive to the filtering, compression and noise conditions, this paper proposed a robust digital-domain video watermark embedding and extraction method based on space-time features. The proposed framework consisted of a public key and a private key to prevent self-conspiracy attacks. The algorithm performed spatio-temporal analysis on the video and extracted the public key from the spatiotemporal feature of the compressed video, which was inherently robust. First, it used a random key to select a candidate block from a pre-selected block set to ensure the security of the watermark frame. Then it selected the 4 x 4 sub-block suitable for embedding watermark based on the spatio-temporal features of compressed video. Finally, it embedded the watermark bits using nonzero quantized coefficients. The watermarking framework allowed a limited increase in the video bit rate and reduced the computational overhead . The experimental results show that compared with the contrast method, the proposed method has strong robustness and safety. [ABSTRACT FROM AUTHOR]

In order to achieve greater safety in RSA encryption algorithm in the data encryption process, this paper made some improvements based on in-depth analysis on the traditional RSA algorithm. It put forward a more secure method with changing traditional double primes into four primes in the traditional RSA algorithm and eliminating the requirement for transferring the product n of two random primes in public key on the basis of parameter substitution. Instead, this paper replaced the original parameter n to a new introduced parameter x. In order to boost the efficiency in the introduced algorithm, this paper used the CRT(Chinese remainder theorem) to expedite the exponentiation of large numbers. The results demonstrate the feasibility of the improved algorithm, and it provides a safer path for messages transmission through public key encryption. At the same time, this paper carried out a comparative analysis of encryption and decryption time among the improved algorithm and the traditional double primes and four primes RSA algorithms. The results show that the improved algorithm to a certain degree enhanced the encryption and decryption efficiency between the message sender and receiver. [ABSTRACT FROM AUTHOR]

Due to the unified protocol specification, encryption, and firewalls and other security measures at present, communication within the network environment are in good usability and security in heterogeneous network environment. However, in order to guarantee the availability, safety of the communication between heterogeneous networks has been reduced. Based on the study of heterogeneous networks through the issues and the status quo on the symmetric key cryptography, asymmetric key cryptosystem in-depth research, an encryption algorithm based on the RSA algorithm and improved DES algorithm was proposed. Finally, the use of case study shows that the algorithm has good security.

To solve the privacy security problem of the recommendation algorithm between systems,this paper developed a secure computation model based on the theory of secure multi-party computation. The model used LBlock,a lightweight block cipher algorithm,to encrypt the provided data by the third part,and used RSA public key cryptosystem to manage keys of LBlock. Applying this model to the collaborative filtering between systems with randomized perturbation techniques,the paper developed a new algorithm whose calculation method of similarity could protect the system from the attack of artificial users. It used secure vector to prevent the untrusted third party from colluding. Experiments show that algorithm not only has stronger ability to protect the user’s privacy disclosing to the system which is cooperated,but also has better quality of recommendation. [ABSTRACT FROM AUTHOR]

In order to improve efficiency flaws of TLS protocol such as frequent interaction times and high computation overload, through the analysis and research on the protocol, this paper proposed a new ECC-based protocol in which RSA was substituted by ECC. It improved the new protocol performance. Through cache handshake parameters, the number of shake hands interaction was less. It used SVO logic to analyze ECC-based protocol, and the result shows that it is secure. The simulation experiment and comparison with original protocol show that with the increased level of security, the new ECC-based protocol is more predominant. [ABSTRACT FROM AUTHOR]

The large integer factorization is not only the most direct attacking method against RSA asymmetric encryption algorithm, but also the most important point to analyze the security of RSA. Study on the large integer factorization problem is of great value for theory and practice. TH paper summarized the study on of the large integer factorization problem and reviewed modern popular integer factorization algorithms, and introduced their basic principle and implementation steps. In addition, this paper made an analysis on existing large integer factorization techniques' advantage and disadvantage of implementation ad application. At last, this paper stated the future prospect of large integer factorization. [ABSTRACT FROM AUTHOR]

Using RSA encryption algorithm and symmetric encryption algorithm, the hierarchical encryption algorithm for different levels of information of digital library was proposed. In this algorithm, the core information (first level information) was encrypted and decrypted using RSA, and the inside information (second level information) was encrypted and decrypted using RSA and symmetric algorithm. The first level manager could decrypt the first level information and the second level information, but the second level manager could only decrypt the second level information. None but the first level manager or the second level manager could decrypt. This kind of hierarchical management could not only satisfy the security requirements for different users of digital library, but also facilitate the hierarchical management of different levels of information for digital library. The hierarchical encryption scheme had the availability and effectiveness. [ABSTRACT FROM AUTHOR]

In order to overcome AES key expansion's safety problem, this paper proposed a new key expansion method and used the simplest MixColumn and inverse MixColumn operation on GF(28) to replace the former. In aspect of RSA,this paper suggested a four prime RSA with Chinese remainder theorem and Montgomery algorithm to improve the computing efficiency. Then it proposed a mixed encryption system and created a high security communicating model. Experiments show that advanced algorithm is faster than the original and mixed system has higher practicability. [ABSTRACT FROM AUTHOR]