Abstract: An authentication method of a server device and at least one client device with limited computational capability includes randomly generating an initial codeword using the client device. The initial codeword is generated from a linear combination of at least one base. The base is assigned to the client device and selected from a generator matrix that is stored in the server device and that corresponds to a linear code. The authentication method further includes generating an adapted codeword from the initial codeword using the client device. The authentication method also includes transmitting a transmission group to the server device using the client device. The transmission group includes an authentication data that includes the adapted codeword. In addition, the authentication method includes authenticating the client device using the server device and the transmission group received by the server device.

Abstract: A method for generating an image public key uses a predefined image as an input to the RSA algorithm to calculate a public key that includes the predefined image information. Translating the public key into an image generates an image public key. Therefore, the method allows a user to use a predefined image for identification and to generate a visible public key. That is, using the image public key easily identifies to whom the public key belongs so use of the wrong public key is less likely.

Abstract: A method for generating an image public key uses a predefined image as an input to the RSA algorithm to calculate a public key that includes the predefined image information. Translating the public key into an image generates an image public key. Therefore, the method allows a user to use a predefined image for identification and to generate a visible public key. That is, using the image public key easily identifies to whom the public key belongs so use of the wrong public key is less likely.

Abstract: Disclosed is a method for designing public key cryptosystems against fault-based attacks in which secret information stored in a tamperfree device is revealed during the encryption/decryption or signature generation processes due to fault-based attacks. A new fault-resistant system which enables any fault existing in modular multiplications and exponential computations to be detected with a very high probability based on a coding approach. This method can be used to implement all cryptosystems whose basic operations are modular multiplications for resisting both memory and computational fault-based attacks with a very low computational overhead.