Results 11 to 20 of about 207 (105)
Comparison Between Algebraic Cryptanalysis on DES and NTRU
, 2023 Algebraic cryptanalysis is a cryptanalysis method that aims to exploit the algebraic structure of an encryption algorithm to obtain the secret key. Algebraic cryptanalysis becomes interesting because it uses a small amount of known plaintext, which in ...
Kiki Ariyanti Sugeng, Fadila Paradise
core +1 more source
Bent and generalized bent Boolean functions [PDF]
, 2012 Mathematics Subject Classification (2000) 94A60 · 94C10 · 06E30The article of record as published may be found at http://dx.doi.org/10.1007/s10623-012-9622-5;In this paper, we investigate the properties of generalized bent functions defined on Zn2 with ...
Thor Martinsen +7 more
core +1 more source
Using Inclusion / Exclusion to find Bent and Balanced Monomial Rotation Symmetric Functions
Journal of Mathematical Cryptology, 2021 There are many cryptographic applications of Boolean functions. Recently, research has been done on monomial rotation symmetric (MRS) functions which have useful cryptographic properties.
Reid Elizabeth M.
doaj +1 more source
On a class of strongly asymmetric PKA algorithms
Journal of Mathematical Cryptology, 2015 In the papers [New features for public key exchange algorithms, in: 18-th International ICWG Meeting (Krakow 2011)], [Strongly asymmetric PKD cryptographic algorithms: An implementation using the matrix model, in: Proceedings ISEC Conference (Shizuoka ...
Accardi Luigi, Regoli Massimo
doaj +1 more source
Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
Journal of Mathematical Cryptology, 2021 We generalize our earlier works on computing short discrete logarithms with tradeoffs, and bridge them with Seifert's work on computing orders with tradeoffs, and with Shor's groundbreaking works on computing orders and general discrete logarithms.
Ekerå Martin
doaj +1 more source
Efficient halving for genus 3 curves over binary fields [PDF]
, 2009 In this article, we deal with fast arithmetic in the Picard group of hyperelliptic curves of genus 3 over binary fields. We investigate both the optimal performance curves, where [h(x)=1] , and the more general curves where the degree of [h(x)] is 1, 2 ...
Birkner, P. +5 more
core +1 more source
Indifferentiability security of the fast wide pipe hash: Breaking the birthday barrier
Journal of Mathematical Cryptology, 2016 A hash function secure in the indifferentiability framework (TCC 2004) is able to resist all meaningful generic attacks. Such hash functions also play a crucial role in establishing the security of protocols that use them as random functions.
Moody Dustin +2 more
doaj +1 more source
Analysis of a certain polycyclic-group-based cryptosystem
Journal of Mathematical Cryptology, 2015 We investigate security properties of the Anshel–Anshel–Goldfeld commutator key-establishment protocol [Math. Res. Lett. 6 (1999), 287–291] used with certain polycyclic groups described by Eick and Kahrobaei [http://arxiv.org/abs/math.GR/0411077].
Kotov Matvei, Ushakov Alexander
doaj +1 more source
Compression for trace zero points on twisted Edwards curves
Journal of Mathematical Cryptology, 2016 We propose two optimal representations for the elements of trace zero subgroups of twisted Edwards curves. For both representations, we provide efficient compression and decompression algorithms.
Bianco Giulia, Gorla Elisa
doaj +1 more source
Tame logarithmic signatures of abelian groups
Journal of Mathematical Cryptology, 2017 The security of the asymmetric cryptosystem MST1{{}_{1}} relies on the hardness of factoring group elements with respect to a logarithmic signature. In this paper we investigate the factorization problem with respect to logarithmic signatures of abelian ...
Reichl Dominik
doaj +1 more source