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.
Coupled Tent Map Lattices system (CML) has made a good combination between confusion and diffusion, which can be well adopted in the design for Hash function and sequential cipher and possesses high value in cryptographic application. Whereas, Coupled Tent Map Lattices system parameters cast a direct influence on cryptographic performance. This paper chooses tent map as the non-linear function of...
This paper proposes a novel Coupled Integer Tent Mapping System-based cryptographic one-way hashing algorithm termed as THA. THA compresses a message of arbitrary length into a fingerprint of 160 bits. The algorithm adopts a piece-wise message expansion scheme. Compared with SHA-1 message expansion, the message expansion scheme has enhanced the degree of nonlinear diffusion of the message expansion,...
A coupled chaotic map lattices system with uniform distribution (CML-UD) consisting of tent maps is presented based on the security from the viewpoint of cryptography. The system inherited the coupled diffusion and parallel iteration mechanism of coupled map lattices (CML). Through the dual non-linear effect of the rolled-out and folded-over of local lattices tent map and modular algorithms, CML-UD...
In the regular ring signature, once the secret key is compromised, all signature before the compromise will not be trustworthy any more. Recently, to overcome the shortcomings, Wang et al. proposed a forward-secure ring signature scheme. However, in this paper, we show the scheme doesn't satisfy the forward security. That is the adversary can forge the former signature if the signer's current secret...
Quantum secure direct communication (QSDC) aims to allow two remote parties to communicate directly without creating a private key in advance and then using it to encrypt the secret message. In this paper, a multiparty controlled secure quantum communication of d-dimensional is proposed based on d-dimensional maximally entangled Greenberger-Horne-Zeilinger (GHZ) state and teleportation. After using...
This paper proposes a one-way hashing algorithm called TDHA. TDHA compresses a message of arbitrary length into a fingerprint of 160 bits. The compression function in-use was constructed based on the analysis of uniform distribution property of Extended Integer Tent Maps. This algorithm takes the Extended Integer Tent Maps as major nonlinear component of compression function, propagates strong dynamic...
This paper carries out a statistical analysis on the nonlinear diffusion & propagation of the SHA message expansion. The nonlinear expansion of the message is realized through the rolled-out and folded-over of the integer tent maps, and a piece-wise-nonlinear message expansion scheme is further given. Compared with SHA-256 message expansion, the message expansion mode presented in this paper has...
Quantum secret sharing (QSS), an important branch of quantum communication, is the generalization of classical secret sharing into quantum scenario. The secret messages are split into several parts, and each part is distributed to a separate party so that no action of a subset of all the parties without the cooperation of the entire group is able to read out the secret messages. In this paper, a quantum...
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.