367 results
Showing 1–20 · 0.60 seconds · RSS
Journal of Mathematical Cryptology
Scopus
ISSN 1862-2984 · De Gruyter · 367 articles in the index
-
Journal Article
Cryptanalysis of some nonabelian group-based key exchange protocols
In the recently emerging field of nonabelian group-based cryptography, a prominently used one-way function is the conjugacy search problem (CSP), and two important classes of platform groups are polycyclic and matrix groups. In this paper, we discuss the complexity of the conjugacy search problem…
-
Journal Article
Approaches to MEV in DAG-based DLTs
Maximal extractable value (MEV) refers to value extracted from a decentralised ledger by manipulation of transaction ordering. Although MEV can be challenging to define consistently across contexts, it is widely recognised as a significant threat to the fairness and viability of decentralised…
-
Journal Article
Cryptanalysis of plwe based on zero-trace quadratic roots
We extend two of the attacks on the PLWE problem presented by Elias, Lauter et al. to a ring Rq=Fq[x]/(f(x)) ${R}_{q}={\mathbb{F}}_{q}\left[x\right]/\left(f\left(x\right)\right)$ where the irreducible monic polynomial f(x)∈Z[x] $f\left(x\right)\in \mathbb{Z}\left[x\right]$ has an irreducible…
-
Journal Article
Computing pairings on elliptic curves with embedding degree two via biextensions
Bilinear pairings have emerged as a fundamental tool in public-key cryptography, enabling advanced protocols such as identity-based encryption, short signatures, and zero-knowledge proofs. This paper focuses on optimizing pairing computations on curves with embedding degree 2, addressing both…
-
Journal Article
On the security of the CLSV PAEKS scheme
Calderini, Longo, Sala and Villa (Journal of Mathematical Cryptology 2024) proposed a public key encryption with keyword search (PKES) scheme which we call the CLSV scheme. They claim that the scheme provides Ciphertext-Indistinguishability (CI) security where no keyword information is leaked from…
-
Journal Article
Analysis of collision probability in Merkle trees in the random oracle model
This work analyzes the probability of collisions in Merkle graphs, with a focus on a specific class of attacks in balanced Merkle trees. To provide a tractable model, each hash function is modeled as an independent random oracle with finite input space. We provided a general methodology for…
-
Journal Article
On integer sequences in cryptography
Integer sequences play a pivotal role in cryptography, acting as foundational elements for numerous cryptographic algorithms. This comprehensive investigation examines integer sequences that have significantly impacted the sector in domains such as key generation, hash function design, and…
-
Journal Article
Cross-primitive comparison in CP-ABE
Ciphertext-Policy Attribute-Based Encryption (CP-ABE) is a cornerstone technique for fine-grained access control in encrypted data sharing, with pairing-based schemes having established the de facto standard. However, their vulnerability to quantum attacks generated growing interest in alternatives…
-
Journal Article
Distribution of powers modulo p and security of RSA
Let p be a prime and a be any fixed positive integer such that gcd(a, φ(p)) = 1. For 0 < x
-
Journal Article
Sherlock Holmes zero-knowledge protocols secure against active attackers
We present two simple zero-knowledge interactive proofs that can be instantiated with many of the standard decisional or computational hardness assumptions. Compared with traditional zero-knowledge proofs, in our protocols, the verifier starts first, by emitting a challenge, and then, the prover…
-
Journal Article
A McEliece cryptosystem using permutation codes
This paper is an attempt to build a new public-key cryptosystem, similar to the McEliece cryptosystem, using permutation error-correcting codes. We study a public-key cryptosystem built using two permutation error-correcting codes. We show that these cryptosystems are insecure. However, the general…
-
Journal Article
Inner product functional encryption based on the UOV scheme
We analyze the efficiency and security of the inner product functional encryption (IPFE) protocol introduced in 2021 by Debnath, Mesnager, Dey, and Kundu, specifically when instantiated with UOV. While the scheme offers several advantages, including improvements in key generation and…
-
Journal Article
On the independence heuristic in the dual attack
Post-quantum cryptography deals with the development and analysis of cryptographic schemes that are assumed to be secure even against attackers with access to a powerful quantum computer. Along the main candidates for quantum-safe solutions are cryptographic schemes, whose security is based on…
-
Journal Article
Application of Mordell–Weil lattices with large kissing numbers to acceleration of multiscalar multiplication on elliptic curves
This article aims to speed up (the precomputation stage of) multiscalar multiplication (MSM) on ordinary elliptic curves of j-invariant 0 with respect to specific “independent” (also known as “basis”) points. For this purpose, the so-called Mordell–Weil lattices (up to rank 8) with large kissing…
-
Journal Article
Dynamic-FROST: Schnorr threshold signatures with a flexible committee
Threshold signatures enable any subgroup of predefined cardinality tt out of a committee of nn participants to generate a valid, aggregated signature. Although several (t,n)\left(t,n)-threshold signature schemes exist, most of them assume that the threshold tt and the set of participants do not…
-
Journal Article
BTLE: Atomic swaps with time-lock puzzles
We present BTLE (Broadcast Time-Lock Exchange Protocol), a two-step protocol that aims to decentralize exchange of funds between two blockchains in scenarios similar to online exchanges. BTLE leverages time-lock puzzles to achieve that. In the first phase, the BTLE-MA protocol allows for a matching…
-
Journal Article
Investigation of metabelian platform groups for protocols based on (simultaneous) conjugacy search problem
There are many group-based cryptosystems in which the security is related to the conjugacy search problem or the simultaneous conjugacy search problem in their underlying platform groups. In this article, we show that some metabelian groups do not provide strong security for these cryptosystems and…
-
Journal Article
First-degree prime ideals of composite extensions
Let Q(α){\mathbb{Q}}\left(\alpha ) and Q(β){\mathbb{Q}}\left(\beta ) be linearly disjoint number fields and let Q(θ){\mathbb{Q}}\left(\theta ) be their compositum. We prove that the first-degree prime ideals (FDPIs) of Z[θ]{\mathbb{Z}}\left[\theta ] may almost always be constructed in terms of the…
-
Journal Article
The least primitive roots mod p
Let p>1p\gt 1 be a large prime number, and let ε>0\varepsilon \gt 0 be a small number. The established unconditional upper bounds of the least primitive root u≠±1,v2u\ne \pm 1,{v}^{2} in the prime finite field Fp{{\mathbb{F}}}_{p} have exponential magnitudes u≪p1⁄4+εu\ll {p}^{1/4+\varepsilon }…
-
Journal Article
Modern techniques in somewhat homomorphic encryption
The term “homomorphism” was introduced in cryptography by Rivest, Adleman, and Dertouzos in 1978 to address performing calculations on encrypted data without decryption. Since then, researchers have increasingly aimed to design schemes supporting numerous operations. This article aims to synthesize…