The Experts below are selected from a list of 1356 Experts worldwide ranked by ideXlab platform

Galyna Akmayeva - One of the best experts on this subject based on the ideXlab platform.

  • security of mobile internet access with umts hsdpa lte
    World Congress on Internet Security, 2011
    Co-Authors: Daniel Caragata, Safwan El Assad, Ion Tutanescu, Charles A Shoniregun, Galyna Akmayeva
    Abstract:

    This paper focuses on the security of Internet access over the third generation mobile telecommunication networks. We explore the characteristics of cryptographic attacks and the similarities between the exposures of different secret keys in cryptographic attacks and propose three measures that limit the exposure of the sensible secret key. These measures are the usage of a temporary key, TK, the protection of the messages that could be used by a Cryptanalyst to recover the secret key and the increase of the size of the secret key.

  • WorldCIS - Security of mobile Internet access with UMTS/HSDPA/LTE
    2011 World Congress on Internet Security (WorldCIS-2011), 2011
    Co-Authors: Daniel Caragata, Safwan El Assad, Ion Tutanescu, Charles A Shoniregun, Galyna Akmayeva
    Abstract:

    This paper focuses on the security of Internet access over the third generation mobile telecommunication networks. We explore the characteristics of cryptographic attacks and the similarities between the exposures of different secret keys in cryptographic attacks and propose three measures that limit the exposure of the sensible secret key. These measures are the usage of a temporary key, TK, the protection of the messages that could be used by a Cryptanalyst to recover the secret key and the increase of the size of the secret key.

Daniel Caragata - One of the best experts on this subject based on the ideXlab platform.

  • security of mobile internet access with umts hsdpa lte
    World Congress on Internet Security, 2011
    Co-Authors: Daniel Caragata, Safwan El Assad, Ion Tutanescu, Charles A Shoniregun, Galyna Akmayeva
    Abstract:

    This paper focuses on the security of Internet access over the third generation mobile telecommunication networks. We explore the characteristics of cryptographic attacks and the similarities between the exposures of different secret keys in cryptographic attacks and propose three measures that limit the exposure of the sensible secret key. These measures are the usage of a temporary key, TK, the protection of the messages that could be used by a Cryptanalyst to recover the secret key and the increase of the size of the secret key.

  • WorldCIS - Security of mobile Internet access with UMTS/HSDPA/LTE
    2011 World Congress on Internet Security (WorldCIS-2011), 2011
    Co-Authors: Daniel Caragata, Safwan El Assad, Ion Tutanescu, Charles A Shoniregun, Galyna Akmayeva
    Abstract:

    This paper focuses on the security of Internet access over the third generation mobile telecommunication networks. We explore the characteristics of cryptographic attacks and the similarities between the exposures of different secret keys in cryptographic attacks and propose three measures that limit the exposure of the sensible secret key. These measures are the usage of a temporary key, TK, the protection of the messages that could be used by a Cryptanalyst to recover the secret key and the increase of the size of the secret key.

Tamatjita E. N. - One of the best experts on this subject based on the ideXlab platform.

  • Modifikasi Algoritma Vigenère Cipher Menggunakan Metode Catalan Number Dan Double Columnar Transposition
    None, 2015
    Co-Authors: Pratama G. M., Tamatjita E. N.
    Abstract:

    Vigenère Cipher is one of the well-known ciphering algorithms of the past. Modifications to Vigenère Cipher algorithm is made to improve its security, making it more difficult to decipher by a Cryptanalyst. Due to the nature of the algorithm, these measures have to be taken to maintain the confidentiality of ciphered data. This research modified the Vigenère Cipher using Catalan Numbers method and Double Columnar Transposition. Catalan Numbers method is a mathematical method used to randomize the initial key so as to generate a key which is longer and having stronger characteristics; a key which is harder to guess, either by Cryptanalysts or by key-deciphering methods. In addition to the first method, Double Columnar Transposition is used to rearrange the position of data in the generated ciphertext in order to make it appear more random, hence slowing down the cryptanalysis process of the encrypted text. Double Columnar Transposition is done by applying columnar transposition twice to the ciphered text. The applied modifications to Vigenère Cipher are then tested using Kasiski Examination. Resulting ciphertexts are known to have randomised characteristics, which made it difficult to guess the ciphering method used to generate the ciphertexts. Tests done using Kasiski Examination {1, 2, 4} proven that the ciphertexts passed the test, hence putting down the possibility of easy deciphering, and the modifications successfully provided a better and stronger encryption to the Vigenère Cipher

Ugo Vaccaro - One of the best experts on this subject based on the ideXlab platform.

  • Bounds on entropy in a guessing game
    IEEE Transactions on Information Theory, 2001
    Co-Authors: A. De Santis, Antonio Giorgio Gaggia, Ugo Vaccaro
    Abstract:

    We consider the guessing problem proposed by Massey (see Proc. Int. Symp. Information Theory, p.204, 1994) of a Cryptanalyst that wants to break a ciphertext with a brute-force attack. The best strategy he can use is to try out all possible keys, one at time in order of decreasing probability, after narrowing the possibilities by some cryptanalysis. In this correspondence we provide both upper and lower bounds on the entropy of the probability distribution on the secret keys in terms of the number of secret keys and of the average number of trials of the Cryptanalyst.

Jacques Stern - One of the best experts on this subject based on the ideXlab platform.

  • Lattice Reduction: A Toolbox for the Cryptanalyst
    Journal of Cryptology, 1998
    Co-Authors: Antoine Joux, Jacques Stern
    Abstract:

    In recent years, methods based on lattice reduction have been used repeatedly for the cryptanalytic attack of various systems. Even if they do not rest on highly sophisticated theories, these methods may look a bit intricate to practically oriented cryptographers, both from the mathematical and the algorithmic point of view. The aim of this paper is to explain what can be achieved by lattice reduction algorithms, even without understanding the actual mechanisms involved. Two examples are given. One is the attack devised by the second author against Knuth's truncated linear congruential generator. This attack was announced a few years ago and appears here for the first time in complete detail.