✦ LIBER ✦

Key Secrecy in a Quantum Cryptography System Based on Error-Correcting Codes

✍ Scribed by I. M. Arbekov

Book ID: 110291105
Publisher: SP MAIK Nauka/Interperiodica
Year: 2001
Tongue: English
Weight: 90 KB
Volume: 37
Category: Article
ISSN: 0032-9460
DOI: 10.1023/a:1010403911718

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new decoding method for digital waterm

A new decoding method for digital watermark based on error correcting codes and cryptography

✍ Noriaki Minami; Masao Kasahara 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 909 KB

On the privacy-preserving cascade method

On the privacy-preserving cascade method for correcting errors in primary keys in quantum cryptography

✍ A. V. Timofeev; S. N. Molotkov 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 61 KB

Bit error rates in a frequency coded qua

Bit error rates in a frequency coded quantum key distribution system

✍ Pradeep Kumar; A. Prabhakar 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 575 KB

Explicit attack on the key in quantum cr

Explicit attack on the key in quantum cryptography (BB84 protocol) reaching the theoretical error limitQc≈ 11%

✍ S. N. Molotkov; A. V. Timofeev 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 202 KB

Chosen ciphertext attacks on lattice-bas

Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment

✍ Oleg Izmerly; Tal Mor 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 268 KB

There exist Steiner triple systems of or

There exist Steiner triple systems of order 15 that do not occur in a perfect binary one-error-correcting code

✍ Patric R. J. Östergård; Olli Pottonen 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB 👁 1 views

## Abstract The codewords at distance three from a particular codeword of a perfect binary one‐error‐correcting code (of length 2^m^−1) form a Steiner triple system. It is a longstanding open problem whether every Steiner triple system of order 2^m^−1 occurs in a perfect code. It turns out that thi