Pages that link to "Item:Q4145254"

The following pages link to A method for obtaining digital signatures and public-key cryptosystems (Q4145254):

Displaying 50 items.

• Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation (Q3511182) (← links)
• Algebraic Cryptanalysis of CTRU Cryptosystem (Q3511333) (← links)
• Optimal Extension Field Inversion in the Frequency Domain (Q3519551) (← links)
• Modular Reduction in GF(2 n ) without Pre-computational Phase (Q3519553) (← links)
• Side Channels in the McEliece PKC (Q3535365) (← links)
• On the security of multi-prime RSA (Q3537519) (← links)
• An Identity-Based Key Agreement Protocol for the Network Layer (Q3540060) (← links)
• Revisiting Wiener’s Attack – New Weak Keys in RSA (Q3540147) (← links)
• Integrating FPGA/ASIC into cryptographic storage systems to avoid re-encryption (Q3557557) (← links)
• FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ'S ATTRACTOR (Q3560152) (← links)
• Application of ECM to a class of RSA keys (Q3561507) (← links)
• A new signature scheme based on factoring and discrete logarithms (Q3561524) (← links)
• NMR Quantum Computing (Q3565465) (← links)
• Measurement-Based and Universal Blind Quantum Computation (Q3575028) (← links)
• Common modulus attacks on small private exponent RSA and some fast variants (in practice) (Q3580732) (← links)
• Secret Codes and Online Security: A Seminar for Entering Students (Q3583509) (← links)
• A deterministic version of Pollard’s $p-1$ algorithm (Q3584788) (← links)
• Bug Attacks (Q3600222) (← links)
• Graph Design for Secure Multiparty Computation over Non-Abelian Groups (Q3600363) (← links)
• The Hidden Root Problem (Q3600495) (← links)
• A teaching module on the history of public-key cryptography and RSA (Q3612731) (← links)
• Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors (Q3617506) (← links)
• Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients (Q3623057) (← links)
• Securing RSA against Fault Analysis by Double Addition Chain Exponentiation (Q3623066) (← links)
• CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS (Q3626324) (← links)
• Realizing Hash-and-Sign Signatures under Standard Assumptions (Q3627443) (← links)
• A New Operator for Multi-addition Calculations (Q3628549) (← links)
• Reducing the Complexity in the Distributed Computation of Private RSA Keys (Q3634497) (← links)
• Random Order m-ary Exponentiation (Q3634511) (← links)
• Cryptanalysis of RSA Using the Ratio of the Primes (Q3637134) (← links)
• Unifying Zero-Knowledge Proofs of Knowledge (Q3637145) (← links)
• Algorithm for factoring some RSA and Rabin moduli (Q3637783) (← links)
• A designated verifier signature using secret sharing technique (Q3637820) (← links)
• A realistic divisible transferable electronic cash for general use (Q3637822) (← links)
• Attacks on provably secure proxy-protected signature schemes based on factoring (Q3637824) (← links)
• Distinguishing Multiplications from Squaring Operations (Q3644212) (← links)
• HECC Goes Embedded: An Area-Efficient Implementation of HECC (Q3644216) (← links)
• (Q3671038) (← links)
• Use of trapdoor structures in cryptography (Q3803021) (← links)
• An algebra to represent security policies for cryptography-based secure storage systems (Q3811692) (← links)
• (Q3812162) (← links)
• Some remarks concerning the M.I.T. public-key cryptosystem (Q3852104) (← links)
• Critical remarks on “Critical Remarks on Some Public-Key Cryptosystems” by T. Herlestam (Q3867723) (← links)
• An improved Monte Carlo factorization algorithm (Q3881775) (← links)
• Asymptotically Fast Factorization of Integers (Q3898556) (← links)
• A faster modular multiplication algorithm (Q3979695) (← links)
• A password authentication scheme based on discrete logarithms (Q3989763) (← links)
• Fast modular multiplication using 2-power radix (Q3989850) (← links)
• High-radix and bit recoding techniques for modular exponentiation (Q3991119) (← links)
• A verification of brickell's fast modular multiplication algorithm (Q4009756) (← links)