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.
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits (Q2829941) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- A Practical Cryptanalysis of the Algebraic Eraser (Q2835587) (← links)
- The \(k\)-ary Montgomery modular inverse over nonbinary computers (Q2851596) (← links)
- Efficient and adaptive threshold signatures for ad hoc networks (Q2864187) (← links)
- Provably secure and pairing-free certificateless digital signature scheme using elliptic curve cryptography (Q2874306) (← links)
- A Unified Framework for Small Secret Exponent Attack on RSA (Q2889876) (← links)
- Post quantum cryptography from mutant prime knots (Q2893169) (← links)
- Cryptanalysis of a public key cryptosystem based on boolean permutations (Q2895972) (← links)
- Crypto Galore! (Q2908530) (← links)
- Computational Number Theory and Cryptography (Q2926150) (← links)
- Universal characteristics of fractal fluctuations in prime number distribution (Q2930728) (← links)
- Partial Key Exposure Attack on CRT-RSA (Q2945387) (← links)
- Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem (Q2946396) (← links)
- RSA and Elliptic Curve Least Significant Bit Security (Q2946472) (← links)
- New Attacks on RSA with Moduli N = p r q (Q2947095) (← links)
- Factoring RSA Moduli with Weak Prime Factors (Q2947096) (← links)
- A Signature Scheme for a Dynamic Coalition Defence Environment Without Trusted Third Parties (Q2947120) (← links)
- Signatures and Efficient Proofs on Committed Graphs and NP-Statements (Q2948189) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Speed Optimizations in Bitcoin Key Recovery Attacks (Q2970262) (← links)
- Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption (Q2970267) (← links)
- Non-associative public-key cryptography (Q2975249) (← links)
- Improved Key Recovery Algorithms from Noisy RSA Secret Keys with Analog Noise (Q2975814) (← links)
- An Improved Analysis on Three Variants of the RSA Cryptosystem (Q2980851) (← links)
- Revisiting the Cubic UOV Signature Scheme (Q2988348) (← links)
- Improved Results on Cryptanalysis of Prime Power RSA (Q2988352) (← links)
- A NOVEL IDENTITY-BASED KEY-INSULATED CONVERTIBLE AUTHENTICATED ENCRYPTION SCHEME (Q2997930) (← links)
- Signcryption Schemes Based on the RSA Problem (Q3000032) (← links)
- Parallel Signcryption (Q3000036) (← links)
- Gate Elimination for Linear Functions and New Feebly Secure Constructions (Q3007624) (← links)
- Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation (Q3011912) (← links)
- Analyzing Standards for RSA Integers (Q3011917) (← links)
- Benaloh’s Dense Probabilistic Encryption Revisited (Q3011926) (← links)
- Exponentiation modulo a polynomial for data security (Q3038618) (← links)
- Fast modular multiplication based on complement representation and canonical recoding (Q3066940) (← links)
- Defeating RSA Multiply-Always and Message Blinding Countermeasures (Q3073697) (← links)
- Beyond Provable Security Verifiable IND-CCA Security of OAEP (Q3073706) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Quantum information and relativity theory (Q3077089) (← links)
- Information and computation: Classical and quantum aspects (Q3077099) (← links)
- Sufficient conditions for factoring a class of large integers (Q3078177) (← links)
- The orthogonal signature (Q3078463) (← links)
- Algebraic cryptography: new constructions and their security against provable break (Q3079281) (← links)
- On Constructing 1-1 One-Way Functions (Q3088171) (← links)
- Three XOR-Lemmas — An Exposition (Q3088188) (← links)
- A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators (Q3098001) (← links)
- Shorter addition chain for smooth integers using decomposition method (Q3101616) (← links)
- Scalability of Shor’s algorithm with a limited set of rotation gates (Q3102502) (← links)
- Square Always Exponentiation (Q3104721) (← links)