نتایج جستجو برای: code based cryptography
تعداد نتایج: 3061053 فیلتر نتایج به سال:
Superimposed codes is a special combinatorial structure that has many applications in information theory, data communication and cryptography. On the other hand, mutually orthogonal latin squares is a beautiful combinatorial object that has deep connection with design theory. In this paper, we draw a connection between these two structures. We give explicit construction of mutually orthogonal l...
Abstract Card-based cryptography provides simple and practicable protocols for performing secure multi-party computation with just a deck of cards. For the sake simplicity, this is often done using cards only two symbols, e.g., $$\clubsuit $$ ♣ $$\heartsuit ♡ . Within paper, we also target se...
Distributed data to a remote Cloud Service Provider is a flourishing trend for infinite customers and institution relieve the difficulty of local data storage and maintenance. Moreover the customer gets confidence on the data mirroring provided by the CSP. The structure used for data mirroring can be different based on the data; more facsimile(copies) are demanded for derogatory data which cann...
We describe a code lengthening technique that uses Unequal Error Protection codes as suux codes and combine it with iteration of the conventional Construction X. By applying this technique to BCH codes, we obtain 5 new binary codes, 13 new ternary codes and 13 new quaternary codes. An improvement of Construction XX yields 2 new ternary codes.
certificateless public key cryptography (cl-pkc) is a useful method in order to solve the problems of traditional public key infrastructure (i. e. large amount of computation, storage and communication cost for managing certificates) and id-based public key cryptography (i. e. key escrow problem), simultaneously. a signcryption scheme is an important primitive in cryptographic protocols which p...
As the both the requirement and demand for secure systems increases, so to will the ubiquitousness of cryptography. The most secure cryptographic schemes often involve complicated algorithms and are by no means cheap to implement on standard hardware, and it is this that has led to the development of cryptographic hardware accelerators. Optimizing software to take advantage of these hardware de...
Substitution errors, where individual characters are altered, and transposition errors, where two consecutive characters are interchanged, are commonly caused by human operators. In this paper, codes that detect a single substitution error or a single transposition error are studied. In particular, it is shown that such codes of length n over an alphabet of q characters have at most qn−1 codewo...
We propose a novel hybrid universal network-coding cryptosystem (HUNCC) to obtain secure post-quantum cryptography at high communication rates. The scheme we offer is in the sense that it combines information-theoretic security with public-key cryptography. In addition, general and can be applied any network, cryptosystem. Our based on information theoretic notion of individual secrecy, which t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید