Topic
Cipher
About: Cipher is a research topic. Over the lifetime, 9409 publications have been published within this topic receiving 110309 citations. The topic is also known as: cypher & cryptographic algorithm.
Papers published on a yearly basis
Papers
More filters
•
17 May 2005TL;DR: In this article, a secure and optimized packet messaging system is described, in which a plurality of request packets staged in a packet queue from a requesting client and specifying content for retrieval from a destination server are categorized.
Abstract: A system and method for providing integrated secured and optimized packet messaging is described. A plurality of request packets staged in a packet queue from a requesting client and specifying content for retrieval from a destination server are categorized. The content is retrieved from the destination server. The retrieved content is optimized for at least one such request packet. The retrieved content is exchanged as secure content protected using a cipher negotiated with the requesting client for at least one such request packet.
46 citations
••
TL;DR: The result indicates that there is no trapdoor design for a Rijndael-like cipher based on the imprimitivity of the group action of its proper round functions which is difficult to detect.
46 citations
••
18 Jun 2007
TL;DR: An 64-bit FPGA implementation of the 128- bit block and 128 bit-key AES cipher, designed by Joan Daemen and Vincent Rijmen, and operating at 224 Mbps (maximum throughput).
Abstract: The Rijndael cipher, designed by Joan Daemen and Vincent Rijmen, has been selected as the official advanced encryption standard (AES) and it is well suited for hardware use. This implementation can be carried out through several trade-offs between area and speed. This paper presents an 64-bit FPGA implementation of the 128- bit block and 128 bit-key AES cipher. Selected FPGA Family is Spartan 3. The cipher consumes 52 clock cycles for algorithm encryption, resulting in a throughput of 120 Mbps. Synthesis results in the use of 1643 slices, 975 flip flops, 3055 4-input look up tables and operates at 224 Mbps (maximum throughput). The design target was optimization of speed and cost.
46 citations
••
26 Mar 2007TL;DR: In this paper, a cipher e* = XLS[e,E] that can encipher messages of l + s bits for any s < n was constructed, and the construction works even in the tweakable and variable-input-length settings.
Abstract: Given (deterministic) ciphers e and E that can enciphermessages of l and n bits, respectively, we construct a cipher e* = XLS[e,E] that can encipher messages of l + s bits for any s < n Enciphering such a string will take one call to E and two calls to E We prove that e is a strong pseudorandom permutation as long as e and E are Our construction works even in the tweakable and VIL (variable-input-length) settings It makes use of a multipermutation (a pair of orthogonal Latin squares), a combinatorial object not previously used to get a provablesecurity result
45 citations
••
TL;DR: To provide security of data and authentication of user, a technique where two concepts are implemented for performing those operations, the first one is identity based signature (IBS) for verification of user generated by the verifier and second one is a key is xor operated with the data and get the cipher and binary level technique for encryption and decryption of the original message.
Abstract: Secure and efficient data transmission is a critical issue for cluster-based wireless Sensor Networks (WSNs). In Cluster-based WSNs authentication of users is a very Important issue .So, by authenticating the sent user and the destination user , we can achieve the security and efficiency of data over CWSNs. To provide security of data and authentication of user we proposed a technique where we are implementing two concepts for performing those operations. The first one is identity based signature (IBS) for verification of user generated by the verifier and second one is a key is xor operated with the data and get the cipher and then binary level technique for encryption and decryption of the original message. The binary level technique converts the plain text into binary form and then splits the data into blocks and assign values to it based on identification mark (IM) technique which depends upon the length of the binary digits, then these are divided into two level, 1 st level is 2 bit and 2 nd level is 4 bit . Then at the receiver user the Cipher text will be decrypted by using the reverse technique and the destination user will get the original message. By providing those techniques we can improve efficiency, security overhead and energy consumption.
45 citations