Johan van Tilburg. Security-Analysis of a Class of Cryptosystems Based on Linear Error-Correcting Codes. PhD thesis, Technische Universiteit Eindhoven, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Function Hiding Based on Error Correcting Codes - Loureiro, Molva (1999) (4 citations) (Correct)
....have been analysed: attacks on the public key, aiming at retrieving the secret key from the public key; attacks on the cyphertext, aiming at the disclosure of the plaintext. The second class of attacks has received much more attention, for example it has been mentioned in [21] 31] 11] [32], 10] and [9] to cite a few) Furthermore, Berson in [5] proved that it is easy to recover the plaintext if it has been encrypted twice with the same key using the McEliece scheme, and a different error vector. Nevertheless, in our solution, the attacks on the public key are the sole concern ....
Johan van Tilburg. Security-Analysis of a Class of Cryptosystems Based on Linear Error-Correcting Codes. PhD thesis, Technische Universiteit Eindhoven, 1994.
On the Complexity of Minimum Distance Decoding of Long.. - Barg, Krouk, van Tilborg (1999) (Correct)
....idea bears similarity with methods of steepest descent in continuous spaces. As for syndrome decoding, the only known improvement on its trivial implementation, called below split syndrome decoding, was achieved in [14] The last group of methods is better studied [27] 9] 11] 24] 15] [29], 8] and yields algorithms with best known asymptotic complexity, though the decoding error probability that they ensure approaches that of minimumdistance decoding only for codes of growing length Methods that we discuss can be viewed as modifications of covering set decoding. This algorithm has ....
....contexts. A version of covering set decoding appeared in a 1969 report of J. Omura, see [10, pp. 119 127] Later Omura s algorithm was rediscovered and used 0018 9448 99 10.00 1999 IEEE BARG et al. ON THE COMPLEXITY OF MINIMUM DISTANCE DECODING OF LONG LINEAR CODES 1393 in cryptoanalysis [29]. Paper [9] discussed the use of covering designs in decoding. In the asymptotic setting this algorithm was analyzed in [11] and [24] Unless specified otherwise, a code in this paper means a ary linear code. Below we frequently refer to random linear codes. By this we mean codes defined by ....
[Article contains additional citation context not shown here]
J. van Tilburg, "Security-analysis of a class of cryptosystems based on linear error-correcting codes," Ph.D. dissertation, Univ. Eindhoven, Eindhoven, The Netherlands, 1994, ISBN 90-72125-45-2.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC