Pages that link to "Item:Q4145254"
From MaRDI portal
The following pages link to A method for obtaining digital signatures and public-key cryptosystems (Q4145254):
Displaying 50 items.
- Insecure primitive elements in an ElGamal signature protocol (Q5069670) (← links)
- A Public Key Cryptosystem Using Hiil's Cipher (Q5069693) (← links)
- An Information Fusion approach based on prime numbers coming from RSA algorithm and Fractals for secure coding (Q5069723) (← links)
- Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form (Q5069746) (← links)
- Strong Designated Verifier Signature Scheme Based on Discrete Logarithm Problem (Q5069753) (← links)
- Two is better than one: How to securely combine two assumptions (Q5069998) (← links)
- Kleptographic (algorithmic) backdoors in the RSA key generator (Q5071221) (← links)
- Exploiting the security of N = prqs through approximation of ϕ(N) (Q5083870) (← links)
- On the Communication Complexity of Key-Agreement Protocols. (Q5090417) (← links)
- (Q5093674) (← links)
- Authentication and delegation with smart-cards (Q5096225) (← links)
- Modelling a public-key infrastructure (Q5096419) (← links)
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm (Q5101024) (← links)
- A Hybrid Threshold Group Signature Scheme with Distinguished Signing Authority (Q5117266) (← links)
- Continuous variable controlled quantum dialogue and secure multiparty quantum computation (Q5130752) (← links)
- Efficient network authentication protocols: Lower bounds and optimal implementations (Q5137012) (← links)
- Secure reliable multicast protocols in a WAN (Q5137892) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Delegation of cryptographic servers for capture-resilient devices (Q5138499) (← links)
- Representation of integers: a nonclassical point of view (Q5145848) (← links)
- An Asymmetric Image Encryption Algorithm Based on a Fractional-Order Chaotic System and the RSA Public-Key Cryptosystem (Q5148887) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- A SEMANTICALLY SECURE PUBLIC-KEY CRYPTOSYSTEM BASED ON RSA (Q5150698) (← links)
- ON GENERIC COMPLEXITY OF THE PROBLEM OF FINDING ROOTS IN GROUPS OF RESIDUES (Q5151084) (← links)
- Calculation of random pairs of primes whose product lies in a given short interval (Q5151308) (← links)
- A new method for generating keys in the RSA cryptosystem (Q5151315) (← links)
- Атаки на схемы электронной подписи, не учитываемые традиционными определениями стойкости, и меры противодействия им (Q5152416) (← links)
- Efficient Image Encryption Scheme Based on 4-Dimensional Chaotic Maps (Q5155487) (← links)
- (Q5163746) (← links)
- Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546) (← links)
- The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance (Q5188548) (← links)
- Speeding up the computations on an elliptic curve using addition-subtraction chains (Q5202278) (← links)
- (Q5204073) (← links)
- (Q5214717) (← links)
- SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM (Q5220267) (← links)
- Some active attacks on fast server-aided secret computation protocols for modular exponentiation (Q5235424) (← links)
- Access with pseudonyms (Q5235426) (← links)
- Public-key cryptography on smart cards (Q5235428) (← links)
- Integrating smart cards into authentication systems (Q5235430) (← links)
- Optimal observables for minimum-error state discrimination in general probabilistic theories (Q5245809) (← links)
- Cryptographic Voting — A Gentle Introduction (Q5253589) (← links)
- Quantum blind signature with an offline repository (Q5258466) (← links)
- MEMRISTOR CELLULAR AUTOMATA AND MEMRISTOR DISCRETE-TIME CELLULAR NEURAL NETWORKS (Q5305148) (← links)
- Key management for Pay-TV broadcast systems in hierarchy (Q5307744) (← links)
- An efficient ID-based user identification scheme for mutual authentication in mobile environments (Q5307753) (← links)
- Generalised Mersenne numbers revisited (Q5326517) (← links)
- A new quantum algorithm for computing RSA ciphertext period (Q5371904) (← links)
- When e-th Roots Become Easier Than Factoring (Q5387090) (← links)
- How to Build a Hash Function from Any Collision-Resistant Function (Q5387097) (← links)
- A NOVEL EFFICIENT ACCESS CONTROL SCHEME FOR LARGE-SCALE DISTRIBUTED WIRELESS SENSOR NETWORKS (Q5404515) (← links)
