![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
AKA Protocols for Mobile Communications
This paper proposes a modified signcryption scheme that provides signer anonymity. In addition, an efficient 2-pass authentication and key agreement protocol that uses the proposed signcryption scheme is prese...
-
Chapter and Conference Paper
New Public-Key Cryptosystem Using Divisor Class Groups
We show how to use ideal arithmetic in the divisor class group of an affine normal subring of K[X, Y] generated by monomials, where K is a field, to design new public-key cryptosystems, whose security is based on...
-
Chapter and Conference Paper
RSA Speedup with Residue Number System Immune against Hardware Fault Cryptanalysis
This article considers the problem of how to prevent the fast RSA signature and decryption computation with residue number system (or called the CRT-based approach) speedup from a hardware fault cryptanalysis ...
-
Chapter and Conference Paper
A Countermeasure against One Physical Cryptanalysis May Benefit Another Attack
Recently, many research works have been reported about how physical cryptanalysis can be carried out on cryptographic devices by exploiting any possible leaked information through side channels. In this paper,...
-
Chapter and Conference Paper
Permanent Fault Attack on the Parameters of RSA with CRT
Chinese remainder theorem has been widely employed to speedup the RSA computation. In this paper, one kind of permanent fault attack on RSA with CRT will be pointed out which exploits a permanent fault on the ...
-
Chapter and Conference Paper
Efficient Distributed Signcryption Scheme as Group Signcryption
The existing distributed signcryption is designed for distributing a signcrypted message to a designated group. However, it does not provide confidentiality of sender ID and its extension to a group signcrypti...
-
Chapter and Conference Paper
Public-Key Cryptosystems Based on Class Semigroups of Imaginary Quadratic Non-maximal Orders
In this paper we propose a key-exchange system and a public-key encryption scheme based on the class semigroups of imaginary quadratic non-maximal orders, the former is analogous to the Diffie-Hellman’s key-ex...
-
Chapter and Conference Paper
Hardware Fault Attack on RSA with CRT Revisited
In this paper, some powerful fault attacks will be pointed out which can be used to factorize the RSA modulus if CRT is employed to speedup the RSA computation. These attacks are generic and can be applicable ...
-
Chapter and Conference Paper
Security Analysis of Two Signcryption Schemes
Signcryption is a new cryptographic primitive that performs signing and encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then-encryption approach. In thi...
-
Chapter and Conference Paper
A Robust Double Auction Protocol Based on a Hybrid Trust Model
Recently, Wang and Leung proposed a set of double auction protocols with full privacy protection based on distributed ElGamal encryption. Unfortunately, their protocols are expensive in computation and are not...
-
Chapter and Conference Paper
Power Analysis by Exploiting Chosen Message and Internal Collisions – Vulnerability of Checking Mechanism for RSA-Decryption
In this paper, we will point out a new side-channel vulnerability of cryptosystems implementation based on BRIP or square-multiply-always algorithm by exploiting specially chosen input message of order two. A ...
-
Chapter and Conference Paper
Side Channel Cryptanalysis on SEED
The Korea standard block cipher, SEED, is a 128-bit symmetric block cipher with a more complex F function than DES. This paper shows that SEED is vulnerable to two types of side channel attacks, a fault analys...
-
Chapter and Conference Paper
Efficient Group Key Management for Dynamic Peer Networks
In dynamic peer networks, how to promote the performance of group key management without sacrificing the desired security is a critical and difficult problem. In this paper, a secure, efficient and distributed...
-
Chapter and Conference Paper
An Improved Double Auction Protocol Against False Bids
M. Yokoo et al. analyzed some weaknesses in McAfee’s double auction (MCD) protocol and proposed a robust threshold price double auction (TPD) protocol against false-name bids. Unfortunately, as their protocol str...
-
Chapter and Conference Paper
How to Solve Key Escrow and Identity Revocation in Identity-Based Encryption Schemes
In identity-based cryptography, a user’s public key is easily derived from the user’s identity and a corresponding private key is generated for the user by a trusted third party, known as a Key Generation Cent...
-
Chapter and Conference Paper
Dragon: A Fast Word Based Stream Cipher
This paper presents Dragon, a new stream cipher constructed using a single word based non-linear feedback shift register and a non-linear filter function with memory. Dragon uses a variable length key and init...
-
Chapter and Conference Paper
Improvement on Ha-Moon Randomized Exponentiation Algorithm
Randomized recoding on the exponent of an exponentiation computation into a signed-digit representation has been a well known countermeasure against some side-channel attacks. However, this category of counter...
-
Chapter and Conference Paper
On the Security of the Authentication Module of Chinese WLAN Standard Implementation Plan
Compared with the original standard, the greatest change that WAPI (Chinese WLAN security standard) implementation plan made lies in the key-agreement protocol in WAI (Wireless Authentication Infrastructure). ...
-
Chapter and Conference Paper
Cryptanalysis of Two Protocols for RSA with CRT Based on Fault Infection
The technique of RSA private computation speedup by using Chinese Remainder Theorem (CRT) is well known and has already been widely employed in almost all RSA implementations. A recent CRT-based factorization ...
-
Chapter and Conference Paper
Relative Doubling Attack Against Montgomery Ladder
Highly regular execution and the cleverly included redundant computation make the square-multiply-always exponentiation algorithm well known as a good countermeasure against the conventional simple power analy...