Computing Igusa's local zeta functions of univariate polynomials, and linear feedback shift registers.
Computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications.
Construction, properties and applications of finite neofields
We give a short account of the construction and properties of left neofields. Most useful in practice seem to be neofields based on the cyclic group and particularly those having an additional divisibility property, called D-neofields. We shall give examples of applications to the construction of orthogonal latin squares, to the design of tournaments balanced for residual effects and to cryptography.
Counting optimal joint digit expansions.
Criptografía y curvas elípticas.
Cryptanalysis and improvement of a block cipher based on multiple chaotic systems.
Cryptanalysis of a chaotic communication scheme using parameter observer.
Cryptanalysis of a public-key cryptosystem based on Dickson-polynomials
Cryptographic Primitives with Quasigroup Transformations
AMS Subj. Classification: Primary 20N05, Secondary 94A60The intention of this research is to justify deployment of quasigroups in cryptography, especially with new quasigroup based cryptographic hash function NaSHA as a runner in the First round of the ongoing NIST SHA-3 competition. We present new method for fast generation of huge quasigroup operations, based on the so-called extended Feistel networks and modification of the Sade’s diagonal method. We give new design of quasigroup based family of...
Cryptography based on number fields with large regulator
We explain a variant of the Fiat-Shamir identification and signature protocol that is based on the intractability of computing generators of principal ideals in algebraic number fields. We also show how to use the Cohen-Lenstra-Martinet heuristics for class groups to construct number fields in which computing generators of principal ideals is intractable.
Cryptography through Interpolation, Approximation and Computational Intelligence methods
Cryptographycal protocols in the Egerfood Information System.
Deciding knowledge in security protocols under some e-voting theories
In the last decade, formal methods have proved their interest when analyzing security protocols. Security protocols require in particular to reason about the attacker knowledge. Two standard notions are often considered in formal approaches: deducibility and indistinguishability relations. The first notion states whether an attacker can learn the value of a secret, while the latter states whether an attacker can notice some difference between protocol runs with different values of the secret. Several...
Deciding knowledge in security protocols under some e-voting theories
In the last decade, formal methods have proved their interest when analyzing security protocols. Security protocols require in particular to reason about the attacker knowledge. Two standard notions are often considered in formal approaches: deducibility and indistinguishability relations. The first notion states whether an attacker can learn the value of a secret, while the latter states whether an attacker can notice some difference between protocol runs with different values of the secret. Several...
Diophantine equations and class number of imaginary quadratic fields
Let A, D, K, k ∈ ℕ with D square free and 2 ∤ k,B = 1,2 or 4 and , and let denote the class number of the imaginary quadratic field . In this paper, we give the all-positive integer solutions of the Diophantine equation Ax² + μ₁B = K((Ay² + μ₂B)/K)ⁿ, 2 ∤ n, n > 1 and we prove that if D > 1, then , where D, and n satisfy , x ∈ ℕ, 2 ∤ n, n > 1. The results are valuable for the realization of quadratic field cryptosystem.
Edon- – an efficient implementation of Edon- family of cryptographic hash functions
We have designed three fast implementations of a recently proposed family of hash functions Edon–. They produce message digests of length bits and project security of hash computations for finding collisions and hash computations for finding preimages and second preimages. The design is not the classical Merkle-Damgård but can be seen as wide-pipe iterated compression function. Moreover the design is based on using huge quasigroups of orders , and that are constructed by using only bitwise...
Efficient proprietary certification process and secured theft-protected proprietary certificates.
Encryption schemes using finite frames and Hadamard arrays.
Enhanced cryptography by multiple chaotic dynamics.
Equivalences between elliptic curves and real quadratic congruence function fields
In 1994, the well-known Diffie-Hellman key exchange protocol was for the first time implemented in a non-group based setting. Here, the underlying key space was the set of reduced principal ideals of a real quadratic number field. This set does not possess a group structure, but instead exhibits a so-called infrastructure. More recently, the scheme was extended to real quadratic congruence function fields, whose set of reduced principal ideals has a similar infrastructure. As always, the security...