A New Fast Modular Arithmetic Method in Public Key Cryptography

0 IntroductionPublic key cryptosystemsolvedthe secure problemof keydistributionsoundlyinsymmetric cryptosystem[1],real-ized digital signature and message authentication successfullyin secureinformationsystem. However ,secure applications ofthemneed badly high-speedsoftware,hardware,andarithme-tic computation of large number .Furthermore,the secret ex-ponent cannot betoosmall[2]and operands should be 1 024 bitorlarger[3]whenthe securitylevel is set high.So,manylargeinteger modular multiplicatio…     

A new secure password authentication scheme using smart cards

Thirteen security requirements for an ideal password authentication scheme using smart cards are listed and a new smart card based password authentication scheme with identity anonymity is proposed. The new scheme can satisfy all the listed ideal security requirements and has the following merits： （1） it can resist all the attacks listed in introduction; （2） less storage memory requirement due to no verification table stored in server; （3） low computational cost due to hash functions based operations; （4） even if the smart card is lost, the new system is still secure; （5） As user identity is anonymous, this scheme is more practical. The new proposed scheme can be applied in source constraint networks.     

Evolutionary Random Sequence Generators Based on LFSR

0 Introduction With the development of cryptography, the need for random numbers of high quality is sharply growing. Pub- lic/private keypairs for asymmetric algorithms are gener- ated from random bit streams[1,2]; random numbers are also used for key gen…