Results 41 to 50 of about 207 (105)

Persistent asymmetric password-based key exchange

Journal of Mathematical Cryptology, 2014
Asymmetric password based key exchange is a key exchange protocol where a client and a server share a low entropic password while the server additionally owns a high entropic secret with respect to a public key. There are simple solutions for this, e.g.,
Jiang Shaoquan
doaj   +1 more source

Formalization of the Advanced Encryption Standard. Part I

, 2013
Summary. In this article, we formalize the Advanced Encryption Standard (AES). AES, which is the most widely used symmetric cryptosystem in the world, is a block cipher that was selected by the National Institute of Standards and Technology (NIST) as an ...
Vol, Formalized
core  

Investigation of metabelian platform groups for protocols based on (simultaneous) conjugacy search problem

Journal of Mathematical Cryptology
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.
Kahrobaei Delaram, Monetta Carmine, Perret Ludovic, Tota Maria, Vigorito Martina   +4 more
doaj   +1 more source

Dynamic-FROST: Schnorr threshold signatures with a flexible committee

Journal of Mathematical Cryptology
Threshold signatures enable any subgroup of predefined cardinality tt out of a committee of nn participants to generate a valid, aggregated signature.
Cimatti Annalisa, De Sclavis Francesco, Galano Giuseppe, Giammusso Sara, Iezzi Michela, Muci Antonio, Nardelli Matteo, Pedicini Marco   +7 more
doaj   +1 more source

Revisiting structure graphs: Applications to CBC-MAC and EMAC

Journal of Mathematical Cryptology, 2016
In [2], Bellare, Pietrzak and Rogaway proved an O⁢(ℓ⁢q2/2n)${O(\ell q^{2}/2^{n})}$ bound for the PRF (pseudorandom function) security of the CBC-MAC based on an n-bit random permutation Π, provided ...
Jha Ashwin, Nandi Mridul
doaj   +1 more source

Threshold RSA Based on the General Chinese Remainder Theorem

, 2008
. In this paper we combine the threshold secret sharing schemes based on the general Chinese remainder theorem with the RSA cryptosystem in order to get threshold decryption or signature generation, as an alternative to the classical solutions based on ...

core  

On the quantum security of high-dimensional RSA protocol

Journal of Mathematical Cryptology
The idea of extending the classical RSA protocol using algebraic number fields was introduced by Takagi and Naito (Construction of RSA cryptosystem over the algebraic field using ideal theory and investigation of its security.
Rahmani Nour-eddine, Serraj Taoufik, Ismaili Moulay Chrif, Azizi Abdelmalek   +3 more
doaj   +1 more source

A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack

Journal of Mathematical Cryptology, 2019
Over the past decade, the hybrid lattice-reduction and meet-in-the middle attack (called hybrid attack) has been used to evaluate the security of many lattice-based cryptographic schemes such as NTRU, NTRU Prime, BLISS and more.
Wunderer Thomas
doaj   +1 more source

Multiple differential-zero correlation linear cryptanalysis of reduced-round CAST-256

Journal of Mathematical Cryptology, 2017
CAST-256 (or CAST6) is a symmetric-key block cipher published in June 1998. It was submitted as a candidate for Advanced Encryption Standard (AES). In this paper, we will propose a new chosen text attack, the multiple differential-zero correlation linear
Hadian Dehkordi Massoud, Taghizadeh Roghayeh   +1 more
doaj   +1 more source

Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem

Journal of Mathematical Cryptology, 2020
We initiate the study of a new class of polynomials which we call quasi-subfield polynomials. First, we show that this class of polynomials could lead to more efficient attacks for the elliptic curve discrete logarithm problem via the index calculus ...
Huang Ming-Deh, Kosters Michiel, Petit Christophe, Yeo Sze Ling, Yun Yang   +4 more
doaj   +1 more source