Results 41 to 50 of about 213 (104)
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
Some Lattice Attacks on DSA and ECDSA
, 2010 In this paper, using the LLL reduction method and computing the integral points of two classes of conics, we develop attacks on DSA and ECDSA in case where the secret and the ephemeral key and their modular inverse are quite small or quite large.
Dimitrios Poulakis
core
Random Linear Code Based Public Key Encryption Scheme RLCE [PDF]
, 2015 Lattice based encryption schemes and linear code based encryption schemes have received extensive attention in recent years since they have been considered as post-quantum candidate encryption schemes.
Yongge Wang
core
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
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
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
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
, 1994 This paper considers true broadcast systems for the secure communication of session keys. These are schemes that provide for parallel rather than serial construction of broadcast messages, while avoiding selective broadcasting.
Danny Krizanc +3 more
core
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