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.
- Improvements to RSA key generation and CRT on embedded devices (Q826302) (← links)
- Milestone developments in quantum information and no-go theorems (Q832131) (← links)
- A note on quadratic residuosity and UP (Q834917) (← links)
- Cryptographic key assignment schemes for any access control policy (Q834941) (← links)
- Optimal strong primes (Q834990) (← links)
- A simple model of secure public communication (Q836045) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Set signatures and their applications (Q848269) (← 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)
- Zero-knowledge proofs of knowledge for group homomorphisms (Q887447) (← links)
- The distributions of individual bits in the output of multiplicative operations (Q892279) (← links)
- Fault attacks on hyperelliptic curve discrete logarithm problem over binary field (Q893699) (← links)
- Spreading alerts quietly and the subgroup escape problem (Q901371) (← links)
- Modified fidelity based on-demand secure (MFBOD) routing protocol in mobile ad-hoc network (Q902708) (← links)
- Factoring multi power RSA moduli with a class of secret exponents (Q907002) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← 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)
- Joint watermarking and encryption of color images in the Fibonacci-Haar domain (Q965441) (← links)
- A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA (Q966349) (← links)
- Providing data confidentiality against malicious hosts in shared data spaces (Q967526) (← links)
- Improving e-payment security using elliptic curve cryptosystem (Q968357) (← links)
- Highly parallel modular multiplication in the residue number system using sum of residues reduction (Q969623) (← links)
- Totally secure classical communication utilizing Johnson (-like) noise and Kirchhoff's law (Q973577) (← links)
- Unconditional secure communication: a Russian cards protocol (Q987501) (← links)
- Fast binary multiplication by performing dot counting and complement recoding (Q990410) (← links)
- Fast simultaneous scalar multiplication (Q990540) (← links)
- Cryptanalysis of RSA with more than one decryption exponent (Q991798) (← links)
- Refined quorum systems (Q992512) (← 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)
- Distortion-free secret image sharing mechanism using modulus operator (Q1010099) (← links)
