-
1
-
2
Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations
Published 2023-11-01“… In this paper we consider a modification of the attack on the classic RSA cryptosystem aimed at factoring the public modulus n, which is a product of three primes. …”
Get full text
Article -
3
DNA algorithm of primeness test based on finite automaton
Published 2006-01-01“…Finite automaton,a computational model of extremely limited computing ability,was proved to have the capa-bility of solving primeness test by construction.Then,a DNA algorithm of the primeness test based on finite automaton was proposed.Furthermore,the method of constructing the finite automaton was presented in detail.The state of the fi-nite automaton was encoded by single-stranded DNA.The input was encoded by double-stranded DNA.The transition rule was represented by a double strand with a ring.The state of transition was realized by enzyme-mediated chemical reactions.The innovation of the algorithm is that it can be applied not only in primeness test but also in prime factoriza-tion and further in attack of RSA cipher.The advantage of this method is that it can be easily implemented.The time re-quired is polynomial in the size of the problem instead of exponential in the size of the problem.…”
Get full text
Article -
4
-
5
-
6
A high offset stem design does not increase stem migration under full weight bearing in cementless total hip arthroplasty: a model-based RSA study
Published 2025-02-01“…This study aimed to evaluate the primary and secondary stability of a cementless high-offset femoral component under full weight-bearing conditions using model-based RSA, comparing it with a standard offset stem in patients undergoing THA. …”
Get full text
Article -
7
Study of BGP secure scheme based on divide and conquer strategy
Published 2012-05-01“…A new approach was studied for BGP security:SE-BGP.By analyzing the security of SE-BGP,was found it had some secure leaks which couldnt resist active attack.To solve these secure problems of SE-BGP,an AS-alliance-based secure BGP scheme :SA-BGP was proposed,which used the aggregate signatures algorithm based on RSA.The SA-BGP has strong ability of security that can effectively verify the propriety of IP prefix origination and verifies the validity of an AS to announce network layer reachability information (NLRI).SA-BGP can large-scale reduced the number of the used certificates.Performance evaluation results that SA-BGP can be implemented efficiently and the incurred overhead,in terms of time and space,ptable in practice.…”
Get full text
Article -
8
On novel security systems based on the 2-cyclic refined integers and the foundations of 2-cyclic refined number theory
Published 2024-03-01“…Also, this work presents two novel crypto schemes for the encryption and decryption of data and information based on the algebraic properties of 2-cyclic refined integers, where improved versions of the El-Gamal crypto-scheme and RSA algorithm will be established through the view of the algebra and number theory of 2-cyclic refined integers. …”
Get full text
Article -
9
Research on Security Algorithm for Crossing Heterogeneous Network Based on Unified Communication Technology
Published 2013-12-01“…However, in order to guarantee the availability, safety of the communication between heterogeneous networks has been reduced. Based on the study of heterogeneous networks through the issues and the status quo on the symmetric key cryptography, asymmetric key cryptosystem in-depth research, an encryption algorithm based on the RSA algorithm and improved DES algorithm was proposed. …”
Get full text
Article -
10
Efficient revocable attribute-based encryption scheme
Published 2019-06-01“…In the existing solutions,the time-based scheme is difficult to achieve immediate revocation,and the third-party-based scheme often requires re-encryption,which needs large amount of calculation and doesn’t apply to mas-sive data.To solve the problem,an efficient and immediate CP-ABE scheme was proposed to support user and attribute lev-els revocation.The scheme was based on the classic LSSS access structure,introducing RSA key management mechanism and attribute authentication.By means of a semi-trusted third party,the user could be authenticated before decryption.Com-pared with the existing revocation schemes,The proposed scheme didn’t need the user to update the key or re-encrypt the ciphertext.The semi-trusted third party wasn’t required to update the RSA attribute authentication key.The scheme greatly reduced the amount of computation and traffic caused by revocation,while ensuring anti-collusion attacks and forward and backward security.Finally,the security analysis and experimental simulation show that the scheme has higher revocation ef-ficiency.…”
Get full text
Article -
11
Evaluation and refinement of thresholds for early migration of total knee replacements as an estimator of late aseptic loosening: an updated systematic review of RSA and survival s...
Published 2025-01-01“… Background and purpose: This study updates 2 parallel systematic reviews and meta-analyses from 2012, which established the 1-year radiostereometric (RSA) migration thresholds for tibial components of total knee replacements (TKR) based on the risk of late revision for aseptic loosening from survival studies. …”
Get full text
Article -
12
AllianceBlockchain in the Governance Innovation of Internet Hospitals
Published 2024-12-01Subjects: Get full text
Article -
13
Efficient and safe auditable mixed-coin service scheme based on blind signature
Published 2020-08-01“…The mixed-coin service can provide solutions for the privacy problem of blockchain,but it still faces efficiency bottlenecks and security risks.To further improve the efficiency and security protection of the mixed-coin service,an efficient and safe auditable mixed-coin service scheme based on blind signature was proposed.Firstly,this scheme added audit measures.It added an audit blockchain to the traditional mix-coin model to record the behavior of users and mixers,achieving traceability and accountability.Then,this method used elliptic curves algorithm to construct blind signatures instead of blind signature schemes based on bilinear pairs or RSA.Finally,this scheme proposed an auditable blind mix-coin service agreement based on the auditable mix-coin model and the blind signature algorithm based on elliptic curve.Simulation analysis shows that the proposed scheme has six security features,such as auditability and anti-theft attack,while providing privacy protection.Under the same security intensity,the proposed scheme can effectively reduce the computational overhead and storage overhead.…”
Get full text
Article -
14
-
15
Short signature based on factoring problem in the standard model
Published 2011-01-01“…A short signature scheme based on factoring problem in the standard model was proposed.To design this sig-nature scheme,the generic construction of fully-secure signatures from weakly-secure signatures and a chameleon hash were employed.A signature in this scheme was compromised of one element in,and the public key was short,requir-ing only the modulus N,one element of,one integer and one pseudorandom function seed.Compared with Hohen-berger’s RSA scheme(Crypto 09),the computaional cost of the sign algorithm and verification algorithm in this scheme is also much lower.…”
Get full text
Article -
16
Design and detection of hardware Trojan based on satisfiability don't cares
Published 2021-04-01Get full text
Article -
17
Adaptor signature scheme based on ISRSAC digital signature algorithm
Published 2023-03-01“…The adapter signature scheme can provide good properties of atomic exchange in the block chain, and has been widely used in practice.A new adapter signature scheme was constructed based on a digital signature algorithm for improved security of RSA cryptosystem (ISRSAC).After proving that the proposed scheme satisfied the correctness of the pre-signature, unforgeability, adaptability of the pre-signature, extractability of the evidence and the security of the signature scheme, it was compared with the adapter signature scheme based on the SM2 digital signature algorithm, the Schnorr-based adapter signature scheme and the ECDSA-based adapter signature scheme.And these schemes were analyzed in terms of time overhead and main calculation amount.The analysis results show that the proposed scheme is similar to other schemes in terms of time overhead, but the proposed scheme expands the application scenarios of ISRSAC algorithm in the current environment, and through the combination of ISRSAC algorithm and adapter signature technology, the selection of adapter signature is more flexible and can have a wider range of applications.…”
Get full text
Article -
18
Two-party cooperative blind signature based on SM2
Published 2022-12-01“…SM2, issued by China in 2010, is a public key cryptography standard based on elliptic curves.It has been widely used in finance, social security and other fields thanks to its advantages of improved signature efficiency, decreased storage space and computing complexity than RSA.With the popularization and application of SM2, the issues of its key security and data privacy are of great concern.The single-key mode inhibits the potential application in multi-user settings, and the leakage of the key will threaten the security of the entire cryptosystem due to the centralization.The problem of secure storage and reasonable utilization of keys needs to be solved urgently.In addition, the SM2 digital signature algorithm cannot guarantee the message privacy.Aiming at the issues of key security and data privacy of the signature algorithm, many researchers have proposed the idea of cooperative signature and blind signature for SM2.However, there isn’t SM2 collaborative blind signature scheme proposed.Then a two-party cooperative blind signing protocol based on SM2 was proposed in this paper, which allowed two parties to sign except the user.The signing process did not require recovering the complete private key, while not revealing the information of the partial private key and secret number.The key was stored separately to improve the security of the key, while the blind signature protected the privacy of the message.In terms of security, the protocol satisfied unforgeability and unlinkability.The protocol was implemented using C to demonstrate the efficiency of each participant’s local operation.In the honest model, the time cost of each entity in the cooperative signature phase was similar as that of executing a lightweight SM2 blind signature.Overall, the proposed protocol has certain advantages in terms of function and efficiency.…”
Get full text
Article -
19
Simple power analysis attack against cryptosystems based on Montgomery algorithm
Published 2013-08-01“…In particular, a SPA attack against RSA cryptosystem was showed based on large integer modular exponentiation. …”
Get full text
Article -
20
Privilege separation of data sharing scheme using attribute-based encryption
Published 2014-11-01“…Attribute-based encryption (ABE),which can provide fine-grained access control and flexible one-to-many encryption,has been envisioned as an important data sharing approach to achieve privacy preserving in the distributed environment.However,the flourish of the data sharing approach using attribute-based encryption still hinges upon how to fully understand and manage the challenges facing in the distributed environment,especially the veracity of the data.In fact,all of the existing data sharing schemes allow data owner to modify data without restrictions,in which the veracity of the data has been questioned and that cannot satisfy the demands of practical application sometimes,such as personal electronic medical records or assessment systems.A data sharing scheme with privilege separation is presented,in which the veracity of the data can be ensured and the flexible access control can be provided.Based on RSA-based proxy encryption,a new efficient privilege separation mechanism is introduced to ensure the veracity of the data; exploiting attribute-based encryption,the data owner can define the access policy to achieve fine-grained access control.Detailed security analysis shows that the proposed data sharing scheme can provide the data confidentiality to achieve privacy preserving.In addition,the performance analysis demonstrates the scheme’s effectiveness in terms of the computation costs.…”
Get full text
Article