Library

alt text

alt text

Sign in

Contact Us

alt text

Our Location

alt text

How Can We Help?


Showing 1 Results, Digital:1, Print: 0

Showing Page No. 1 , Digital:1, Print: 0

A general lower bound for the linear complexity of the product of shift-register sequences

By Goettfert, R.
101., ()

Subject: Advances in Cryptology - EuroCrypt '94; Lecture Notes in Computer Science Volume 950; linear complexity
Availability: 1 of 1(eBook)
Read More

Detail Locate It
<< Prev Next >>
                                                              
Most Viewed View All