Pages that link to "Item:Q3689092"
From MaRDI portal
The following pages link to A public key cryptosystem and a signature scheme based on discrete logarithms (Q3689092):
Displaying 50 items.
- On the security of the Lucas function (Q673987) (← links)
- On Schnorr's preprocessing for digital signature schemes (Q676822) (← links)
- Trusted computing with addition machines. I (Q681716) (← links)
- The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem (Q683912) (← links)
- Anonymous message communications with user hierarchy in a multicast system (Q702584) (← links)
- Encryption of covert information into multiple statistical distributions (Q715984) (← links)
- Asymptotic granularity reduction and its application (Q719278) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- CCA secure encryption supporting authorized equality test on ciphertexts in standard model and its applications (Q778412) (← links)
- An identity-based encryption technique using subtree for fuzzy user data sharing under cloud computing environment (Q780213) (← links)
- The design of a secure and fair sealed-bid auction service (Q814236) (← links)
- An iterative modular multiplication algorithm in RNS (Q814756) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point (Q850776) (← links)
- Reputation management and signature delegation: A distributed approach (Q862580) (← links)
- Studying the performance of artificial neural networks on problems related to cryptography (Q867941) (← links)
- An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques (Q870135) (← links)
- New field of cryptography: DNA cryptography (Q871844) (← links)
- Fast modular multi-exponentiation using modified complex arithmetic (Q884549) (← links)
- A survey of some applications of finite fields (Q908045) (← links)
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration (Q914647) (← links)
- Low complexity normal bases (Q923627) (← links)
- Certificate-based verifiably encrypted signatures from pairings (Q924671) (← links)
- Protocol completion incentive problems in cryptographic Vickrey auctions (Q934962) (← links)
- Secure public-key encryption scheme without random oracles (Q942322) (← links)
- New designing of cryptosystems based on quadratic fields (Q954438) (← links)
- Efficient generic on-line/off-line (threshold) signatures without key exposure (Q955733) (← links)
- Should one always use repeated squaring for modular exponentiation? (Q963373) (← links)
- Providing data confidentiality against malicious hosts in shared data spaces (Q967526) (← links)
- A note on the security of \(\text{MST} _{3}\) (Q970546) (← links)
- Improved efficiency of Kiltz07-KEM (Q989584) (← links)
- Extensions of access structures and their cryptographic applications (Q989607) (← links)
- Fast simultaneous scalar multiplication (Q990540) (← 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)
- Aitken and Neville inverse interpolation methods for the Lucas logarithm problem (Q1008623) (← links)
- Semantic security for the McEliece cryptosystem without random oracles (Q1009060) (← links)
- A variant of digital signature algorithm (Q1009135) (← links)
- Elliptic curve based hardware architecture using cellular automata (Q1010044) (← links)
- A public key cryptosystem based on non-abelian finite groups (Q1027976) (← links)
- Batch RSA signature scheme (Q1028382) (← links)
- Improvement of the Miyazaki-Takaragi threshold digital signature scheme (Q1029009) (← links)
- Cryptosystems based on semi-distributive algebras (Q1042600) (← links)
- Self-certified multi-proxy signature schemes with message recovery (Q1045611) (← links)
- Comments on the `\(m\) out of \(n\) oblivious transfer' (Q1045921) (← links)
- Partial information in public key cryptography (Q1105565) (← links)
- A key distribution system equivalent to factoring (Q1112781) (← links)
- A key-exchange system based on imaginary quadratic fields (Q1112782) (← links)
- Hyperelliptic cryptosystems (Q1121852) (← links)
