scispace - formally typeset
Search or ask a question
Topic

40-bit encryption

About: 40-bit encryption is a research topic. Over the lifetime, 5434 publications have been published within this topic receiving 149016 citations.


Papers
More filters
Patent
18 Apr 2006
TL;DR: In this article, a method for securing data sets by dynamically hopping amongst a variety of data encryption and/or manipulation protocols is provided, which can be implemented in reconfigurable logic.
Abstract: A method is provided for securing data sets by dynamically hopping amongst a variety of data encryption and/or manipulation protocols. Such dynamic protocol hopping can be implemented in reconfigurable logic, or some combination of reconfigurable logic and fixed circuitry or software. The encryption and/or manipulation protocol applied to the data set is selected from among a plurality of encryption protocols in an, optionally upgradeable, library of protocols. Preferably, the selection can be driven by a random number generator. More preferably, the number of encryption protocols available can be extended using a logic-stretching engine. An apparatus is also provided for securing data, including a memory that contains data describing encryption protocols, a communications interface that is configured to receive data, and a processor that reads from the memory one of the encryption protocols and encrypts the received data based on the encryption protocol. Preferably, the apparatus also includes a random number generator, and the processor selects the encryption protocol to read, and encryption parameters to use, based on the output of the random number generator.

33 citations

Journal ArticleDOI
TL;DR: Novel selective encryption image schemes based on JPEG2000 are proposed that encrypts only the code-blocks corresponding to some sensitive precincts and introduces the permutation of codeblocks contributing in the selected precincts to improve the security level.
Abstract: In this paper, novel selective encryption image schemes based on JPEG2000 are proposed. The first one encrypts only the code-blocks corresponding to some sensitive precincts. In order to improve the security level we introduce the permutation of codeblocks contributing in the selected precincts. The idea of combining permutation and selective encryption is used in order to minimize the amount of processed data encryption while ensuring the best possible degradation through the permutation. Many of proposals format compliant encryption schemes for JPEG2000 that have been made encrypt packet body data, but leave header packet in plaintext. The second approach, combines code-blocks data encryption to a cyclic permutation of all packets headers in the bitstream. Actually, in the JPEG2000 codestream, packet header information is specific to the visual content, and it is can be used as a fingerprint of the codestream. Symmetric encryption AES with CFB mode is used to encrypt in the two schemes. The proposed schemes don't introduce superfluous JPEG2000 markers in the protected codestream, i.e, its format is compliant to JPEG2000 codestream one. It keeps file format and compression ratio unchanged and doesn't degrade the original error robustness. The proposed scheme works with any standard ciphers and introduces negligible computational cost.

33 citations

Proceedings ArticleDOI
10 Sep 2007
TL;DR: A structure-independent fault detection scheme for the Advanced Encryption Standard that is independent of the way S- box (inverse S-box) is constructed and can be used for both encryption and decryption is presented.
Abstract: The Advanced Encryption Standard, which is used extensively for secure communications, has been accepted recently as a symmetric cryptography standard However, occurrence of the internal faults by intrusion of the attackers may cause confidential information leak to reveal the secret key For this reason, several schemes for fault detection of the transformations and rounds in the encryption and decryption of the Advanced Encryption Standard are proposed In this paper, we present a structure-independent fault detection scheme for the Advanced Encryption Standard The proposed scheme is independent of the way S- box (inverse S-box) is constructed and can be used for both encryption and decryption It can be applied to both the S-boxes (and inverse S-boxes) using look-up tables as well as those utilizing logic gate implementations based on composite fields We have obtained the formulations for the fault detection of the SubBytes (inverse SubBytes) using the relation between the input and output of the S-box (inverse S-box) Then, we have proposed and simulated a signature-based structure-independent fault detection scheme Moreover, the FPGA implementations of the original and the proposed schemes as well as their overhead are presented

33 citations

Proceedings ArticleDOI
10 Jul 2016
TL;DR: Linear code based encryption scheme (RLCE) as discussed by the authors is a lattice-based encryption scheme which shares many characteristics with random linear codes and it is secure against existing attacks and they hope that the security of the RLCE scheme is equivalent to the hardness of decoding random linear code.
Abstract: Lattice based encryption schemes and linear code based encryption schemes have received extensive attention in recent years since they have been considered as post-quantum candidate encryption schemes. Though LLL reduction algorithm has been one of the major cryptanalysis techniques for lattice based cryptographic systems, key recovery cryptanalysis techniques for linear code based cryptographic systems are generally scheme specific. In recent years, several important techniques such as Sidelnikov-Shestakov attack, filtration attacks, and algebraic attacks have been developed to crypt-analyze linear code based encryption schemes. Though most of these cryptanalysis techniques are relatively new, they prove to be very powerful and many systems have been broken using them. Thus it is important to design linear code based cryptographic systems that are immune against these attacks. This paper proposes linear code based encryption scheme RLCE which shares many characteristics with random linear codes. Our analysis shows that the scheme RLCE is secure against existing attacks and we hope that the security of the RLCE scheme is equivalent to the hardness of decoding random linear codes. Example parameters are recommended for the scheme RLCE.

33 citations

Patent
16 Nov 2004
TL;DR: In this article, a computer system including a data storage apparatus having a storage area storing encrypted data is modified to have plural encryption/decryption units, and a computer cannot appropriately use the encrypted data storage area if a path including the encryption or decryption means is not adequately determined.
Abstract: When a computer system including a data storage apparatus having a data storage area storing encrypted data is modified to have plural encryption/decryption units, a computer cannot appropriately use the encrypted data storage area if a path including the encryption/decryption means is not adequately determined. In a computer system having a computer 10 , two or more data storage apparatuses 100 and 200 arranged hierarchically, plural encryption/decryption modules 199 and 299 on a path between the computer 10 and a data storage area 101 , and a management computer 500 for managing the data storage apparatuses and the like, if there is an interoperability between the encryption/decryption modules 199 and 299 and the data storage area 101 is encrypted by the first encryption/decryption module 199 , the computer 10 accesses the data storage area 101 using the second encryption/decryption module 299 (or an n-th encryption/decryption module closer to the computer than the second encryption/decryption module), rather than the first encryption/decryption module.

33 citations


Network Information
Related Topics (5)
Encryption
98.3K papers, 1.4M citations
90% related
Cryptography
37.3K papers, 854.5K citations
89% related
Authentication
74.7K papers, 867.1K citations
86% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
81% related
Wireless ad hoc network
49K papers, 1.1M citations
80% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20241
202370
2022145
20213
20205
20194