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.

• On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
• A recursive construction of permutation polynomials over \(\mathbb F_{q^2}\) with odd characteristic related to Rédei functions (Q2420467) (← links)
• The number of rational points of hyperelliptic curves over subsets of finite fields (Q2424286) (← links)
• Cryptography on elliptic curves over \(p\) -adic number fields (Q2425853) (← links)
• How (not) to design strong-RSA signatures (Q2430687) (← links)
• Gröbner basis cryptosystems (Q2432557) (← links)
• On some connections between statistics and cryptology (Q2437860) (← links)
• Improvement on Meshram et al.'s ID-based cryptographic mechanism (Q2445252) (← links)
• Efficient multiple-precision integer division algorithm (Q2445407) (← links)
• Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) (Q2448084) (← links)
• Multilevel threshold secret sharing based on the Chinese remainder theorem (Q2448863) (← links)
• A provably secure short signature scheme based on discrete logarithms (Q2456500) (← links)
• Developing the concept of one-way functions for cryptographic security systems using achievements in chaotic dynamics (Q2458101) (← links)
• Identity-based ring signatures from RSA (Q2465630) (← links)
• Convertible multi-authenticated encryption scheme (Q2465980) (← links)
• Computing the modular inverses is as simple as computing the GCDs (Q2469471) (← links)
• A lossless data hiding scheme based on three-pixel block differences (Q2469740) (← links)
• Cryptanalysis of ISO/IEC 9796-1 (Q2482334) (← links)
• Simple authenticated key agreement and protected password change protocol (Q2485500) (← links)
• Cryptanalysis of an authenticated encryption scheme using self-certified public keys (Q2485613) (← links)
• Standards and verification for fair-exchange and atomicity in e-commerce transactions (Q2489255) (← links)
• Cryptanalysis and improvement on batch verifying multiple RSA digital signatures (Q2489411) (← links)
• Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences (Q2490987) (← links)
• Index calculation attacks on RSA signature and encryption (Q2491257) (← links)
• Speeding up exponentiation using an untrusted computational resource (Q2491304) (← links)
• Secure evolvable hardware for public-key cryptosystems (Q2493297) (← links)
• Security of the design of time-stamped signatures (Q2495406) (← links)
• A password authentication scheme over insecure networks (Q2495408) (← links)
• On two DES implementations secure against differential power analysis in smart-cards (Q2500477) (← links)
• A new attack on RSA with two or three decryption exponents (Q2511362) (← links)
• A unified approach to deterministic encryption: new constructions and a connection to computational entropy (Q2516532) (← links)
• A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing (Q2570757) (← links)
• One-to-one mapping matrix (Q2571948) (← links)
• Remarks on some signature schemes based on factoring and discrete logarithms (Q2571958) (← links)
• Fail-stop blind signature scheme design based on pairings (Q2571979) (← links)
• A secure and efficient authentication protocol for anonymous channel in wireless communications (Q2571989) (← links)
• Cryptanalysis of some signature schemes with message recovery (Q2572002) (← links)
• An enhanced user authentication scheme for multi-server internet services (Q2572017) (← links)
• Security of Pon-Lu-Jeng's Meta-He digital signature schemes (Q2572055) (← links)
• Security analysis and improvement of a double-trapdoor encryption scheme (Q2572322) (← links)
• A research on new public-key encryption schemes (Q2572324) (← links)
• Cryptanalysis of large RSA exponent by using the LLL algorithm (Q2572356) (← links)
• Several security schemes constructed using ECC-based self-certified public key cryptosystems (Q2572699) (← links)
• A public key cryptosystem based on a subgroup membership problem (Q2572970) (← links)
• A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. (Q2583543) (← links)
• Constructing parallel long-message signcryption scheme from trapdoor permutation (Q2644418) (← links)
• Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives (Q2663507) (← links)
• Privacy preservation for machine learning training and classification based on homomorphic encryption schemes (Q2663591) (← links)
• Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices (Q2666752) (← links)
• Cryptographic algorithms for privacy-preserving online applications (Q2668547) (← links)