- Full text PDF available (42)
- This year (5)
- Last 5 years (27)
- Last 10 years (55)
Journals and Conferences
In this work a new model for fire front spreading based on two-dimensional cellular automata is proposed. It is a more realistic modification of the model introduced by Karafyllidis and Thanailakis (see [Karafyllidis I, Thanailakis A. A model for predicting forest fire spreading using cellular automata. Ecol Model 1997;99:87–97]), which is based on the… (More)
We propose a reduced equation for hyperelliptic curves of genus 2 over finite fields ? q of q elements with characteristic different from 2 and 5. We determine the number of isomorphism classes of genus-2 hyperelliptic curves having an ? q -rational Weierstrass point. These results have applications to hyperelliptic curve cryptography.
Biometric recognition offers a reliable and natural solution to the problem of user authentication by means of her physical and behavioral traits. An iris template protection scheme which associates and retrieves a secret value with a high level of security, is proposed. The security is guaranteed thanks to the requirements of fuzzy extractors. The… (More)
In this work a new multisecret sharing scheme for secret color images among a set of users is proposed. The protocol allows each participant in the scheme to share a secret color image with the rest of participants in such a way that all of them can recover all the secret color images only if the whole set of participants pools their shadows. The proposed… (More)
Elliptic Curve Cryptography (ECC) is a relatively recent branch of cryptography based on the arithmetic of elliptic curves and the Elliptic Curve Discrete Logarithm Problem (ECDLP). Elliptic curve cryptographic schemes are public-key mechanisms that provide encryption, digital signature and key exchange capabilities. The best known encryption scheme based… (More)
A (k, n)-threshold scheme based on two-dimensional memory cellular automata is proposed to share images in a secret way. This method allows to encode an image into n shared images so that only qualified subsets of k or more shares can recover the secret image, but any k−1 or fewer of them gain no information about the original image. The main… (More)
An analysis of a recently proposed cryptosystem based on chaotic oscillators and feedback inversion is presented. It is shown how the cryptosystem can be broken when Duffing’s oscillator is considered. Some implementation problems of the system are also discussed.