The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Linear complexity profile and correlation measure of order k are important pseudorandomness measures for sequences used in cryptography. We study both measures for a class of binary sequences called Legendre-Sidelnikov sequences. The proofs involve character sums.
Rational secret sharing is an emerging research direction. After analyzing the character of rational participants, a rational secret sharing protocol is designed in this paper. The proposed protocol is based on the common knowledge from Game Theory and the proof of its fairness is provided.
The Twin Fibonacci sequences are first defined and their linear expressions are given in this paper.The sequence{Un} which is constituted by the matrix eigenvalues is defined and a discussion is given to its properties,including some exact division properties of the sequence{Un} taken modulo m,and the theorem on the least period for module sequence{un(pr)} is shown. Moreover,the relationship theorem...
Signcryption is a cryptographic primitive which offers authentication and confidentiality simultaneously with a cost lower than signing and encrypting the message independently. Ring signcryption enables a user to anonymously signcrypt a message on behalf of a set of users including himself. Thus a ring signcrypted message has anonymity in addition to authentication and confidentiality. Ring signcryption...
Donations are the main fund sources of election candidate, non-government organization, non-profit organization and charity etc. As the development of Internet, more and more donations are made online. At present, most online donations are made by smart card, and this kind donation is traceable. Anonymous donation may be necessary in some cases, but fully anonymous donation may be abused by the donee...
A multi-stage secret sharing scheme with general access structures is proposed on the difficulty of the discrete logarithm problem over finite field. In this scheme, new secrets can be added. The participant set and the access structure can be changed dynamically without updating any participant's secret shadow. In addition, the computational complexity of the proposed scheme is very low because the...
This paper introduces a new (t, n) secret sharing scheme for image encryption. The proposed method encrypts the secret image into two images as the same size of the original image, which one is the public image (called the encrypted image) and another is to be shared among n participants using a new secret sharing method based on the Shamir’s secret sharing. In the new secret sharing scheme, t (or...
Kocarev gave the first cryptosystems based on the semi-group property of Chebyshev polynomials, which seemed excellent but actually insecure. Due to the inherent periodicity of trigonometric function, an attack can easily get plaintext given ciphertext. In this paper, we extend Chebyshev polynomials from real number to finite fields to avoid the attack and present the corresponding key exchange scheme,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.