Abstract: There is provided a display device in which a drain hole is provided in incised portion of a middle cabinet supporting a display panel and a back cover, and thus plural circuit films and a printed circuit board and the like that are arranged in a circuit section coupled to the display panel can be protected by preventing inflow of moisture from the outside despite considerable reduction of a width of a front rim.

Abstract: There is provided a display device in which a drain hole is provided in incised portion of a middle cabinet supporting a display panel and a back cover, and thus plural circuit films and a printed circuit board and the like that are arranged in a circuit section coupled to the display panel can be protected by preventing inflow of moisture from the outside despite considerable reduction of a width of a front rim.

Abstract: A display device includes a display panel; a middle cabinet including a first support surrounding sides of the display panel and a second support extending inward from inner surfaces of the first support with the display panel seated on the second support; and a sealing-bonding member disposed on the second support abutting the first support to couple the display panel with the middle cabinet and to seal the display panel and the middle cabinet together.

Abstract: An apparatus and method for performing a compression operation in a hash algorithm are provided. The apparatus includes an interface unit, a message extension unit, a chain variable initial conversion unit, a compression function computation unit, and a chain variable final conversion unit. The interface unit receives a message and chain variable data. The message extension unit generates a plurality of extended messages from the message. The chain variable initial conversion unit converts the chain variable data into initial state data for a compression function. The compression function computation unit repeatedly computes extended message binding and step functions based on the initial state data and the plurality of extended messages, and performs combination with a final extended message, thereby computing final state data. The chain variable final conversion unit generates and outputs chain variable data, into which the chain variable data has been updated, using the final state data.

Abstract: An operation apparatus includes a message expansion unit, a state data initiation unit, a state data generation unit, and a chain variable update unit. The message expansion unit generates a plurality of expanded messages using a message. The state data initiation unit generates the initial value of state data using chain variable data. The state data generation unit generates the final value of the state data by iterating a combination function and a step function using the state data and the plurality of expanded messages. The chain variable update unit updates the chain variable data using the state data of the final value.

Abstract: An apparatus and method for performing a compression operation in a fast message hash algorithm, which receive a 512-bit message and 512-bit chaining variable data, repeatedly calculate a 128-bit register-based step function, and then produce updated 512-bit chaining variable data. For this, the apparatus for performing a compression operation in a hash algorithm includes a message extension unit for receiving a message and generating a plurality of extended messages. A chaining variable initial conversion unit receives chaining variable data and converts the chaining variable data into initial state data. A step function operation unit repeatedly calculates a step function based on the initial state data and the plurality of extended messages and produces final state data. A chaining variable final conversion unit generates updated chaining variable data from the chaining variable data using the final state data, and outputs the updated chaining variable data.

Abstract: An apparatus and method for providing a Feistel-based variable length block cipher, which are configured to when plaintext having a certain bit length is encrypted, generate ciphertext having the same bit length as plaintext, and to decrypt ciphertext into plaintext having the same bit length. The apparatus includes an encryption/decryption key generation unit for generating a number of encryption/decryption keys corresponding to a preset number of rounds, based on a secret key, the length of the secret key, the length of plaintext, and a round constant; an encryption/decryption tweak generation unit for generating an encryption/decryption tweak based on a tweak, a length of tweak, and the length of plaintext; and a ciphertext output unit for outputting ciphertext having length identical to that of plaintext, based on plaintext, the length of the plaintext, the length of the secret key, the encryption/decryption keys, and the encryption/decryption tweak.

Abstract: A variable-length block cipher apparatus and method capable of format preserving encryption are provided. An encryption device for a variable-length block cipher apparatus includes an encryption key generation unit configured to generate encryption round keys eRK0, eRK1, . . . , eRKNr using a secret key and the number of rounds Nr, and a ciphertext output unit configured to output ciphertext having a length identical to that of plaintext using the plaintext and the encryption round keys. 7. A decryption device for a variable-length block cipher apparatus includes a decryption key generation unit configured to generate decryption round keys dRK0, dRK1, . . . , dRKNr using a secret key and a number of rounds Nr, and a plaintext restoration unit configured to restore ciphertext into plaintext having a length identical to that of the ciphertext using the ciphertext and the decryption round keys.

Abstract: An encryption apparatus and method that provide a mobile fast block cipher algorithm that supports low-power encryption. The encryption apparatus includes a user interface unit, a key scheduler unit, an initial conversion unit, a round function processing unit, and a final conversion unit. The user interface unit receives plain text to be encrypted and a master key. The key scheduler unit generates a round key from the master key. The initial conversion unit generates initial round function values from the plain text. The round function processing unit repeatedly processes a round function using the round key and the initial round function values. The final conversion unit generates ciphertext from the resulting values of the round function processed in a final round by the round function processing unit.

Abstract: An apparatus and method for converting a random binary sequence into a random integer is provided. The present invention converts a random binary sequence into a random integer, and determines whether the corresponding random integer falls within a preset integer interval. Further, if it is determined that the random integer generated from the random binary sequence does not fall within the preset integer interval, the present invention repeatedly updates a random binary sequence until a random integer falling within the corresponding integer interval is obtained, thus outputting uniformly distributed random integers which fall within the preset integer interval.

Abstract: An apparatus and method for performing a compression operation in a hash algorithm are provided. The apparatus includes an interface unit, a message extension unit, a chain variable initial conversion unit, a compression function computation unit, and a chain variable final conversion unit. The interface unit receives a message and chain variable data. The message extension unit generates a plurality of extended messages from the message. The chain variable initial conversion unit converts the chain variable data into initial state data for a compression function. The compression function computation unit repeatedly computes extended message binding and step functions based on the initial state data and the plurality of extended messages, and performs combination with a final extended message, thereby computing final state data. The chain variable final conversion unit generates and outputs chain variable data, into which the chain variable data has been updated, using the final state data.

Abstract: An apparatus and method for performing a compression operation in a fast message hash algorithm, which receive a 512-bit message and 512-bit chaining variable data, repeatedly calculate a 128-bit register-based step function, and then produce updated 512-bit chaining variable data. For this, the apparatus for performing a compression operation in a hash algorithm includes a message extension unit for receiving a message and generating a plurality of extended messages. A chaining variable initial conversion unit receives chaining variable data and converts the chaining variable data into initial state data. A step function operation unit repeatedly calculates a step function based on the initial state data and the plurality of extended messages and produces final state data. A chaining variable final conversion unit generates updated chaining variable data from the chaining variable data using the final state data, and outputs the updated chaining variable data.

Abstract: An apparatus and method for converting a random binary sequence into a random integer is provided. The present invention converts a random binary sequence into a random integer, and determines whether the corresponding random integer falls within a preset integer interval. Further, if it is determined that the random integer generated from the random binary sequence does not fall within the preset integer interval, the present invention repeatedly updates a random binary sequence until a random integer falling within the corresponding integer interval is obtained, thus outputting uniformly distributed random integers which fall within the preset integer interval.

Abstract: An encryption apparatus and method that provide a mobile fast block cipher algorithm that supports low-power encryption. The encryption apparatus includes a user interface unit, a key scheduler unit, an initial conversion unit, a round function processing unit, and a final conversion unit. The user interface unit receives plain text to be encrypted and a master key. The key scheduler unit generates a round key from the master key. The initial conversion unit generates initial round function values from the plain text. The round function processing unit repeatedly processes a round function using the round key and the initial round function values. The final conversion unit generates ciphertext from the resulting values of the round function processed in a final round by the round function processing unit.

Abstract: A secret key predistribution method is provided. The secret key predistribution method includes the steps of: performing a tree structure establishment process by causing a center to release a tree structure and causing sensor nodes to store the released tree structure; performing a seed key and hashed key generation process by causing the center to select a seed key and extract hashed keys by applying a hash function according to the tree structure; and performing a key predistribution process by causing the center to select key id sequences and causing the sensor nodes to store the selected sequences and corresponding hashed keys. Accordingly, the secret key distribution method can provide excellent resiliency and efficiency in terms of hash computational complexity.