A particular solution to provide secure communications in an Ethernet environment

1993 ◽  
Author(s):  
Miguel Soriano ◽  
Jordi Forné ◽  
Francisco Recacha ◽  
José L. Melús
Keyword(s):  
Secure Communications ◽  
Particular Solution

scholarly journals Robust 3D-Trajectory and Time Switching Optimization for Dual-UAV-Enabled Secure Communications

2021 ◽  
pp. 1-1
Author(s):  
Wei Wang ◽  
Xinrui Li ◽  
Rui Wang ◽  
Kanapathippillai Cumanan ◽  
Wei Feng ◽  
...  
Keyword(s):  
Secure Communications ◽  
Time Switching

scholarly journals Numerical finite-key analysis of quantum key distribution

2020 ◽  
Vol 6 (1) ◽  
Author(s):  
Darius Bunandar ◽  
Luke C. G. Govia ◽  
Hari Krovi ◽  
Dirk Englund
Keyword(s):  
Finite Number ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Numerical Approach ◽  
Asymptotic Formulas ◽  
Quantum Computers ◽  
Secure Communications ◽  
Quantum Relative Entropy ◽  
Asymptotic Equipartition Property ◽  
Optimization Solvers

AbstractQuantum key distribution (QKD) allows for secure communications safe against attacks by quantum computers. QKD protocols are performed by sending a sizeable, but finite, number of quantum signals between the distant parties involved. Many QKD experiments, however, predict their achievable key rates using asymptotic formulas, which assume the transmission of an infinite number of signals, partly because QKD proofs with finite transmissions (and finite-key lengths) can be difficult. Here we develop a robust numerical approach for calculating the key rates for QKD protocols in the finite-key regime in terms of two semi-definite programs (SDPs). The first uses the relation between conditional smooth min-entropy and quantum relative entropy through the quantum asymptotic equipartition property, and the second uses the relation between the smooth min-entropy and quantum fidelity. The numerical programs are formulated under the assumption of collective attacks from the eavesdropper and can be promoted to withstand coherent attacks using the postselection technique. We then solve these SDPs using convex optimization solvers and obtain numerical calculations of finite-key rates for several protocols difficult to analyze analytically, such as BB84 with unequal detector efficiencies, B92, and twin-field QKD. Our numerical approach democratizes the composable security proofs for QKD protocols where the derived keys can be used as an input to another cryptosystem.

FPGA Implementation of Chaotic Oscillators, Their Synchronization, and Application to Secure Communications

2019 ◽  
pp. 301-328
Author(s):  
Esteban Tlelo-Cuautle ◽  
Omar Guillén-Fernández ◽  
Jose de Jesus Rangel-Magdaleno ◽  
Ashley Melendez-Cano ◽  
Jose Cruz Nuñez-Perez ◽  
...  
Keyword(s):  
Fpga Implementation ◽  
Secure Communications ◽  
Chaotic Oscillators

scholarly journals AN APPROACH TO SOLVE SLAVNOV–TAYLOR IDENTITY IN D4 ${\mathcal N}=1$ SUPERGRAVITY

2004 ◽  
Vol 19 (17) ◽  
pp. 1291-1296 ◽  
Author(s):  
IGOR KONDRASHUK
Keyword(s):  
Effective Action ◽  
Spin Connection ◽  
Classical Action ◽  
Local Invariant ◽  
Particular Solution ◽  
Physical Part

We consider a particular solution to Slavnov–Taylor identity in four-dimensional supergravity. The consideration is performed for pure supergravity, no matter superfields are included. The solution is obtained by inserting dressing functions into ghost part of the classical action for supergravity. As a consequence, physical part of the effective action is local invariant with respect to diffeomorphism and structure groups of transformation for dressed effective superfields of vielbein and spin connection.

Sign in / Sign up

Export Citation Format

Share Document