Results 21 to 30 of about 172 (89)
Journal of Mathematical Cryptology, 2018 In this paper, we construct some cartesian authentication codes from geometries over finite commutative rings. We only assume the uniform probability distribution over the set of encoding rules in order to be able to compute the probabilities of ...
Jirakitpuwapat Wachirapong +4 more
doaj +1 more source
A New Provably Secure Cryptosystem Using Dedekind Domain Direct Product Approach [PDF]
, 2018 We would like to prevent, detect, and protect communication and information systems' attacks, which include unauthorized reading of a message of file and traffic analysis or active attacks, such as modification of messages or files, and denial of service
Hassani Karbasi, Amir
core +1 more source
Dynamic-FROST: Schnorr threshold signatures with a flexible committee
Journal of Mathematical CryptologyThreshold signatures enable any subgroup of predefined cardinality tt out of a committee of nn participants to generate a valid, aggregated signature.
Cimatti Annalisa +7 more
doaj +1 more source
On the optimality of non-linear computations for symmetric key primitives
Journal of Mathematical Cryptology, 2018 A block is an n-bit string, and a (possibly keyed) block-function is a non-linear mapping that maps one block to another, e.g., a block-cipher. In this paper, we consider various symmetric key primitives with ℓ{\ell} block inputs and raise the following ...
Chakraborti Avik +2 more
doaj +1 more source
A survey on machine learning applied to symmetric cryptanalysis [PDF]
, 2022 In this work we give a short review of the recent progresses of machine learning techniques applied to cryptanalysis of symmetric ciphers, with particular focus on artificial neural networks.
Anna Hambitzer +2 more
core
Signcryption schemes with insider security in an ideal permutation model
Journal of Mathematical Cryptology, 2019 Signcryption aims to provide both confidentiality and authentication of messages more efficiently than performing encryption and signing independently. The “Commit-then-Sign & Encrypt” (CtS&E) method allows to perform encryption and signing in parallel ...
Bansal Tarun Kumar +2 more
doaj +1 more source
Quantum Resistant Random Linear Code Based Public Key Encryption Scheme RLCE [PDF]
, 2015 Lattice based encryption schemes and linear code based encryption schemes have received extensive attention in recent years since they have been considered as post-quantum candidate encryption schemes.
Wang, Yongge
core +2 more sources
mRLWE-CP-ABE: A revocable CP-ABE for post-quantum cryptography
Journal of Mathematical CryptologyWe address the problem of user fast revocation in the lattice-based Ciphertext Policy Attribute-Based Encryption (CP-ABE) by extending the scheme originally introduced by Zhang and Zhang [Zhang J, Zhang Z.
Cianfriglia Marco +2 more
doaj +1 more source
A fundamental flaw in the ++AE authenticated encryption mode
Journal of Mathematical Cryptology, 2018 In this article, we analyse a block cipher mode of operation for authenticated encryption known as ++AE (plus-plus-AE). We show that this mode has a fundamental flaw: the scheme does not verify the most significant bit of any block in the plaintext ...
Qahur Al Mahri Hassan +4 more
doaj +1 more source
Differential experiments using parallel alternative operations
Journal of Mathematical CryptologyThe use of alternative operations in differential cryptanalysis, or alternative notions of differentials, is lately receiving increasing attention. Recently, Civino et al.
Calderini Marco +2 more
doaj +1 more source