Two signature systems based on smart cards and fingerprint features are proposed. In one signature system, the cryptographic key is stored in the smart card and is only accessible when the signer＇s extracted fingerpr...Two signature systems based on smart cards and fingerprint features are proposed. In one signature system, the cryptographic key is stored in the smart card and is only accessible when the signer＇s extracted fingerprint features match his stored template. To resist being tampered on public channel, the user＇s message and the signed message are encrypted by the signer＇s public key and the user＇s public key, respectively. In the other signature system, the keys are generated by combining the signer＇s fingerprint features, check bits, and a rememberable key, and there are no matching process and keys stored on the smart card. Additionally, there is generally more than one public key in this system, that is, there exist some pseudo public keys except a real one.展开更多
A model of the hierarchical key assignment scheme is approached in this paper, which can be used with any cryptography algorithm. Besides, the optimal dynamic control property of a hierarchical key assignment scheme w...A model of the hierarchical key assignment scheme is approached in this paper, which can be used with any cryptography algorithm. Besides, the optimal dynamic control property of a hierarchical key assignment scheme will be defined in this paper. Also, our scheme model will meet this property.展开更多
Let q be a power of a prime and φ be the Frobenius endomorphism on E（Fqk）, then q = tφ - φ^2. Applying this equation, a new algorithm to compute rational point scalar multiplications on elliptic curves by finding...Let q be a power of a prime and φ be the Frobenius endomorphism on E（Fqk）, then q = tφ - φ^2. Applying this equation, a new algorithm to compute rational point scalar multiplications on elliptic curves by finding a suitable small positive integer s such that q^s can be represented as some very sparse φ-polynomial is proposed. If a Normal Basis （NB） or Optimal Normal Basis （ONB） is applied and the precomputations are considered free, our algorithm will cost, on average, about 55% to 80% less than binary method, and about 42% to 74% less than φ-ary method. For some elliptic curves, our algorithm is also taster than Mǖller＇s algorithm. In addition, an effective algorithm is provided for finding such integer s.展开更多
In this paper we introduce a cryptosystem based on the quotient groups of the group of rational points of an elliptic curve defined over p-adic number field. Some additional parameters are taken in this system, which ...In this paper we introduce a cryptosystem based on the quotient groups of the group of rational points of an elliptic curve defined over p-adic number field. Some additional parameters are taken in this system, which have an advantage in performing point multiplication while keeping the security of ECC over finite fields. We give a method to select generators of the cryptographic groups, and give a way to represent the elements of the quotient groups with finitely bounded storage by establishing a bijection between these elements and their approximate coordinates. The addition formula under this representation is also presented.展开更多
基金This project was supported by the National Science Foundation of China (60763009)China Postdoctoral Science Foundation (2005038041)Hainan Natural Science Foundation (80528).
文摘Two signature systems based on smart cards and fingerprint features are proposed. In one signature system, the cryptographic key is stored in the smart card and is only accessible when the signer＇s extracted fingerprint features match his stored template. To resist being tampered on public channel, the user＇s message and the signed message are encrypted by the signer＇s public key and the user＇s public key, respectively. In the other signature system, the keys are generated by combining the signer＇s fingerprint features, check bits, and a rememberable key, and there are no matching process and keys stored on the smart card. Additionally, there is generally more than one public key in this system, that is, there exist some pseudo public keys except a real one.
基金Supported by the National Natural Science Foun-dation of China (70271068)
文摘A model of the hierarchical key assignment scheme is approached in this paper, which can be used with any cryptography algorithm. Besides, the optimal dynamic control property of a hierarchical key assignment scheme will be defined in this paper. Also, our scheme model will meet this property.
基金Supported by the National 973 High Technology Projects (No. G1998030420)
文摘Let q be a power of a prime and φ be the Frobenius endomorphism on E（Fqk）, then q = tφ - φ^2. Applying this equation, a new algorithm to compute rational point scalar multiplications on elliptic curves by finding a suitable small positive integer s such that q^s can be represented as some very sparse φ-polynomial is proposed. If a Normal Basis （NB） or Optimal Normal Basis （ONB） is applied and the precomputations are considered free, our algorithm will cost, on average, about 55% to 80% less than binary method, and about 42% to 74% less than φ-ary method. For some elliptic curves, our algorithm is also taster than Mǖller＇s algorithm. In addition, an effective algorithm is provided for finding such integer s.
基金Supported by the National Natural Science Foundation of China (Grant Nos. 60763009 and 10531060) the National 863 Project (Grant No.2007AA701315)
文摘In this paper we introduce a cryptosystem based on the quotient groups of the group of rational points of an elliptic curve defined over p-adic number field. Some additional parameters are taken in this system, which have an advantage in performing point multiplication while keeping the security of ECC over finite fields. We give a method to select generators of the cryptographic groups, and give a way to represent the elements of the quotient groups with finitely bounded storage by establishing a bijection between these elements and their approximate coordinates. The addition formula under this representation is also presented.
