Results 41 to 50 of about 774 (86)
Generators of Jacobians of Hyperelliptic Curves [PDF]
, 2007 This paper provides a probabilistic algorithm to determine generators of the m-torsion subgroup of the Jacobian of a hyperelliptic curve of genus two.Comment: 6 ...
Ravnshoj, Christian Robenhagen
core +2 more sources
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
Cryptanalysis of some protocols using matrices over group rings
, 2015 We address a cryptanalysis of two protocols based on the supposed difficulty of discrete logarithm problem on (semi) groups of matrices over a group ring.
Eftekhari, Mohammad
core
Defeating the Kalka--Teicher--Tsaban linear algebra attack on the Algebraic Eraser
, 2011 The Algebraic Eraser (AE) is a public key protocol for sharing information over an insecure channel using commutative and noncommutative groups; a concrete realization is given by Colored Burau Key Agreement Protocol (CBKAP).
Goldfeld, Dorian, Gunnells, Paul E.
core
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
Enhancing Goldreich, Goldwasser and Halevi’s scheme with intersecting lattices
Journal of Mathematical Cryptology, 2019 We present a technique to enhance the security of the Goldreich, Goldwasser and Halevi (GGH) scheme. The security of GGH has practically been broken by lattice reduction techniques.
Sipasseuth Arnaud +2 more
doaj +1 more source
MRHS solver based on linear algebra and exhaustive search
Journal of Mathematical Cryptology, 2018 We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks.
Raddum Håvard, Zajac Pavol
doaj +1 more source