Eco-Homestay: Development Concept on Rural Tourism-Based Conservation Model (Study Case of Sidomulyo Village, Silo District, Jember Regency)

The purposes of this research were to assess the concept of Eco-Homestay in conservation-based tourism in rural area. A case study was set up at Sidomulyo Village, Silo District, Jember. A qualitative method in the form of in-depth interviews was performed as a tool to generate models. Informants in this study included the staff of the Department of Forestry and Plantation, lecturer of the Faculty of Agriculture and Polytechnic of Jember, State University of Jember, and Sidomulyo community in Silo Districts, Jember. The result showed that the purposes of eco-homestay can be reached by managing the structure of integrated development, structure of organizational management, structure of financial management, marketing strategies, operational strategies and physical building. Keywords: conservation, eco-homestay, rural tourism, Sidomuly

The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem

The Goldreich-Goldwasser-Halevi (GGH) cryptosystem is declared broken due to the modified versions of the embedding attacks, known as Nguyen’s σ, Nguyen’s 2σ and Lee-Hahn’s attacks. Despite using the same approach as the original embedding attack, these attacks deployed different strategies and resulted in different performances for breaking the GGH cryptosystem. In this paper, we described those strategies in detail. Moreover, we investigated the mathematical factors behind these attacks’ ability and performance discrepancies. Mathematical proof examines and discusses the factors that triggered those variances. As a result, the expected lattice gap and implemented lattice dimensions are mathematically proven as the factors that significantly influenced these attacks’ performance. By demonstrating how the attacks manipulated these factors, any lattice-based cryptosystem that relies on the hardness of the CVP could avoid repeating the same slipup as the GGH. Hence, precautionary action could be proactively taken to prevent it from being threatened by embedding-based attacks

The efficiency of embedding-based attacks on the GGH lattice-based cryptosystem

The Goldreich-Goldwasser-Halevi (GGH) cryptosystem is declared broken due to the modified versions of the embedding attacks, known as Nguyen’s σ, Nguyen’s 2σ and Lee-Hahn’s attacks. Despite using the same approach as the original embedding attack, these attacks deployed dif-ferent strategies and resulted in different performances for breaking the GGH cryptosystem. In this paper, we described those strategies in detail. Moreover, we investigated the mathematical factors behind these attacks’ ability and performance discrepancies. Mathematical proof exam-ines and discusses the factors that triggered those variances. As a result, the expected lattice gap and implemented lattice dimensions are mathematically proven as the factors that signifi-cantly influenced these attacks’ performance. By demonstrating how the attacks manipulated these factors, any lattice-based cryptosystem that relies on the hardness of the CVP could avoid repeating the same slipup as the GGH. Hence, precautionary action could be proactively taken to prevent it from being threatened by embedding-based attacks

A !ew Efficient Asymmetric Cryptosystem for large data sets

The Diophantine Equation Hard Problem (DEHP) is a potential cryptographic problem on a Diophantine equation. The DEHP has been in existence for ``worst case scenario of the RSA, Diffie-Hellman and El-Gammal schemes. However, the DEHP emerges after the exponentiation and modular reduction process. The proposed scheme (known as the $AA_{\beta}$-cryptosystem) is an asymmetric cryptographic scheme that utilizes this concept (without any prior mathematical operation) together with the factorization problem of two large primes. Its encryption speed has a complexity order faster than the Diffie-Hellman Key Exchange, El-Gammal, RSA and ECC. It can encrypt large data sets than its key size. It has a simple mathematical structure. Thus, it would have low computational requirements and would enable communication devices with low computing power to deploy secure communication procedures efficiently

An Upgrade on the Key Generation Algorithm of the GGH-MKA Lattice-Based Encryption Scheme

This paper presents an upgrade on the key generation algorithm of a current variant of the Goldreich-Goldwasser-Halevi lattice-based encryption scheme, referred to as the GGH-MKA cryptosystem. The keys for this cryptosystem consisting of lattice bases where the private key is required to be a ‘good’ basis while the public key is required to be a ‘bad’ basis to ensure the cryptosystem works effectively. In the key generation algorithm of the GGH cryptosystem, the good and bad features of the lattice bases are measured by computing orthogonality-defect value. If the value is ‘close to 1’, the basis is considered as a good basis. On the contrary, the basis is considered as a bad basis if its orthogonality-defect value is ‘far from 1’. Clearly, the consideration on various subjective terms could potentially trigger technical error during the key generation processes. In this paper, we proposed new conditions on the private and public bases of the GGH-MKA cryptosystem. Instead of depending solely on the orthogonality-defect values, the proposed conditions could make the measurement of good and bad bases in the key generation algorithm of the GGH-MKA cryptosystem becomes clearer and deterministic