Results 31 to 40 of about 774 (86)

Revisiting linearly extended discrete functions

Journal of Mathematical Cryptology
The authors introduced a new family of cryptographic schemes in a previous research article, which includes many practical encryption schemes, such as the Feistel family. Given a finite field of order qq, any n>m≥0n\gt m\ge 0, the authors described a new
Gravel Claude, Panario Daniel
doaj   +1 more source

Expansion complexity and linear complexity of sequences over finite fields

, 2016
The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity.
Mérai, László, Niederreiter, Harald, Winterhof, Arne   +2 more
core   +1 more source

Large Cyclic Subgroups of Jacobians of Hyperelliptic Curves [PDF]

, 2007
In this paper we obtain conditions on the divisors of the group order of the Jacobian of a hyperelliptic genus 2 curve, generated by the complex multiplication method described by Weng (2003) and Gaudry (2005). Examples, where these conditions imply that
Ravnshoj, Christian Robenhagen
core   +3 more sources

Defeating the Ben-Zvi, Blackburn, and Tsaban Attack on the Algebraic Eraser [PDF]

, 2016
The Algebraic Eraser Diffie-Hellman (AEDH) protocol was introduced in 2005 and published in 2006 by Anshel-Anshel-Goldfeld-Lemieux as a protocol suitable for use on platforms with constrained computational resources, such as FPGAs, ASICs, and wireless ...
Anshel, Iris, Atkins, Derek, Goldfeld, Dorian, Gunnells, Paul E.   +3 more
core   +1 more source

Combinatorial Bounds and Characterizations of Splitting Authentication Codes

, 2010
We present several generalizations of results for splitting authentication codes by studying the aspect of multi-fold security. As the two primary results, we prove a combinatorial lower bound on the number of encoding rules and a combinatorial ...
B Du, C Blundo, CE Shannon, D Pei, DR Stinson, DR Stinson, DR Stinson, EF Brickell, EN Gilbert, G Ge, GJ Simmons, GJ Simmons, GJ Simmons, GJ Simmons, GJ Simmons, GJ Simmons, J Wang, JL Massey, K Kurosawa, K Kurosawa, M Huber, M Soete De, M Soete De, Michael Huber, T Beth, T Johansson, W Ogata   +26 more
core   +1 more source

Unconditionally secure signature schemes revisited

Journal of Mathematical Cryptology, 2016
Unconditionally secure signature (USS) schemes provide the ability to electronically sign documents without the reliance on computational assumptions needed in traditional digital signatures.
Swanson Colleen M., Stinson Douglas R.
doaj   +1 more source

On the leakage-resilient key exchange

Journal of Mathematical Cryptology, 2017
Typically, secure channels are constructed from an authenticated key exchange (AKE) protocol, which authenticates the communicating parties based on long-term public keys and establishes secret session keys.
Alawatugoda Janaka
doaj   +1 more source

Algebraic generalization of Diffie–Hellman key exchange

Journal of Mathematical Cryptology, 2018
The Diffie–Hellman key exchange scheme is one of the earliest and most widely used public-key primitives. Its underlying algebraic structure is a cyclic group and its security is based on the discrete logarithm problem (DLP).
Partala Juha
doaj   +1 more source

On the efficiency of a general attack against the MOBS cryptosystem

Journal of Mathematical Cryptology, 2022
All instances of the semidirect key exchange protocol, a generalisation of the famous Diffie-Hellman key exchange protocol, satisfy the so-called telescoping equality; in some cases, this equality has been used to construct an attack.
Battarbee Christopher, Kahrobaei Delaram, Tailor Dylan, Shahandashti Siamak F.   +3 more
doaj   +1 more source

Reproducible families of codes and cryptographic applications

Journal of Mathematical Cryptology, 2021
Structured linear block codes such as cyclic, quasi-cyclic and quasi-dyadic codes have gained an increasing role in recent years both in the context of error control and in that of code-based cryptography.
Santini Paolo, Persichetti Edoardo, Baldi Marco   +2 more
doaj   +1 more source