Cryptographic protocols based on real-quadratic A-fields (extended abstract)

1996 ◽  
pp. 15-25 ◽  
Author(s):  
Ingrid Biehl ◽  
Bernd Meyer ◽  
Christoph Thiel
Keyword(s):  
Cryptographic Protocols ◽  
Real Quadratic

Security Analysis of Wireless Authentication Protocols

2019 ◽  
Vol 9 (2) ◽  
pp. 247-252 ◽  
Author(s):  
Ashish Joshi ◽  
Amar Kumar Mohapatra
Keyword(s):  
Execution Time ◽  
Communication Systems ◽  
Security Analysis ◽  
Cryptographic Protocols ◽  
Command Line ◽  
Time Analysis ◽  
Authentication Protocols ◽  
Replay Attack ◽  
Peer Communication ◽  
Digital Communication Systems

Background & Objective: Cryptographic protocols had been evident method for ensuring con dentiality, Integrity and authentication in various digital communication systems. However the validation and analysis of such cryptographic protocols was limited to usage of formal mathematical models until few years back. Methods: In this paper, various popular cryptographic protocols have been studied. Some of these protocols (PAP, CHAP, and EAP) achieve security goals in peer to peer communication while others (RADIUS, DIAMETER and Kerberos) can work in multiparty environment. These protocols were validated and analysed over two popular security validation and analysis tools AVISPA and Scyther. The protocols were written according to their documentation using the HLPSL and SPDL for analysis over AVISPA and Scyther respectively. The results of these tools were analysed to nd the possible attack an each protocol. Afterwards The execution time analysis of the protocols were done by repeating the experiment for multiple iterations over the command line versions of these tools.As the literature review suggested, this research also validates that using password based protocols (PAP) is faster in terms of execution time as compared to other methods, Usage of nonces tackles the replay attack and DIAMETER is secure than RADIUS. Results and Conclusion: The results also showed us that DIAMETER is faster than RADIUS. Though Kerberos protocol was found to safe, the results tell us that it is compromisable under particular circumstances.

scholarly journals EXTREME VALUES OF GEODESIC PERIODS ON ARITHMETIC HYPERBOLIC SURFACES

2020 ◽  
pp. 1-36
Author(s):  
Bart Michels
Keyword(s):  
Lower Bound ◽  
Closed Geodesic ◽  
Extreme Values ◽  
Theta Series ◽  
Hyperbolic Surface ◽  
Quadratic Fields ◽  
Maass Forms ◽  
Real Quadratic Fields ◽  
Central Values ◽  
Real Quadratic

Abstract Given a closed geodesic on a compact arithmetic hyperbolic surface, we show the existence of a sequence of Laplacian eigenfunctions whose integrals along the geodesic exhibit nontrivial growth. Via Waldspurger’s formula we deduce a lower bound for central values of Rankin-Selberg L-functions of Maass forms times theta series associated to real quadratic fields.

scholarly journals On the Number of Quadratic Twists with a Rational Point of Almost Minimal Height

2020 ◽  
Author(s):  
Joachim Petit
Keyword(s):  
Asymptotic Formula ◽  
Elliptic Curve ◽  
Asymptotic Estimate ◽  
Rational Point ◽  
Quadratic Fields ◽  
Real Quadratic Fields ◽  
Quadratic Twists ◽  
The Family ◽  
Minimal Height ◽  
Real Quadratic

Abstract We investigate the number of curves having a rational point of almost minimal height in the family of quadratic twists of a given elliptic curve. This problem takes its origin in the work of Hooley, who asked this question in the setting of real quadratic fields. In particular, he showed an asymptotic estimate for the number of such fields with almost minimal fundamental unit. Our main result establishes the analogue asymptotic formula in the setting of quadratic twists of a fixed elliptic curve.

scholarly journals Prime geodesics and averages of the Zagier L-series

2021 ◽  
pp. 1-24
Author(s):  
OLGA BALKANOVA ◽  
DMITRY FROLENKOV ◽  
MORTEN S. RISAGER
Keyword(s):  
Asymptotic Expansion ◽  
Asymptotic Expansions ◽  
Error Term ◽  
Quadratic Fields ◽  
Real Quadratic Fields ◽  
Prime Geodesic Theorem ◽  
Error Terms ◽  
Average Size ◽  
Real Quadratic

Abstract The Zagier L-series encode data of real quadratic fields. We study the average size of these L-series, and prove asymptotic expansions and omega results for the expansion. We then show how the error term in the asymptotic expansion can be used to obtain error terms in the prime geodesic theorem.

scholarly journals Computing conditional entropies for quantum correlations

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Peter Brown ◽  
Hamza Fawzi ◽  
Omar Fawzi
Keyword(s):  
Quantum Key Distribution ◽  
Detection Efficiency ◽  
Conditional Entropy ◽  
Key Distribution ◽  
Quantum Correlations ◽  
Upper Bounds ◽  
Cryptographic Protocols ◽  
Quantum States ◽  
Security Proofs

AbstractThe rates of quantum cryptographic protocols are usually expressed in terms of a conditional entropy minimized over a certain set of quantum states. In particular, in the device-independent setting, the minimization is over all the quantum states jointly held by the adversary and the parties that are consistent with the statistics that are seen by the parties. Here, we introduce a method to approximate such entropic quantities. Applied to the setting of device-independent randomness generation and quantum key distribution, we obtain improvements on protocol rates in various settings. In particular, we find new upper bounds on the minimal global detection efficiency required to perform device-independent quantum key distribution without additional preprocessing. Furthermore, we show that our construction can be readily combined with the entropy accumulation theorem in order to establish full finite-key security proofs for these protocols.

Sign in / Sign up

Export Citation Format

Share Document