Pages that link to "Item:Q5901791"
From MaRDI portal
The following pages link to Public Key Cryptography – PKC 2004 (Q5901791):
Displaying 11 items.
- A ciphertext-only attack on Polly Two (Q964735) (← links)
- Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes (Q1647553) (← links)
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting (Q2079218) (← links)
- Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice (Q2384012) (← links)
- Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem (Q2829212) (← links)
- Integer Reconstruction Public-Key Encryption (Q3297634) (← links)
- A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem (Q3346214) (← links)
- (Q4707231) (← links)
- (Q4901382) (← links)
- Implicit Polynomial Recovery and Cryptanalysis of a Combinatorial Key Cryptosystem (Q4913723) (← links)
- Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice (Q5465827) (← links)