In this paper, we substantially modify Hung et al. [1] Anonymous Multi-receiver Certificateless Encryption (AMCLE) scheme to a Multi-receiver Certificateless Signcryption (MCLS) scheme, which provides authentication and introduces public verifiability as an additional feature. We show that, as compared to existing signcryption, our scheme requires less computation for the signcryption and unsigncryption phases. Additionally, the signcryption cost is linear with the number of designated receivers, while the unsigncryption cost remains constant. We compare the results with existing single-receiver and multi-receiver signcryption schemes and show that our proposed MCLS scheme is more efficient for single and multi-receiver signcryption schemes while providing an exemption from the key escrow problem and working in certificateless public key settings.
In this article, we give an easy method to distinguish different cases of additions on Jacobians of hyperelliptic curves of genus 3. In addition, we give an advanced algorithm for group laws on Jacobian of hyperelliptic curves of genus 3. By this method, our algorithm can handle all kinds of inputs without recalling a generic algorithm. Our method is mainly based on Harley's algorithm. However, we use linear algebra over finite fields, instead of Chinese Reminder Theorem over function fields. Moreover, We did $2\times 10^{8}$ experiments in the finite field $\mathbb{F}_{2^{61}-1}$ , our algorithm runs 0.033% faster than previous works in general addition.
Encryption is a method of hiding data so that it cannot be read by anyone who does not know the key. The key is used to lock and unlock data. In a hack-prone society like ours now, this method would prevent unauthorized individuals from understanding your most protected correspondences. Hence, the development of an encryptor and decryptor is necessary. haydIT offers a user-friendly interface using intuitive icons that most of us are familiar with. Users can encrypt data, generate private key that serves as a unique lock of encryption, and send it thru any means to its recipient. Receivers can also use the same system to decrypt the data using the private key that must be manually entered to the system. haydIT prides itself in supporting the conversion of different language scriptures, providing asymmetrical way of data conversion through double encryption of randomly selected characters. It also supports multi- level of encryption and applies parity checking for data integrity. Thus, provides a virtually- pattern-less way of encoding and decoding data. The developers utilized the Spiral Methodology in developing the project. It combines the elements of both design and prototyping-in-stages, in an effort to combine advantages of top- down and bottom-up concepts. The developed PC app was tested by 15 IT Professionals based on several metrics and proved that haydIT is performing efficiently as expected with a grand mean of 4.75 interpreted as Excellent. With haydIT, everyone can guarantee that messages will be understood only by its intended reader.
Recently, American National Institute of Standards and Technology (NIST) announced Kyber as the first KEM candidate to be standardized. The security of Kyber is based on the modular learning with errors (MLWE) problem, which achieves excellent efficiency and size. This work proposes an improved key mismatch on Kyber, which can reduce the number of queries required to recover the secret key. We first transform the problem of finding a certain parameter of ciphertexts into a quantum ordered search problem. Then we give the procedure of finding the value of a parameter in the ciphertexts by the quantum method. Finally, we instantiate this attack method on Kyber512, Kyber768 and Kyber1024. Compared with the existing attack algorithm, our improved attack reduces the number of queries for Kyber512, Kyber768 and Kyber1024 by 63%, 59% and 45%, respectively.
Users can compare the equality of two encryption texts encrypted by different public keys in the public key encryption with equality test (PKEET) scheme. And the encryption texts do not have to be decrypted. Actually, users may need to verify the equality of two ciphertext sets. A trivial solution using typical PKEET scheme is testing two ciphertexts respectively from two sets and repeating multiple times until all ciphertexts are tested. Obviously, the above solution not only spends a lot of time, but also discloses the equality between any two ciphertexts in the two sets. For fear of the aforementioned issue, we propose an efficient public key encryption with set equality test (PKE-SET). PKE-SET does not use expensive bilinear pairings. Experimental results indicate that, compared to other PKEET schemes, our PKE-SET has higher computational efficiency and only our PKE-SET does not disclose the equality between any two ciphertexts.
