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.
- Computational hardness of IFP and ECDLP (Q505664) (← links)
- Undeniable signature scheme based over group ring (Q505668) (← links)
- Privacy protection in on-line shopping for electronic documents (Q506124) (← links)
- Efficient verifiable multi-secret sharing scheme based on hash function (Q506699) (← links)
- Provably secure proxy convertible authenticated encryption scheme based on RSA (Q506763) (← links)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- Permutation polynomials and a new public-key encryption (Q516791) (← links)
- Compositional inverses and complete mappings over finite fields (Q516831) (← links)
- Cryptanalysis of Dual RSA (Q517262) (← links)
- Group rekeying in the exclusive subset-cover framework (Q526907) (← links)
- Analyzing massively collaborative mathematics projects (Q536600) (← links)
- Self-generated-certificate public key encryption without pairing and its application (Q545362) (← links)
- An ID-based multi-signer universal designated multi-verifier signature scheme (Q549664) (← links)
- Encryption test of pseudo-aleatory messages embedded on chaotic laser signals: an information theory approach (Q552763) (← links)
- A new blind signature based on the discrete logarithm problem for untraceability (Q556120) (← links)
- Quantum computing without entanglement (Q596121) (← links)
- The complexity of computing the permanent (Q600247) (← links)
- Efficient proxy signcryption scheme with provable CCA and CMA security (Q623106) (← links)
- Fair exchange of valuable information: a generalised framework (Q632798) (← links)
- A note on the average number of RSA fixed points (Q638546) (← links)
- A note on linear permutation polynomials (Q640011) (← links)
- A new strategy for generating shortest addition sequences (Q644844) (← links)
- Star reduction among minimal length addition chains (Q644852) (← links)
- Permutation polynomials over finite fields from a powerful lemma (Q650832) (← links)
- Fault-based attack on Montgomery's ladder algorithm (Q656523) (← links)
- Security risk during the transient in a key exchange protocol using random signals and feedback (Q665300) (← links)
- Efficient quantum multi-proxy signature (Q669928) (← links)
- An attack on the Needham-Schroeder public-key authentication protocol (Q672251) (← links)
- On the security of the Lucas function (Q673987) (← links)
- A chosen message attack on Demytko's elliptic curve cryptosystem (Q676832) (← links)
- Trusted computing with addition machines. I (Q681716) (← links)
- Anonymous message communications with user hierarchy in a multicast system (Q702584) (← links)
- Authenticated key agreement in dynamic peer groups (Q703558) (← links)
- An escrow electronic cash system with limited traceability (Q707330) (← links)
- Reducing factorization of a semiprime number to the integration of highly oscillatory functions (Q712606) (← links)
- Generic security-amplifying methods of ordinary digital signatures (Q712706) (← links)
- Asymptotic granularity reduction and its application (Q719278) (← links)
- A new generalization of the KMOV cryptosystem (Q721553) (← links)
- A public key cryptosystem based on Diophantine equations of degree increasing type (Q740123) (← links)
- Permutation polynomials of the form \(L(x) + S_{2k}^a + S_{2k}^b\) over \(\mathbb{F}_{q^{3k}}\) (Q740301) (← links)
- Montgomery's method of polynomial selection for the number field sieve (Q745185) (← links)
- Piecewise constructions of inverses of some permutation polynomials (Q747977) (← links)
- On the concealability of messages by the Williams public-key encryption scheme (Q760408) (← links)
- Thwarting side-channel analysis against RSA cryptosystems with additive blinding (Q778376) (← links)
- Computer algebra tales on Goppa codes and McEliece cryptography (Q782704) (← links)
- Applying a formal analysis technique to the CCITT X.509 strong two-way authentication protocol (Q802867) (← links)
- The design of a secure and fair sealed-bid auction service (Q814236) (← links)
- An iterative modular multiplication algorithm in RNS (Q814756) (← links)
- Quantum mechanics and computation (Q816791) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
