Results 11 to 20 of about 177,470 (196)

Experimental Quantum Cryptography [PDF]

open access: yesJournal of Cryptology, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bennett, Charles H.   +4 more
openaire   +2 more sources

Efficient Unified Arithmetic for Hardware Cryptography [PDF]

open access: yes, 2008
The basic arithmetic operations (i.e. addition, multiplication, and inversion) in finite fields, GF(q), where q = pk and p is a prime integer, have several applications in cryptography, such as RSA algorithm, Diffie-Hellman key exchange algorithm [1 ...
Koc, Cetin Kaya   +3 more
core   +2 more sources

Another look at HMQV

open access: yesJournal of Mathematical Cryptology, 2007
The HMQV protocols are 'hashed variants' of the MQV key agreement protocols. They were introduced at CRYPTO 2005 by Krawczyk, who claimed that the HMQV protocols have very significant advantages over their MQV counterparts: (i) security proofs under ...
Menezes Alfred
doaj   +1 more source

Acknowledgement to Reviewers of Cryptography in 2018

open access: yesCryptography, 2019
Rigorous peer-review is the corner-stone of high-quality academic publishing [...]
Cryptography Editorial Office
doaj   +1 more source

A efficient and robust privacy-preserving framework for cross-device federated learning

open access: yesComplex & Intelligent Systems, 2023
To ensure no private information is leaked in the aggregation phase in federated learning (FL), many frameworks use homomorphic encryption (HE) to mask local model updates.
Weidong Du   +5 more
doaj   +1 more source

Lattice Enumeration with Discrete Pruning: Improvements, Cost Estimation and Optimal Parameters

open access: yesMathematics, 2023
Lattice enumeration is a linear-space algorithm for solving the shortest lattice vector problem (SVP). Extreme pruning is a practical technique for accelerating lattice enumeration, which has a mature theoretical analysis and practical implementation ...
Luan Luan   +3 more
doaj   +1 more source

Strict avalanche criterion over finite fields

open access: yesJournal of Mathematical Cryptology, 2007
Boolean functions which satisfy the Strict Avalanche Criterion (SAC) play an important role in the art of information security. In this paper, we extend the concept of SAC to finite fields GF(p).
Li Yuan, Cusick T. W.
doaj   +1 more source

A semantic‐based method for analysing unknown malicious behaviours via hyper‐spherical variational auto‐encoders

open access: yesIET Information Security, 2023
In the User and Entity Behaviour Analytics (UEBA), unknown malicious behaviours are often difficult to be automatically detected due to the lack of labelled data.
Yi‐feng Wang, Yuan‐bo Guo, Chen Fang
doaj   +1 more source

Neural cryptography

open access: yesProceedings of the 9th International Conference on Neural Information Processing, 2002. ICONIP '02., 2004
9th International Conference on Neural Information Processing, Singapore, Nov ...
Kinzel, Wolfgang, Kanter, Ido
openaire   +2 more sources

Template Attack of LWE/LWR-Based Schemes with Cyclic Message Rotation

open access: yesEntropy, 2022
The side-channel security of lattice-based post-quantum cryptography has gained extensive attention since the standardization of post-quantum cryptography.
Yajing Chang   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy