Quantum key distribution using universal hash functions over finite fields
From MaRDI portal
Publication:2107057
Recommendations
- New Universal Hash Functions
- Special properties of strongly universal\(_2\) hash functions important in quantum cryptography
- Quantum hashing via \(\varepsilon \)-universal hashing constructions and Freivalds' fingerprinting schemas
- Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
- Privacy amplification for quantum key distribution
Cites work
- scientific article; zbMATH DE number 1024043 (Why is no real title available?)
- scientific article; zbMATH DE number 1024067 (Why is no real title available?)
- scientific article; zbMATH DE number 1030979 (Why is no real title available?)
- scientific article; zbMATH DE number 1161253 (Why is no real title available?)
- scientific article; zbMATH DE number 1406775 (Why is no real title available?)
- scientific article; zbMATH DE number 1418298 (Why is no real title available?)
- A lower bound for the number of solutions of equations over finite fields
- Characters over Certain Types of Rings with Applications to the Theory of Equations in a Finite Field
- Commentary on ``Numbers of solutions of equations in finite fields by André Weil
- Fast Software Encryption
- Generalized privacy amplification
- Key Recycling in Authentication
- Leftover Hashing Against Quantum Side Information
- Leftover Hashing From Quantum Error Correction: Unifying the Two Approaches to the Security Proof of Quantum Key Distribution
- MMH: Software message authentication in the Gbit/second rates
- New hash functions and their use in authentication and set equality
- New security notions and feasibility results for authentication of quantum data
- Numbers of solutions of equations in finite fields
- On the Existence of Solutions of Certain Equations in a Finite Field
- On the Nature of the Solutions of Certain Equations in a Finite Field
- On the Power of Quantum Memory
- Order-restricted linear congruences
- Polynomial hash functions are reliable (extended abstract)
- Progress in Cryptology - INDOCRYPT 2004
- Quantum authentication with key recycling
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- Revocable Quantum Timed-Release Encryption
- Rings of arithmetic functions. II. The number of solutions of quadratic congruences
- Sampling of Min-Entropy Relative to Quantum Knowledge
- Theory of Cryptography
- Universal classes of hash functions
- Universal hashing and authentication codes
Cited in
(2)
This page was built for publication: Quantum key distribution using universal hash functions over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107057)