Results 1 to 10 of about 856 (103)
A code-based hybrid signcryption scheme
Journal of Mathematical Cryptology, 2023 A key encapsulation mechanism (KEM{\mathsf{KEM}}) that takes as input an arbitrary string, i.e., a tag, is known as tag-KEM{\mathsf{KEM}}, while a scheme that combines signature and encryption is called signcryption.
Klamti Jean Belo, Hasan M. Anwarul
doaj +1 more source
On the efficiency of a general attack against the MOBS cryptosystem
Journal of Mathematical Cryptology, 2022 All instances of the semidirect key exchange protocol, a generalisation of the famous Diffie-Hellman key exchange protocol, satisfy the so-called telescoping equality; in some cases, this equality has been used to construct an attack.
Battarbee Christopher +3 more
doaj +1 more source
Reproducible families of codes and cryptographic applications
Journal of Mathematical Cryptology, 2021 Structured linear block codes such as cyclic, quasi-cyclic and quasi-dyadic codes have gained an increasing role in recent years both in the context of error control and in that of code-based cryptography.
Santini Paolo +2 more
doaj +1 more source
CHIMERA: Combining Ring-LWE-based Fully Homomorphic Encryption Schemes
Journal of Mathematical Cryptology, 2020 This paper proposes a practical hybrid solution for combining and switching between three popular Ring-LWE-based FHE schemes: TFHE, B/FV and HEAAN. This is achieved by first mapping the different plaintext spaces to a common algebraic structure and then ...
Boura Christina +3 more
doaj +1 more source
MAKE: A matrix action key exchange
Journal of Mathematical Cryptology, 2022 We offer a public key exchange protocol based on a semidirect product of two cyclic (semi)groups of matrices over Zp{{\mathbb{Z}}}_{p}. One of the (semi)groups is additive, and the other one is multiplicative.
Rahman Nael, Shpilrain Vladimir
doaj +1 more source
Pseudo-free families and cryptographic primitives
Journal of Mathematical Cryptology, 2022 In this article, we study the connections between pseudo-free families of computational Ω\Omega -algebras (in appropriate varieties of Ω\Omega -algebras for suitable finite sets Ω\Omega of finitary operation symbols) and certain standard cryptographic ...
Anokhin Mikhail
doaj +1 more source
Survey on SAP and its application in public-key cryptography
Journal of Mathematical Cryptology, 2020 The concept of the semigroup action problem (SAP) was first introduced by Monico in 2002. Monico explained in his paper that the discrete logarithm problem (DLP) can be generalized to SAP. After defining the action problem in a semigroup, the concept was
Goel Neha, Gupta Indivar, Dass B. K.
doaj +1 more source
The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives [PDF]
, 2017 In this brief note we connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.Comment: 8 ...
Gadiyar, H. Gopalakrishna, Padma, R.
core +3 more sources
The complexity of MinRank [PDF]
, 2019 In this note, we leverage some of our results from arXiv:1706.06319 to produce a concise and rigorous proof for the complexity of the generalized MinRank Problem in the under-defined and well-defined case.
Caminata, Alessio, Gorla, Elisa
core +2 more sources
Rigorous upper bounds on data complexities of block cipher cryptanalysis
Journal of Mathematical Cryptology, 2017 Statistical analysis of symmetric key attacks aims to obtain an expression for the data complexity which is the number of plaintext-ciphertext pairs needed to achieve the parameters of the attack. Existing statistical analyses invariably use some kind of
Samajder Subhabrata, Sarkar Palash
doaj +1 more source