Abstract:
A hash function is computed for each item of a partial string obtained by dividing a message received according to a group testing matrix representing combinatorial group testing relating to the message, and an authentication tag for the partial string is generated using a value obtained by a combining operation of individual hash values by a combiner, wherein the combiner performs the combining operation of the individual hash values, by using a hash value of an item of an empty string as an identity element of the operation.
Abstract:
To achieve one-pass and one-rate authenticated encryption capable of performing parallel processings and totally performing encryption and decode processings by only one encryption function. An authenticated encryption device comprises an authenticated encryption means for applying a two-round Feistel structure using an encryption function assigned with an auxiliary variable for a round function per two blocks to an input plaintext or encrypted text thereby to generate an encrypted text or decoded plaintext. The authenticated encryption means finds an encrypted text chunk CC[i]=(C[i_1], C[i_2]) corresponding to an i-th plaintext chunk MC[i]=(M[i_1], M[i_2]) when dividing a plaintext into chunks per two blocks as: C[i_1]=F_K((N,Tw_i_1),M[i_1]) xor M[i_2], C[i_2]=F_K((N,Tw_i_2),C[i_1]) xor M[i_1].
Abstract:
[Subject] To provide a format-preserving encryption device and the like that enables efficient and secure encryption/decryption while maintaining the data format.[Solution] An encryption device 10 includes: an unit block tweakable encryption module 101 that encrypts a specific digit of a plain text by using numerical values of remaining respective digits excluding the specific digit of the plain text and an external tweak that is input concurrently with the plain text; a block permutation module 102 that permutates respective digits including the encrypted specific digit of the plain text per digit based on a predetermined rule; and a counter update module 103 that causes processing by the unit block tweakable encryption unit and the block permutation unit to repeat for a predetermined number of times. A decryption device 20 performs the reverse processing to the encryption device 10.
Abstract:
An information processing apparatus includes a concatenation unit, a concatenation information generation unit, and a tag generation unit. The concatenation unit generates concatenation data obtained by concatenating a plurality of elements of input data consisting of the plurality of elements with one another. The concatenation information generation unit generates, for each of a plurality of message blocks obtained by dividing the concatenation data into blocks each having a predetermined data length, concatenation information about the concatenation of the elements in the message block. The tag generation unit generates a tag for a message authentication code by a block cipher by using each of the plurality of message blocks and each of the concatenation information corresponding to the respective message blocks, the block cipher being a cipher of which an input is a message having the predetermined data length.
Abstract:
A memory address allocation unit allocates, to each of nodes in a tree structure configured for protecting a memory, a memory address unique to the node. A tag generation unit defines, for each of the nodes in the tree structure, a connection of the memory address and a constant as a nonce, and generates a tag by inputting the nonce and a plaintext of which tampering with is to be detected, or the nonce and a plurality of constants of child nodes of each of the nodes into a message authentication code, the message authentication code being a code by which a partially-updatable tag can be output. A node generation unit uses a constant as a local counter, and generates each of the nodes in the tree structure by combining at least a tag and the local counter.
Abstract:
A MAC tag list generation apparatus, on reception of a nonce N unique value to each MAC generation process and a message M, generates a t×m group test matrix H serving as combinatorial group testing parameters for s (a positive integer) which is the number of the MACs to be generated, generates a MAC tag list T=(T[1], . . . , T[t]) by generating a MAC value T[i] corresponding to the i-th test (i=1, . . . , t) using the group test matrix H, the nonce N, and pseudorandom functions F and G with variable length input and fixed length output for the message M, and outputs the MAC tag list.
Abstract:
An authenticated encryption device 10 includes: an encryption means 11 which encrypts a plaintext block by inputting, to an encryption function whereby data of a predetermined bit number is output when data of the predetermined bit number is input, a plaintext block of the predetermined bit number constituting the plaintext to be encrypted with a mask value, which is uniquely determined from an adjustment value including an initial vector not overlapping a past value and a secret key, being added; and a computation means 12 which computes, as a checksum, the exclusive OR of corresponding bits of a first bit string, a bit number of which is less than the predetermined bit number, of each of a plurality of plaintext blocks constituting the plaintext.
Abstract:
A random number generation system 20 generates a random number using a public key, a component of which is the member of a residue class ring modulo of a predetermined natural number excluding natural numbers represented by the power of a prime in composite numbers, the random number generation system including: a factorizing means 21 that computes the prime factorization for a predetermined natural number; and a generation means 22 that generates a random number in accordance with a discrete Gaussian distribution over a lattice wherein a vector having non-zero components of a single prime factor obtained by computing prime factorization and −1 is a basis vector.
Abstract:
A generation means 11 generates a uniform random number between 0 and a first probability, which is a probability of a stochastic variable becoming a value within a predetermined interval in a positive range in the first discrete distribution. When a uniform random number less than or equal to a second probability is generated, the second probability being a probability of the stochastic variable becoming a value within a predetermined interval in a second discrete distribution, which is a discrete Gaussian distribution on a one-dimensional lattice the center of which is the origin, the selection means 12 selects, as a random number generation method, an accumulation method in which a functional value defining the second discrete distribution is used. When a uniform random number greater than the second probability is generated, the selection means 12 selects a rejection sampling method as the random number generation method.
Abstract:
A first apparatus comprises an error correction coding part that receives a message M to be transmitted to a second apparatus, performs coding using a predetermined error correction code, and outputs a codeword C; a message authentication tag generation part that receives the message M and outputs a predetermined message authentication tag T; and a transmission part that transmits the codeword C and the tag T as transmission information S to the second apparatus. The second apparatus receives a message M* to be verified and a tag T′, which are obtained from the transmission information S, and determines that the message M* to be verified has not been tampered with when a tag T* obtained from the message M* to be verified and the tag T′ satisfy a predetermined identity criterion.