Using Zech’s Logarithm to Find Low-Weight Parity Checks for Linear Recurring Sequences

Kuhn, G.J.; Penzhorn, W.T.

doi:10.1007/978-1-4615-2694-0_22

Search citation statements

Order By: Relevance

Paper Sections

Select...

Birthday1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [18], Penzhorn and Kuhn used a different statistical assumption on the output of Zech's Logarithms. They assumed that the difference of two Zech's Logarithms over {1, 2, .…”

Section: Birthdaymentioning

confidence: 99%

A discrete logarithm-based approach to compute low-weight multiples of binary polynomials

Peterlongo

Sala

Tinnirello

2016

Finite Fields and Their Applications

View full text Add to dashboard Cite

Being able to compute efficiently a low-weight multiple of a given binary polynomial is often a key ingredient of correlation attacks to LFSR-based stream ciphers. The best known general purpose algorithm is based on the generalized birthday problem. We describe an alternative approach which is based on discrete logarithms and has much lower memory complexity requirements with a comparable time complexity.

show abstract

“…In [18], Penzhorn and Kuhn used a different statistical assumption on the output of Zech's Logarithms. They assumed that the difference of two Zech's Logarithms over {1, 2, .…”

Section: Birthdaymentioning

confidence: 99%