Pages that link to "Item:Q4145254"

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

Displayed 50 items.

• 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)
• 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)
• 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)
• On the concealability of messages by the Williams public-key encryption scheme (Q760408) ‎ (← 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)
• A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point (Q850776) ‎ (← links)
• Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) (Q850793) ‎ (← links)
• Efficient hardware implementation of finite fields with applications to cryptography (Q850794) ‎ (← links)
• Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment (Q857394) ‎ (← links)
• On the semantics of Alice \& Bob specifications of security protocols (Q860900) ‎ (← links)
• Towards minimal addition chains using ant colony optimisation (Q864950) ‎ (← links)
• Applying quick exponentiation for block upper triangular matrices (Q865509) ‎ (← links)
• Studying the performance of artificial neural networks on problems related to cryptography (Q867941) ‎ (← links)
• Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring (Q868950) ‎ (← links)
• An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques (Q870135) ‎ (← links)
• New field of cryptography: DNA cryptography (Q871844) ‎ (← links)
• An invisible hybrid color image system using spread vector quantization neural networks with penalized FCM (Q877109) ‎ (← links)
• Fast modular multi-exponentiation using modified complex arithmetic (Q884549) ‎ (← links)
• An efficient probabilistic encryption scheme (Q912074) ‎ (← links)
• The combinatorics of authentication and secrecy codes (Q914645) ‎ (← links)
• A Cartesian product construction for unconditionally secure authentication codes that permit arbitration (Q914647) ‎ (← links)
• A two-codebook combination and three-phase block matching based image-hiding scheme with high embedding capacity (Q936433) ‎ (← links)
• A convertible multi-authenticated encryption scheme for group communications (Q942321) ‎ (← links)
• Deterministic six states protocol for quantum communication (Q942453) ‎ (← links)
• New designing of cryptosystems based on quadratic fields (Q954438) ‎ (← links)
• Problems of cryptography as discrete optimization tasks (Q999605) ‎ (← links)
• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation (Q1007833) ‎ (← links)
• The ring authenticated encryption scheme-how to provide a clue wisely (Q1007859) ‎ (← links)
• Probabilistic encryption (Q1057832) ‎ (← links)
• Number-theoretic functions which are equivalent to number of divisors (Q1064776) ‎ (← links)
• Transaction protection by beacons (Q1065755) ‎ (← links)
• Trapdoor knapsacks without superincreasing structure (Q1066113) ‎ (← links)
• On the verifiability of two-party algebraic protocols (Q1083426) ‎ (← links)
• On the distribution in short intervals of integers having no large prime factor (Q1084440) ‎ (← links)
• Reductions among number theoretic problems (Q1091136) ‎ (← links)
• Belief, awareness, and limited reasoning (Q1096610) ‎ (← links)
• On a public-key cryptosystem based on iterated morphisms and substitutions (Q1098821) ‎ (← links)
• Partitioned encryption and achieving simultaneity by partitioning (Q1099131) ‎ (← links)
• A nonlinear public key cryptosystem (Q1102923) ‎ (← links)
• Partial information in public key cryptography (Q1105565) ‎ (← links)
• On using primes for public key encryption systems (Q1109750) ‎ (← links)