TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Cryptographic protocols are often designed and analyzed under some trusted set-up assumptions, namely in settings where the participants have access to global information...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper presents a very simple and efficient adaptivelysound perfect NIZK argument system for any NP-language. In contrast to recently proposed schemes by Groth, Ostro...
SSC
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we investigate the existence of modular sonar sequences of length v and mod v where v is a product of twin primes. For v = 3 · 5 = 15, we have found some old and ne...
SSC
2007
Springer
14 years 1 months ago
2007
Springer
SSC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The filter generator consists of a linear feedback shift register (LFSR) and a Boolean filtering function that combines some bits from the shift register to create a ke...
SSC
2007
Springer
14 years 1 months ago
2007
Springer
Bent functions f : Fm 2 → F2 achieve largest distance to all linear functions. Equivalently, their spectrum with respect to the Hadamard-Walsh transform is flat (i.e. all spectr...
SSC
2007
Springer
14 years 1 months ago
2007
Springer
Any span n sequences can be regarded as filtering sequences. From this observation, new randomness criteria for span n sequences are proposed. It is proved that the feedback funct...
SSC
2007
Springer
14 years 1 months ago
2007
Springer
In this short note we introduce two new sequences defined using the sum of digits in the representation of an integer in a certain base. A connection to Niven numbers is proposed ...
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We introduce a new approach for cryptanalysis of key agreement protocols based on noncommutative groups. Our approach uses functions that estimate the distance of a group...