Sciweavers

WCC
2005
Springer
122views Cryptology» more  WCC 2005»
13 years 10 months ago
Frequency/Time Hopping Sequences with Large Linear Complexities
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk ) by taking successive k-tuples of given sequences over GF(p). We are abl...
Yun-Pyo Hong, Hong-Yeop Song
WCC
2005
Springer
197views Cryptology» more  WCC 2005»
13 years 10 months ago
Linear Filtering of Nonlinear Shift-Register Sequences
Nonlinear n-stage feedback shift-register sequences over the finite field Fq of period qn − 1 are investigated under linear operations on sequences. We prove that all members o...
Berndt M. Gammel, Rainer Göttfert
WCC
2005
Springer
172views Cryptology» more  WCC 2005»
13 years 10 months ago
Dimension of the Linearization Equations of the Matsumoto-Imai Cryptosystems
Abstract. The Matsumoto-Imai (MI) cryptosystem was the first multivariate public key cryptosystem proposed for practical use. Though MI is now considered insecure due to Patarin...
Adama Diene, Jintai Ding, Jason E. Gower, Timothy ...
WCC
2005
Springer
135views Cryptology» more  WCC 2005»
13 years 10 months ago
Open Problems Related to Algebraic Attacks on Stream Ciphers
Abstract. The recently developed algebraic attacks apply to all keystream generators whose internal state is updated by a linear transition function, including LFSR-based generator...
Anne Canteaut
WCC
2005
Springer
115views Cryptology» more  WCC 2005»
13 years 10 months ago
On the Weights of Binary Irreducible Cyclic Codes
This paper is devoted to the study of the weights of binary irreducible cyclic codes. We start from McEliece’s interpretation of these weights by means of Gauss sums. Firstly, a ...
Yves Aubry, Philippe Langevin
WCC
2005
Springer
117views Cryptology» more  WCC 2005»
13 years 10 months ago
Interpolation of Functions Related to the Integer Factoring Problem
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
Clemens Adelmann, Arne Winterhof
TCC
2005
Springer
90views Cryptology» more  TCC 2005»
13 years 10 months ago
A Universally Composable Secure Channel Based on the KEM-DEM Framework
Waka Nagao, Yoshifumi Manabe, Tatsuaki Okamoto
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
13 years 10 months ago
Adaptive Security of Symbolic Encryption
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
Daniele Micciancio, Saurabh Panjwani
TCC
2005
Springer
94views Cryptology» more  TCC 2005»
13 years 10 months ago
Optimal Error Correction Against Computationally Bounded Noise
For computationally bounded adversarial models of error, we construct appealingly simple, efficient, cryptographic encoding and unique decoding schemes whose error-correction capab...
Silvio Micali, Chris Peikert, Madhu Sudan, David A...
TCC
2005
Springer
96views Cryptology» more  TCC 2005»
13 years 10 months ago
Secure Computation of the Mean and Related Statistics
Eike Kiltz, Gregor Leander, John Malone-Lee