Results 21 to 30 of about 207 (105)
Journal of Mathematical Cryptology, 2018 Composite order pairing setting has been used to achieve cryptographic functionalities beyond what is attainable in prime order groups. However, such pairings are known to be significantly slower than their prime order counterparts.
Chatterjee Sanjit +2 more
doaj +1 more source
Authenticated Multi-Party Key Agreement
, 1996 We examine multi-party key agreement protocols that provide (i) key authentication, (ii) key confirmation and (iii) forward secrecy. Several minor (repairable) attacks are presented against previous two-party key agreement schemes and a model for key ...
Vaudenay, Serge +3 more
core +1 more source
A trade-off between classical and quantum circuit size for an attack against CSIDH
Journal of Mathematical Cryptology, 2020 We propose a heuristic algorithm to solve the underlying hard problem of the CSIDH cryptosystem (and other isogeny-based cryptosystems using elliptic curves with endomorphism ring isomorphic to an imaginary quadratic order 𝒪).
Biasse Jean-François +4 more
doaj +1 more source
On the security of the Courtois-Finiasz-Sendrier signature
Open Mathematics, 2018 We prove that a variant of the Courtois-Finiasz-Sendrier signature is strongly existentially unforgeable under chosen message attack in the random oracle model, assuming hardness of the Permuted Goppa Syndrome Decoding Problem (also known as the ...
Morozov Kirill +3 more
doaj +1 more source
On Key Distribution via True Broadcasting
, 1994 We consider true broadcast systems for the secure communication of session keys. These schemes provide for parallel rather than serial construction of broadcast messages, while avoiding selective broadcasting.
Danny Krizanc +7 more
core +1 more source
Compartmented Threshold RSA Based on the Chinese Remainder Theorem [PDF]
, 2008 In this paper we combine the compartmented secret sharing schemes based on the Chinese remainder theorem with the RSA scheme in order to obtain, as a novelty, a dedicated solution for compartmented threshold decryption or compartmented threshold digital ...
Stefan Ciobaca +2 more
core
Equivalences of biprojective almost perfect nonlinear functions [PDF]
Two important problems on almost perfect nonlinear (APN) functions are the enumeration and equivalence problems. In this paper, we solve these two problems for any biprojective APN function family by introducing a group theoretic method for those ...
Göloğlu, Faruk, Kölsch, Lukas
core +1 more source
Journal of Mathematical Cryptology, 2014 We provide unconditional results and conditional ones under the assumption of GRH (Generalized Riemann Hypothesis) on the distribution of quadratic residues and quadratic non-residues in ℤ/Nℤ$\mathbb {Z}/N\mathbb {Z}$, where N=pq$N= pq$ is an RSA modulus
Justus Benjamin
doaj +1 more source
Exact information ratios for secret sharing on small graphs with girth at least 5
Journal of Mathematical Cryptology, 2019 In a secret-sharing scheme, a piece of information – the secret – is distributed among a finite set of participants in such a way that only some predefined coalitions can recover it.
Harsányi Károly, Ligeti Péter
doaj +1 more source
Cryptanalysis of an RSA variant with moduli N=prql
Journal of Mathematical Cryptology, 2017 In this paper we study an RSA variant with moduli of the form N=prql{N=p^{r}q^{l}} (r>l≥2{r>l\geq 2}). This variant was mentioned by Boneh, Durfee and Howgrave-Graham [2]. Later Lim, Kim, Yie and Lee [11] showed that this variant is much faster than the
Lu Yao, Peng Liqiang, Sarkar Santanu
doaj +1 more source