Results 1 to 10 of about 5,434 (190)

Time-memory trade-off in Toom-Cook multiplication: an application to module-lattice based cryptography

Transactions on Cryptographic Hardware and Embedded Systems, 2020
Since the introduction of the ring-learning with errors problem, the number theoretic transform (NTT) based polynomial multiplication algorithm has been studied extensively.
Jose Maria Bermudo Mera, Angshuman Karmakar, Ingrid Verbauwhede   +2 more
doaj   +1 more source

A novel approach to quality-of-service provisioning in trusted relay Quantum Key Distribution networks [PDF]

, 2020
In recent years, noticeable progress has been made in the development of quantum equipment, reflected through the number of successful demonstrations of Quantum Key Distribution (QKD) technology. Although they showcase the great achievements of QKD, many
Fazio, Peppino, Maurhart, Oliver, Mehic, Miralem, Niemiec, Marcin, Peev, Momtchil, Poppe, Andreas, Rass, Stefan, Rozhon, Jan, Vozňák, Miroslav   +8 more
core   +1 more source

Experimental demonstration of the DPTS QKD protocol over a 170 km fiber link [PDF]

, 2019
Quantum key distribution (QKD) is a promising technology aiming at solving the security problem arising from the advent of quantum computers. While the main theoretical aspects are well developed today, limited performances, in terms of achievable link ...
Bacco, Davide, Cozzolino, Daniele, Da Lio, Beatrice, Dalgaard, Kjeld, Ding, Yunhong, Oxenløwe, Leif, Rottwitt, Karsten   +6 more
core   +2 more sources

Using quantum key distribution for cryptographic purposes: a survey

, 2014
The appealing feature of quantum key distribution (QKD), from a cryptographic viewpoint, is the ability to prove the information-theoretic security (ITS) of the established keys. As a key establishment primitive, QKD however does not provide a standalone
,, Alléaume, R, Bouda, J, Branciard, C, Debuisschert, T, Dianati, M, Gisin, N, Godfrey, M, Grangier, P, Länger, T, Lütkenhaus, N, Monyk, C, Painchault, P, Peev, M, Poppe, A, Pornin, T, Rarity, J, Renner, R, Ribordy, G, Riguidel, M, Salvail, L, Shields, A, Weinfurter, H, Zeilinger, A   +23 more
core   +3 more sources

The Landscape of Academic Literature in Quantum Technologies

, 2020
In this study, we investigated the academic literature on quantum technologies (QT) using bibliometric tools. We used a set of 49,823 articles obtained from the Web of Science (WoS) database using a search query constructed through expert opinion ...
Aydinoglu, Arsev U., Seskir, Zeki C.
core   +1 more source

Quantifying the Leakage of Quantum Protocols for Classical Two-Party Cryptography [PDF]

, 2014
We study quantum protocols among two distrustful parties. By adopting a rather strict definition of correctness - guaranteeing that honest players obtain their correct outcomes only - we can show that every strictly correct quantum protocol implementing ...
Salvail, Louis, Schaffner, Christian, Sotakova, Miroslava   +2 more
core   +2 more sources

Efficient reconciliation protocol for discrete-variable quantum key distribution

, 2009
Reconciliation is an essential part of any secret-key agreement protocol and hence of a Quantum Key Distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary ...
Alléaume, Romain, Boutros, Joseph, Elkouss, David, Leverrier, Anthony   +3 more
core   +1 more source

Decoy state quantum key distribution with two-way classical post-processing [PDF]

, 2006
Decoy states have recently been proposed as a useful method for substantially improving the performance of quantum key distribution protocols when a coherent state source is used.
C. H. Bennett, C. H. Bennett, Chi-Hang Fred Fung, D. Gottesman, E. Biham, Frédéric Dupuis, H.-K. Lo, Hoi-Kwong Lo, Kai Chen, Kiyoshi Tamaki, M. Ben-Or, N. Lütkenhaus, R. Renner, T. Kimura, Xiongfeng Ma   +14 more
core   +1 more source

Computational Indistinguishability between Quantum States and Its Cryptographic Application

, 2011
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is "secure" against any polynomial-time quantum adversary.
A. Bogdanov, A. Kawachi, A. Kawachi, A.C.-C. Yao, Akinori Kawachi, C. Crépeau, C. Crépeau, C. Moore, C. Moore, C.H. Bennett, D. Aharonov, D. Bacon, D. Boneh, D. Mayers, D. Mayers, D. Micciancio, D. Robinson, E.M. Luks, G. Kuperberg, G.M. Nikolopoulos, G.M. Nikolopoulos, H. Kobayashi, H.-K. Lo, Harumichi Nishimura, I. Damgård, J. Grollmann, J. Kempe, J. Köbler, J. Watrous, M. Adcock, M. Ajtai, M. Ajtai, M. Bellare, M. Blum, M. Crâsmaru, M. Ettinger, M. Grigni, M. Hayashi, M. Tompa, M.A. Nielsen, O. Regev, O. Regev, O. Regev, P. Dumais, P.W. Shor, P.W. Shor, R. Impagliazzo, S. Goldwasser, S. Goldwasser, S. Hallgren, S. Hallgren, T. Okamoto, Takeshi Koshiba, Tomoyuki Yamakami, U. Schöning, V. Arvind, W. Diffie, W. Höffding   +57 more
core   +1 more source

Key recycling in authentication

, 2014
In their seminal work on authentication, Wegman and Carter propose that to authenticate multiple messages, it is sufficient to reuse the same hash function as long as each tag is encrypted with a one-time pad.
Portmann, Christopher
core   +1 more source