Abstract: An advanced metering infrastructure (AMI) server, an AMI network node, an AMI network system and a message broadcasting method thereof are provided. The AMI server generates a broadcasting key from a broadcasting message through a hash function, encrypts the broadcasting message into an encrypted broadcasting message via the broadcasting key, encrypts the broadcasting key into an encrypted key via a symmetric key, and transmits the encrypted broadcasting message and the encrypted key to the AMI network node. The AMI network node decrypts the encrypted key into the broadcasting key via the symmetric key, decrypts the encrypted broadcasting message into the broadcasting message via the broadcasting key, and processes the broadcasting message after determining that the broadcasting message corresponds to the broadcasting key through the hash function.

Abstract: An encryption method and decryption method are provided. The encryption method divides an electronic file into a plurality of message blocks, wherein the message blocks have a sequence. The encryption method sets a checking vector as the last message block. The encryption method performs the following steps on each message block according to the sequence: generating an input block, deriving an output block by encrypting the input block by an encryption key, and deriving an encrypted block by applying XOR operation to the output block and the previous message block, wherein the input block is equivalent to applying XOR operation to the message block, the output block corresponding to the previous message block, and the message block before the previous one. The encryption method generates an electronic encrypted file by concatenating the encrypted blocks. The decryption method performs a series of operations corresponding to the above operations.

Abstract: An encryption method and decryption method are provided. The encryption method divides an electronic file into a plurality of message blocks, wherein the message blocks have a sequence. The encryption method sets a checking vector as the last message block. The encryption method performs the following steps on each message block according to the sequence: generating an input block, deriving an output block by encrypting the input block by an encryption key, and deriving an encrypted block by applying XOR operation to the output block and the previous message block, wherein the input block is equivalent to applying XOR operation to the message block, the output block corresponding to the previous message block, and the message block before the previous one. The encryption method generates an electronic encrypted file by concatenating the encrypted blocks. The decryption method performs a series of operations corresponding to the above operations.

Abstract: An advanced metering infrastructure (AMI) server, an AMI network node, an AMI network system and a message broadcasting method thereof are provided. The AMI server generates a broadcasting key from a broadcasting message through a hash function, encrypts the broadcasting message into an encrypted broadcasting message via the broadcasting key, encrypts the broadcasting key into an encrypted key via a symmetric key, and transmits the encrypted broadcasting message and the encrypted key to the AMI network node. The AMI network node decrypts the encrypted key into the broadcasting key via the symmetric key, decrypts the encrypted broadcasting message into the broadcasting message via the broadcasting key, and processes the broadcasting message after determining that the broadcasting message corresponds to the broadcasting key through the hash function.

Abstract: A system, a method, and a computer readable medium for micropayment with varying denomination are disclosed. The method utilizes a secret value, a public information, a number base parameter, a bit parameter, and merged one-way hash chains to calculate a root for providing a certificate of a transaction among a customer, a merchant and a service device. Therefore, the purpose of varying denomination for micropayment system can be achieved and the trade safety and the efficiency during the transaction process can be enhanced as well.

Abstract: A system, a method, and a computer readable medium for micropayment with varying denomination are disclosed. The method utilizes a secret value, a public information, a number base parameter, a bit parameter, and merged one-way hash chains to calculate a root for providing a certificate of a transaction among a customer, a merchant and a service device. Therefore, the purpose of varying denomination for micropayment system can be achieved and the trade safety and the efficiency during the transaction process can be enhanced as well.

Abstract: A method for converting in a binary representation of a number based on a left-to-right processing of bits of the binary representation, to obtain a signed representation equivalent to the so-called Reitwiesner representation. The use of such a conversion method with left-to-right arithmetic processing improves hardware implementation of the method.

Abstract: The invention concerns a method for converting in a signed binary representation (r′m, r′0) of a number r based on a left-to-right processing of bits of the binary representation (r′m, r′0) and enabling to obtain a representation equivalent to the so-called Reitwiesner representation. The use of such a conversion method with left-to-right arithmetic processing enables to improve their hardware implementation.

Abstract: The invention concerns a method for breaking down and performing with an electronic circuit, a computing operation based on a digital factor (N) expressed in integral base (r) by a series of integers (pn−1, p2, p1, p0). The invention provides steps which consists in: breaking down the series of integers into elementary multiplets, each elementary multiplet (Mj) comprising part of the series of integers (mji+1, mji, mj0), wherein each pair of successive numbers (mi, mi−1) has a sum equal in value to the base decreased by one unit (mi+mi1=r−1) and transforming each elementary multiplet (Mj) into a modified multiplet (Sj) comprising a series of sign digits (sji,sj−1, ,sj1)such that the concatenation of modified multiplets constitute a series of sign digits containing a minimum of non-null digits and representing the value of the digital factor (N) in a relative base ({−(r−1), ,−1,0,1, ,r−1}).

Abstract: The present invention provides a method for protecting public key schemes from timing, power and fault attacks. In general, this is accomplished by implementing critical operations using “branchless” or fixed execution path routines whereby the execution path does not vary in any manner that can reveal new information about the secret key during subsequent operations. More particularly, the present invention provides a modular exponentiation algorithm without any redundant computation so that it can protect the secret key from C safe error attacks. The improved method also provides an algorithm that doesn't have a store operation with non-certain destination so that the secret key is immune from M safe error attacks.

Abstract: Disclosed is an electronic payment device and its method using an balanced binary tree for calculating a first data Xk of current consumption or a plurality of root values Rq from an initial value Xn of the amount of money that user purchases. The first data Xk is correspondent to a position value j with a respective relation of j=n−k+1. The first data Xk is generated according to the value of the binary code dm−1dm−2 . . . d1d0 of the position value j being a 0 or 1, by formula Xk=hd0(. . . (hdm−2(hdm−1(Xn)))). If the binary code di=0, i=m−1, m−2, . . . , 1, 0, then the first one-way function h0 is used as an operating function. Otherwise, the second one-way function h1 is operated when the binary code di=1. Moreover, a function operating device for an electronic payment using an balanced binary tree is also disclosed. The present invention requires less calculation than that in the prior art, and thus is more effective.

Abstract: An electronic payment device and its method using an unbalanced binary tree are disclosed. The total unit n of the amount of money that user purchases is decomposed first into a Matrix of p rows×q columns. Then, a first one-way function h1 and a second one-way function h2 serve to define the one-way function operation of the first row and each column, respectively. When two numbers of operation times a and b are calculated by their formulas respectively, they are substituted into formula Xk=h2b(h1a(Xpq)). Namely, by the first one-way function h1, a times of operation is performed, and then by the second one-way function h2, b times of operation is performed, thus, a first data Xk of current consumption can be derived rapidly. The present invention has only a few times of operation, thus the calculating efficiency is improved greatly.

Abstract: A cryptographic checksum apparatus is disclosed. This apparatus includes a keystream generator configured to generate a secret keystream according to a common secret key. The apparatus also includes a postfix circuit configured to augment postfix bits after an original message. Further, a demultiplexer is used to direct the postfixed message to one of the output terminals under the control of the secret keystream. A first mixer is connected to one output terminal of the demultiplexer, and a second mixer is connected to the other output terminal of the demultiplexer. Moreover, a first compression circuit is used to receive an output of the first mixer, wherein content of the first compression circuit is used as the first part of the checksum output. Similarly, a second compression circuit is used to receive an output of the second mixer, wherein content of the second compression circuit is used as the second part of the checksum output.