Various organizations store data online rather than on physical servers.As the number of user’s data stored in cloud servers increases,the attack rate to access data from cloud servers also increases.Different resear...Various organizations store data online rather than on physical servers.As the number of user’s data stored in cloud servers increases,the attack rate to access data from cloud servers also increases.Different researchers worked on different algorithms to protect cloud data from replay attacks.None of the papers used a technique that simultaneously detects a full-message and partial-message replay attack.This study presents the development of a TKN(Text,Key and Name)cryptographic algorithm aimed at protecting data from replay attacks.The program employs distinct ways to encrypt plain text[P],a user-defined Key[K],and a Secret Code[N].The novelty of the TKN cryptographic algorithm is that the bit value of each text is linked to another value with the help of the proposed algorithm,and the length of the cipher text obtained is twice the length of the original text.In the scenario that an attacker executes a replay attack on the cloud server,engages in cryptanalysis,or manipulates any data,it will result in automated modification of all associated values inside the backend.This mechanism has the benefit of enhancing the detectability of replay attacks.Nevertheless,the attacker cannot access data not included in any of the papers,regardless of how effective the attack strategy is.At the end of paper,the proposed algorithm’s novelty will be compared with different algorithms,and it will be discussed how far the proposed algorithm is better than all other algorithms.展开更多
A new elliptic curve scalar multiplication algorithm is proposed. Thealgorithm uses the Frobenius map on optimal extension field (OEF) and addition sequence We introducea new algorithm on generating addition sequence ...A new elliptic curve scalar multiplication algorithm is proposed. Thealgorithm uses the Frobenius map on optimal extension field (OEF) and addition sequence We introducea new algorithm on generating addition sequence efficiently and also give some analysis about it.Based on this algorithm, a new method of computing scalar multiplication of elliptic curve over anOEF is presented. The new method is more efficient than the traditional scalar multiplicationalgorithms of elliptic curve over OEF. Thecomparisons of traditional method and the new method arealso given.展开更多
A new fast algorithm to compute modular exponentiation for very large integers is proposed in this paper, which is an improvement of the fast RSA algorithm based on Symmetry of Modular Multiplication(SMM). The SMM alg...A new fast algorithm to compute modular exponentiation for very large integers is proposed in this paper, which is an improvement of the fast RSA algorithm based on Symmetry of Modular Multiplication(SMM). The SMM algorithm obtains the speed improvement by conditional substitution on every basic operation to decrease the absolute value of product and the operation numbers of modular reductions. The proposed algorithm can get faster operation speed by decreasing the numbers of basic operations. Compared to conventional binary representation, a speed improvement of approximately 47.5% would be expected using the proposed algorithm.展开更多
Elliptic curve cryptosystem is the focus of public key cryptology nowadays, for it has many advantages RSA lacks. This paper introduced a new heuristic algorithm on computing multiple scalar multiplications of a given...Elliptic curve cryptosystem is the focus of public key cryptology nowadays, for it has many advantages RSA lacks. This paper introduced a new heuristic algorithm on computing multiple scalar multiplications of a given point. Based on this algorithm, a new method of computing scalar multiplication of elliptic curve over optimal extension field (OEF) using Frobenius map was presented. The new method is more efficient than the traditional ones. In the last part of this paper, the comparison was given in the end.展开更多
The variety of encryption mechanism and algorithms which were conventionally used have some limitations.The kernel operator library based on Cryptographic algorithm is put forward. Owing to the impenetrability of algo...The variety of encryption mechanism and algorithms which were conventionally used have some limitations.The kernel operator library based on Cryptographic algorithm is put forward. Owing to the impenetrability of algorithm, the data transfer system with the cryptographic algorithm library has many remarkable advantages in algorithm rebuilding and optimization,easily adding and deleting algorithm, and improving the security power over the traditional algorithm. The user can choose any one in all algorithms with the method against any attack because the cryptographic algorithm library is extensible.展开更多
A joint signature,encryption and error correction public-key cryptosystem is pre-sented based on an NP-completeness problem-the decoding problem of general linear codes inalgebraic coding theory,
B.Libert and J.Quisquater proposed an identity(ID)-based threshold decryption scheme. This paper found flaw in their security reduction and presented two methods to prove this scheme is resist against chosen-plaintext...B.Libert and J.Quisquater proposed an identity(ID)-based threshold decryption scheme. This paper found flaw in their security reduction and presented two methods to prove this scheme is resist against chosen-plaintext attack(CPA), based on the weaker model of security known as selective ID-based threshold CPA and the common model known as ID-based threshold CPA respectively.展开更多
This paper proposes a new secure e-voting protocol. This new scheme does not require a special voting channel and communication can occur entirely over the existing Internet. This method integrates Internet convenienc...This paper proposes a new secure e-voting protocol. This new scheme does not require a special voting channel and communication can occur entirely over the existing Internet. This method integrates Internet convenience and cryptology. In the existing protocols either the tallier has to wait for the decryption key from voter till the voting process is over or the verification process has to wait until the election is over. But in the proposed single transaction voting protocol the entire voting process as well as the verification process is done as a single transaction compared to multiple transactions in the existing protocol. The advantage of single transaction is that it consumes less time that results in overall speeding up the voting process. It is shown that the proposed scheme satisfies the more important requirements of any e-voting scheme: completeness, correctness, privacy, security and uniqueness. Finally, the proposed protocol is compared with the existing protocols such as Simple, Two Agency, Blind Signatures and sensus protocols.展开更多
The 21st century is the age of information when information becomes an important strategic resource. The information obtaining, processing and security guarantee capability are playing critical roles in comprehensive ...The 21st century is the age of information when information becomes an important strategic resource. The information obtaining, processing and security guarantee capability are playing critical roles in comprehensive national power, and information security is related to the national security and social stability. Therefore, we should take measures to ensure the information security of our country. In recent years, momentous accomplishments have been obtained with the rapid development of information security technology. There are extensive theories about information security and technology. However, due to the limitation of length, this article mainly focuses on the research and development of cryptology, trusted computing, security of network, and information hiding, etc.展开更多
With the development of network and information technologies, information security is more and more widely researched in China. To know where the work is and where it goes, we focus on comprehensively surveying the tw...With the development of network and information technologies, information security is more and more widely researched in China. To know where the work is and where it goes, we focus on comprehensively surveying the twenty years of important fundamental research by Chinese scholars, and giving, from our point of view, the significance as well as the outlook of future work. Some of the reviewed work, including the researches on fundamental theory of cryptography, cryptographic algorithm, security protocol, security infrastructure and information hiding, greatly advances the related sub-fields, and is highly recognized in and outside of China. Nevertheless, the overall work, we think, is still facing the problems of unbalanced development of sub-areas, limited scope of research, lack of systematic work and application, etc., leaving much room for improvement in the near future.展开更多
Shor proposed a quantum polynomial-time integer factorization algorithm to break the RSA public-key cryptosystem.In this paper,we propose a new quantum algorithm for breaking RSA by computing the order of the RSA ciph...Shor proposed a quantum polynomial-time integer factorization algorithm to break the RSA public-key cryptosystem.In this paper,we propose a new quantum algorithm for breaking RSA by computing the order of the RSA ciphertext C.The new algorithm has the following properties：1）recovering the RSA plaintext M from the ciphertext C without factoring n; 2）avoiding the even order of the element; 3）having higher success probability than Shor＇s; 4）having the same complexity as Shor＇s.展开更多
The SC2000 block cipher has a 128-bit block size and a user key of 128, 192 or 256 bits, which employs a total of 6.5 rounds if a 128-bit user key is used. It is a CRYPTREC recommended e-government cipher in Japan. In...The SC2000 block cipher has a 128-bit block size and a user key of 128, 192 or 256 bits, which employs a total of 6.5 rounds if a 128-bit user key is used. It is a CRYPTREC recommended e-government cipher in Japan. In this paper we address how to recover the user key from a few subkey bits of SC2000, and describe two 4.75-round differential characteristics with probability 2-126 of SC2000 and seventy-six 4.75-round differential characteristics with probability 2-127. Finally, we present a differential cryptanalysis attack on a 5-round reduced version of SC2000 when used with a 128-bit key; the attack requires 21256s chosen plaintexts and has a time complexity of 212575 5-round SC2000 encryptions. The attack does not threat the security of the full SC2000 cipher, but it suggests for the first time that the safety margin of SC2000 with a 128-bit key decreases below one and a half rounds.展开更多
Shor in 1994 proposed a quantum polynomial-time algorithm for finding the order r of an element a in the multiplicative group Z_(n)^(*),which can be used to factor the integer n by computing gcd(a^(r/2)±1,n),and ...Shor in 1994 proposed a quantum polynomial-time algorithm for finding the order r of an element a in the multiplicative group Z_(n)^(*),which can be used to factor the integer n by computing gcd(a^(r/2)±1,n),and hence break the famous RSA cryptosystem.However,the order r must be even.This restriction can be removed.So in this paper,we propose a quantum polynomial-time fixed-point attack for directly recovering the RSA plaintext M from the ciphertext C,without explicitly factoring the modulus n.Compared to Shor’s algorithm,the order r of the fixed-point C for RSA(e,n)satisfying C^(er)≡C(mod n)does not need to be even.Moreover,the success probability of the new algorithm is at least 4φ(r)/π^(2)r and higher than that of Shor’s algorithm,though the time complexity for both algorithms is about the same.展开更多
Achterbahn is one of the candidate stream ciphers submitted to the eSTREAM, which is the ECRYPT Stream Cipher Project. The cipher Achterbahn uses a new structure which is based on several nonlinear feedback shift regi...Achterbahn is one of the candidate stream ciphers submitted to the eSTREAM, which is the ECRYPT Stream Cipher Project. The cipher Achterbahn uses a new structure which is based on several nonlinear feedback shift registers （NLFSR） and a nonlinear combining output Boolean function. This paper proposes distinguishing attacks on Achterbahn-Version 1 and -Version 2 on the reduced mode and the full mode. These distinguishing attacks are based on linear approximations of the output functions. On the basis of these linear approximations and the periods of the registers, parity checks with noticeable biases are found. Then distinguishing attacks can be achieved through these biased parity checks. As to Achterbahn-Version 1, three cases that the output function has three possibilities are analyzed. Achterbahn-Version 2, the modification version of Achterbahn-Version 1, is designed to avert attacks based on approximations of the output Boolean function. Our attack with even much lower complexities on Achterbahn-Version 2 shows that Achterbahn-Version 2 cannot prevent attacks based on linear approximations.展开更多
Complexity measures for multisequences over finite fields, such as the joint linear complexity and the k-error joint linear complexity, play an important role in cryptology. In this paper we study a fast algorithm, pr...Complexity measures for multisequences over finite fields, such as the joint linear complexity and the k-error joint linear complexity, play an important role in cryptology. In this paper we study a fast algorithm, presented by Venkateswarlu A, to computer the k-error joint linear complexity of a binary periodic multisequence. In this paper, the aim is mainly to complement the theoretical derivation and proof of the existing algorithm. Moreover, our algorithm reduces computation.展开更多
In this paper we propose a new key distribution protocol for mobile communication systems.This protocol KDP4, like KDP3 in [3], is still secure against Simmons' replay attack and the new attack in [3] without us...In this paper we propose a new key distribution protocol for mobile communication systems.This protocol KDP4, like KDP3 in [3], is still secure against Simmons' replay attack and the new attack in [3] without using timestamps. It is a secure, efficient and practical key distribution protocol for mobile communication systems.展开更多
It has claimed that any practical way to achieve perfect reparability for key distribution protocol (KDP) could only be futile. Fortunately, this paper presents reparable KDPs for internet environments with the use of...It has claimed that any practical way to achieve perfect reparability for key distribution protocol (KDP) could only be futile. Fortunately, this paper presents reparable KDPs for internet environments with the use of the concept of timestamps.展开更多
We describe a batch RSA digital signature scheme in which a signer can sign messages for multiple recipients simultaneously. The construction is quite efficient due to the batch signing method. This is useful to impro...We describe a batch RSA digital signature scheme in which a signer can sign messages for multiple recipients simultaneously. The construction is quite efficient due to the batch signing method. This is useful to improve the performance of a high-loaded signing server, for example a secure electronic transaction （SET） gateway. Theoretical calculations and experimental results show that the proposed scheme can improve the performance of the signing server significantly.展开更多
基金Deanship of Scientific Research at Majmaah University for supporting this work under Project Number R-2023-811.
文摘Various organizations store data online rather than on physical servers.As the number of user’s data stored in cloud servers increases,the attack rate to access data from cloud servers also increases.Different researchers worked on different algorithms to protect cloud data from replay attacks.None of the papers used a technique that simultaneously detects a full-message and partial-message replay attack.This study presents the development of a TKN(Text,Key and Name)cryptographic algorithm aimed at protecting data from replay attacks.The program employs distinct ways to encrypt plain text[P],a user-defined Key[K],and a Secret Code[N].The novelty of the TKN cryptographic algorithm is that the bit value of each text is linked to another value with the help of the proposed algorithm,and the length of the cipher text obtained is twice the length of the original text.In the scenario that an attacker executes a replay attack on the cloud server,engages in cryptanalysis,or manipulates any data,it will result in automated modification of all associated values inside the backend.This mechanism has the benefit of enhancing the detectability of replay attacks.Nevertheless,the attacker cannot access data not included in any of the papers,regardless of how effective the attack strategy is.At the end of paper,the proposed algorithm’s novelty will be compared with different algorithms,and it will be discussed how far the proposed algorithm is better than all other algorithms.
文摘A new elliptic curve scalar multiplication algorithm is proposed. Thealgorithm uses the Frobenius map on optimal extension field (OEF) and addition sequence We introducea new algorithm on generating addition sequence efficiently and also give some analysis about it.Based on this algorithm, a new method of computing scalar multiplication of elliptic curve over anOEF is presented. The new method is more efficient than the traditional scalar multiplicationalgorithms of elliptic curve over OEF. Thecomparisons of traditional method and the new method arealso given.
文摘A new fast algorithm to compute modular exponentiation for very large integers is proposed in this paper, which is an improvement of the fast RSA algorithm based on Symmetry of Modular Multiplication(SMM). The SMM algorithm obtains the speed improvement by conditional substitution on every basic operation to decrease the absolute value of product and the operation numbers of modular reductions. The proposed algorithm can get faster operation speed by decreasing the numbers of basic operations. Compared to conventional binary representation, a speed improvement of approximately 47.5% would be expected using the proposed algorithm.
文摘Elliptic curve cryptosystem is the focus of public key cryptology nowadays, for it has many advantages RSA lacks. This paper introduced a new heuristic algorithm on computing multiple scalar multiplications of a given point. Based on this algorithm, a new method of computing scalar multiplication of elliptic curve over optimal extension field (OEF) using Frobenius map was presented. The new method is more efficient than the traditional ones. In the last part of this paper, the comparison was given in the end.
文摘The variety of encryption mechanism and algorithms which were conventionally used have some limitations.The kernel operator library based on Cryptographic algorithm is put forward. Owing to the impenetrability of algorithm, the data transfer system with the cryptographic algorithm library has many remarkable advantages in algorithm rebuilding and optimization,easily adding and deleting algorithm, and improving the security power over the traditional algorithm. The user can choose any one in all algorithms with the method against any attack because the cryptographic algorithm library is extensible.
基金Subject supported by the National Natural Science Fund of China
文摘A joint signature,encryption and error correction public-key cryptosystem is pre-sented based on an NP-completeness problem-the decoding problem of general linear codes inalgebraic coding theory,
文摘B.Libert and J.Quisquater proposed an identity(ID)-based threshold decryption scheme. This paper found flaw in their security reduction and presented two methods to prove this scheme is resist against chosen-plaintext attack(CPA), based on the weaker model of security known as selective ID-based threshold CPA and the common model known as ID-based threshold CPA respectively.
文摘This paper proposes a new secure e-voting protocol. This new scheme does not require a special voting channel and communication can occur entirely over the existing Internet. This method integrates Internet convenience and cryptology. In the existing protocols either the tallier has to wait for the decryption key from voter till the voting process is over or the verification process has to wait until the election is over. But in the proposed single transaction voting protocol the entire voting process as well as the verification process is done as a single transaction compared to multiple transactions in the existing protocol. The advantage of single transaction is that it consumes less time that results in overall speeding up the voting process. It is shown that the proposed scheme satisfies the more important requirements of any e-voting scheme: completeness, correctness, privacy, security and uniqueness. Finally, the proposed protocol is compared with the existing protocols such as Simple, Two Agency, Blind Signatures and sensus protocols.
基金the National Natural Science Foundation of China(Grant Nos.60373087,60673071and 60572155)the National High-Tech Development 863 Progranm of China(Grant No.2006AA01Z442)
文摘The 21st century is the age of information when information becomes an important strategic resource. The information obtaining, processing and security guarantee capability are playing critical roles in comprehensive national power, and information security is related to the national security and social stability. Therefore, we should take measures to ensure the information security of our country. In recent years, momentous accomplishments have been obtained with the rapid development of information security technology. There are extensive theories about information security and technology. However, due to the limitation of length, this article mainly focuses on the research and development of cryptology, trusted computing, security of network, and information hiding, etc.
基金Supported by the National Natural Science Foundation of China under Grant No. 60025205. Acknowledgements Xian-Feng Zhao et al. for of the survey. We would like to thank Dr. their assistance in our writing
文摘With the development of network and information technologies, information security is more and more widely researched in China. To know where the work is and where it goes, we focus on comprehensively surveying the twenty years of important fundamental research by Chinese scholars, and giving, from our point of view, the significance as well as the outlook of future work. Some of the reviewed work, including the researches on fundamental theory of cryptography, cryptographic algorithm, security protocol, security infrastructure and information hiding, greatly advances the related sub-fields, and is highly recognized in and outside of China. Nevertheless, the overall work, we think, is still facing the problems of unbalanced development of sub-areas, limited scope of research, lack of systematic work and application, etc., leaving much room for improvement in the near future.
基金Supported by the National Natural Science Foundation of China(61303212,61202386)the State Key Program of National Natural Science of China(61332019)the Major Research Plan of the National Natural Science Foundation of China(91018008,SKLSE-2015-A-02)
文摘Shor proposed a quantum polynomial-time integer factorization algorithm to break the RSA public-key cryptosystem.In this paper,we propose a new quantum algorithm for breaking RSA by computing the order of the RSA ciphertext C.The new algorithm has the following properties：1）recovering the RSA plaintext M from the ciphertext C without factoring n; 2）avoiding the even order of the element; 3）having higher success probability than Shor＇s; 4）having the same complexity as Shor＇s.
文摘The SC2000 block cipher has a 128-bit block size and a user key of 128, 192 or 256 bits, which employs a total of 6.5 rounds if a 128-bit user key is used. It is a CRYPTREC recommended e-government cipher in Japan. In this paper we address how to recover the user key from a few subkey bits of SC2000, and describe two 4.75-round differential characteristics with probability 2-126 of SC2000 and seventy-six 4.75-round differential characteristics with probability 2-127. Finally, we present a differential cryptanalysis attack on a 5-round reduced version of SC2000 when used with a 128-bit key; the attack requires 21256s chosen plaintexts and has a time complexity of 212575 5-round SC2000 encryptions. The attack does not threat the security of the full SC2000 cipher, but it suggests for the first time that the safety margin of SC2000 with a 128-bit key decreases below one and a half rounds.
基金Supported by Nanhu Scholars Program for Young Scholars of Xinyang Normal University。
文摘Shor in 1994 proposed a quantum polynomial-time algorithm for finding the order r of an element a in the multiplicative group Z_(n)^(*),which can be used to factor the integer n by computing gcd(a^(r/2)±1,n),and hence break the famous RSA cryptosystem.However,the order r must be even.This restriction can be removed.So in this paper,we propose a quantum polynomial-time fixed-point attack for directly recovering the RSA plaintext M from the ciphertext C,without explicitly factoring the modulus n.Compared to Shor’s algorithm,the order r of the fixed-point C for RSA(e,n)satisfying C^(er)≡C(mod n)does not need to be even.Moreover,the success probability of the new algorithm is at least 4φ(r)/π^(2)r and higher than that of Shor’s algorithm,though the time complexity for both algorithms is about the same.
基金This work was supported by tile National Natural Science Foundation of China under Grant No.60673068the National Grand Fundamental Research 973 Program of China under Grant No.2004CB318004.
文摘Achterbahn is one of the candidate stream ciphers submitted to the eSTREAM, which is the ECRYPT Stream Cipher Project. The cipher Achterbahn uses a new structure which is based on several nonlinear feedback shift registers （NLFSR） and a nonlinear combining output Boolean function. This paper proposes distinguishing attacks on Achterbahn-Version 1 and -Version 2 on the reduced mode and the full mode. These distinguishing attacks are based on linear approximations of the output functions. On the basis of these linear approximations and the periods of the registers, parity checks with noticeable biases are found. Then distinguishing attacks can be achieved through these biased parity checks. As to Achterbahn-Version 1, three cases that the output function has three possibilities are analyzed. Achterbahn-Version 2, the modification version of Achterbahn-Version 1, is designed to avert attacks based on approximations of the output Boolean function. Our attack with even much lower complexities on Achterbahn-Version 2 shows that Achterbahn-Version 2 cannot prevent attacks based on linear approximations.
基金supported by the National Natural Science Foundation of China (61370089)the Fundamental Research Funds for the Central Universities (2012HGBZ0622)
文摘Complexity measures for multisequences over finite fields, such as the joint linear complexity and the k-error joint linear complexity, play an important role in cryptology. In this paper we study a fast algorithm, presented by Venkateswarlu A, to computer the k-error joint linear complexity of a binary periodic multisequence. In this paper, the aim is mainly to complement the theoretical derivation and proof of the existing algorithm. Moreover, our algorithm reduces computation.
文摘In this paper we propose a new key distribution protocol for mobile communication systems.This protocol KDP4, like KDP3 in [3], is still secure against Simmons' replay attack and the new attack in [3] without using timestamps. It is a secure, efficient and practical key distribution protocol for mobile communication systems.
基金This work is supported by NSFC for Outstanding Young Scientists ( No. 69425001) and National "973" (No. 1999035805)
文摘It has claimed that any practical way to achieve perfect reparability for key distribution protocol (KDP) could only be futile. Fortunately, this paper presents reparable KDPs for internet environments with the use of the concept of timestamps.
基金the National Basic Research Program(973) of China (No. 2005CB321804)
文摘We describe a batch RSA digital signature scheme in which a signer can sign messages for multiple recipients simultaneously. The construction is quite efficient due to the batch signing method. This is useful to improve the performance of a high-loaded signing server, for example a secure electronic transaction （SET） gateway. Theoretical calculations and experimental results show that the proposed scheme can improve the performance of the signing server significantly.
