Search Results - "Encinas, L. H."

  • Showing 1 - 13 results of 13
Refine Results
  1. 1
  2. 2

    Analysis of the efficiency of the Chor–Rivest cryptosystem implementation in a safe-parameter range by Encinas, L. Hernández, Masqué, J. Muñoz, Dios, A. Queiruga

    Published in Information sciences (15-12-2009)
    “…The Chor–Rivest cryptosystem, based on a high-density knapsack problem on a finite field F q h , was broken by Vaudenay for q ≈ 200 , h ≈ 24 , and h admitting…”
    Get full text
    Journal Article
  3. 3

    Known-Plaintext Attack to Two Cryptosystems Based on the BB Equation by Alvarez, G., Encinas, L.H., Masque, J.M.

    “…Recently, Rama Murthy and Swamy proposed a symmetric cryptosystem based on the Brahmagupta-Bhaskara (BB) equation. The BB equation is the quadratic Diophantine…”
    Get full text
    Journal Article
  4. 4

    A short proof of the generalized Faà di bruno's formula by Encinas, L.Hernández, Masqué, J.Muñoz

    Published in Applied mathematics letters (01-08-2003)
    “…A short proof of the generalized Faa di Bruno formula is given and an explicit parametrization of the set of indices involved in the coefficient of a specific…”
    Get full text
    Journal Article
  5. 5

    A secure scheme to share secret color images by Alvarez, G., Encinas, A. Hernández, Encinas, L. Hernández, del Rey, A. Martín

    Published in Computer physics communications (01-12-2005)
    “…The main goal of this work is to study how discrete dynamical systems can be used to design secret sharing schemes. Specifically, the proposed scheme permits…”
    Get full text
    Journal Article
  6. 6

    Faà di Bruno's formula, lattices, and partitions by Encinas, L. Hernández, del Rey, A. Martín, Masqué, J. Muñoz

    Published in Discrete Applied Mathematics (15-06-2005)
    “…The coefficients of g ( s ) in expanding the rth derivative of the composite function g ∘ f by Faà di Bruno's formula, is determined by a Diophantine linear…”
    Get full text
    Journal Article
  7. 7

    Cryptanalysis of a novel cryptosystem based on chaotic oscillators and feedback inversion by Álvarez Marañón, G., Hernández Encinas, L., Montoya Vitini, F., Muñoz Masqué, J.

    Published in Journal of sound and vibration (06-08-2004)
    “…In recent years, a growing number of cryptosystems based on chaos have been proposed [1], many of them fundamentally flawed by a lack of robustness and…”
    Get full text
    Journal Article
  8. 8
  9. 9

    Total curvatures of a closed curve in Euclidean n-space by HERNANDEZ ENCINAS, L, MUNOZ MASQUE, J

    “…A classical result by J. W. Milnor states that the total curvature of a closed curve C in the Euclidean n-space is the limit of the total curvatures of…”
    Get full text
    Journal Article
  10. 10

    Designing hypermedia tools for solving problems in mathematics by Chamoso Sánchez, José, Hernández Encinas, Luis, López Fernández, Ricardo, Rodrı́guez Sánchez, Mercedes

    Published in Computers and education (01-05-2002)
    “…This article presents the design and preparation using hypermedia tools of an interactive CD-ROM for the active teaching and learning of diverse…”
    Get full text
    Journal Article
  11. 11

    Large decryption exponents in RSA by Encinas, L.Hernández, Masqué, J.Muñoz, Dios, A.Queiruga

    Published in Applied mathematics letters (01-04-2003)
    “…A class of RSA encryption exponents whose corresponding decryption exponents have a bitlength almost equal to the bitlength of the RSA modulus is analysed. In…”
    Get full text
    Journal Article
  12. 12

    Isomorphism Classes of Genus-2 Hyperelliptic Curves Over Finite Fields by Encinas, L. Hernández, Menezes, Alfred J., Masqué, J. Muñoz

    “…We propose a reduced equation for hyperelliptic curves of genus 2 over finite fields F sub(q) of q elements with characteristic different from 2 and 5. We…”
    Get full text
    Journal Article
  13. 13

    Elliptic curve cryptography: Java implementation issues by Gayoso Martinez, V., Sanchez Avila, C., Espinosa Garcia, J., Hernandez Encinas, L.

    “…Elliptic curve cryptography (ECC) is based in one of the hardest arithmetic problems, the elliptic curve discrete logarithm problem, making ECC a reliable…”
    Get full text
    Conference Proceeding