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.

A study of DES and Blowfish encryption algorithm

Abstract: With the rapid growing of internet and networks applications, data security becomes more important than ever before. Encryption algorithms play a crucial role in information security systems. In this paper, we have a study of the two popular encryption algorithms: DES and Blowfish. We overviewed the base functions and analyzed the security for both algorithms. We also evaluated performance in execution speed based on different memory sizes and compared them. The experimental results show the relationship between function run speed and memory size.

Method for providing a secure communication between two devices and application of this method

Abstract: In a method for providing a secure communication between two devices, a first device generates a random key (Ci) and transfers this key to a second device in a first message encrypted using a plublic key. The second device decrypts the first encrypted message by means of a corresponding secret key to obtain the random key (Ci) and this random key is used to encrypt and decrypt all transmissions between these devices. In a decoder for a pay TV system, comprising a conditional access module and a smart card, this method is applied to provide a secure communication between the control access module and the smart card and/or between the decoder and the conditional access module.

Device for and method of secure computing using virtual machines

Abstract: A device for and method of secure computing that includes a computer system having a processor; an operating-system software program loaded onto the processor; a type-II virtual machine monitor software program loaded onto the operating-system software program; a user-definable number of non-sensitive virtual-machines; a user-definable number of sensitive virtual-machines, where each sensitive virtual-machine has a user-definable sensitivity level; a user-definable number of encryption virtual-machines, where each encryption virtual-machine is connected to one of said user-definable number of sensitive virtual-machines, and where each encryption virtual-machine includes at least one encryption algorithm capable of encrypting information from the corresponding sensitive virtual-machine according to the corresponding sensitivity level; and a router virtual-machine connected to each non-sensitive virtual-machine and each encryption virtual-machine.

Attribute-Based Data Sharing Scheme Revisited in Cloud Computing

Abstract: Ciphertext-policy attribute-based encryption (CP-ABE) is a very promising encryption technique for secure data sharing in the context of cloud computing. Data owner is allowed to fully control the access policy associated with his data which to be shared. However, CP-ABE is limited to a potential security risk that is known as key escrow problem, whereby the secret keys of users have to be issued by a trusted key authority. Besides, most of the existing CP-ABE schemes cannot support attribute with arbitrary state. In this paper, we revisit attribute-based data sharing scheme in order to solve the key escrow issue but also improve the expressiveness of attribute, so that the resulting scheme is more friendly to cloud computing applications. We propose an improved two-party key issuing protocol that can guarantee that neither key authority nor cloud service provider can compromise the whole secret key of a user individually. Moreover, we introduce the concept of attribute with weight, being provided to enhance the expression of attribute, which can not only extend the expression from binary to arbitrary state, but also lighten the complexity of access policy. Therefore, both storage cost and encryption complexity for a ciphertext are relieved. The performance analysis and the security proof show that the proposed scheme is able to achieve efficient and secure data sharing in cloud computing.