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.
- Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques (Q5426314) (← links)
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? (Q5445445) (← links)
- An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm (Q5445455) (← links)
- Toward Acceleration of RSA Using 3D Graphics Hardware (Q5448549) (← links)
- Power Analysis for Secret Recovering and Reverse Engineering of Public Key Algorithms (Q5452251) (← links)
- Efficient ID-Based Digital Signatures with Message Recovery (Q5458495) (← links)
- RSA Moduli with a Predetermined Portion: Techniques and Applications (Q5458502) (← links)
- Efficient Sequential Aggregate Signed Data (Q5458585) (← links)
- Threshold RSA for Dynamic and Ad-Hoc Groups (Q5458587) (← links)
- An anonymous and flexible í-out-of-n electronic voting scheme (Q5473100) (← links)
- AN EFFICIENT METHOD FOR IMPROVING THE COMPUTATIONAL PERFORMANCE OF THE CUBIC LUCAS CRYPTOSYSTEM (Q5495473) (← links)
- Computing prime divisors in an interval (Q5497026) (← links)
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits (Q5502751) (← links)
- Exploiting the Power of GPUs for Asymmetric Cryptography (Q5502784) (← links)
- An unconditionally secure location-aware key management scheme for static sensor networks (Q5503769) (← links)
- Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme (Q5504550) (← links)
- A New Class of Weak Encryption Exponents in RSA (Q5504634) (← links)
- A CCA Secure Hybrid Damgård’s ElGamal Encryption (Q5505459) (← links)
- On the Equivalence of Generic Group Models (Q5505469) (← links)
- Computation of a 768-Bit Prime Field Discrete Logarithm (Q5738876) (← links)
- Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions (Q5738969) (← links)
- Removing the Strong RSA Assumption from Arguments over the Integers (Q5738979) (← links)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
- On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols (Q5744697) (← links)
- A Practical Multivariate Blind Signature Scheme (Q5854439) (← links)
- Idempotent Factorizations in the Cryptography Classroom (Q5856125) (← links)
- A Unified Method for Private Exponent Attacks on RSA Using Lattices (Q5859736) (← links)
- On the security of some variants of the RSA signature scheme (Q5862294) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- A variant of RSA using continued fractions (Q5865665) (← links)
- A new NTRU cryptosystem outperforms three highly secured NTRU-analog systems through an innovational algebraic structure (Q5865707) (← links)
- A novel public-key encryption scheme based on Bass cyclic units in integral group rings (Q5865711) (← links)
- The truth behind the myth of the folk theorem (Q5892456) (← links)
- Breaking RSA Generically Is Equivalent to Factoring (Q5901923) (← links)
- Oblivious signature-based envelope (Q5917932) (← links)
- Multiparty generation of an RSA modulus (Q5918574) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Similarity in the statistics of prime numbers (Q5936270) (← links)
- Computing the order of points on an elliptic curve modulo \(N\) is as difficult as factoring \(N\) (Q5938924) (← links)
- Permutation polynomials modulo \(2^w\) (Q5941620) (← links)
- Cryptanalysis of Liaw's broadcasting cryptosystem (Q5948810) (← links)
- Analogies and differences between quantum and stochastic automata (Q5958112) (← links)
- Multiparty generation of an RSA modulus (Q5970801) (← links)
- A new attack on some RSA variants (Q6040631) (← links)
- Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups (Q6041288) (← links)
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge (Q6045075) (← links)
- Mathematical etudes on quantum computation (Q6049765) (← links)
- Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm (Q6050243) (← links)
- Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method (Q6051902) (← links)
- Semiconductor Emitters in Entropy Sources for Quantum Random Number Generation (Q6062328) (← links)
