An efficient algorithm to generate binary sequences for cryptographic purposes

Author： Fuster-Sabater A.   Garca-Villalba L.J.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.259, Iss.1, 2001-05, pp. : 679-688

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

SPADE: An Efficient Algorithm for Mining Frequent Sequences

By Zaki M.J.  

Machine Learning, Vol. 42, Iss. 1-2, 2001-01 ,pp. : 31-60

Springer Publishing Company

Access to resources Recommend Favorite

Reordering computation sequences for memory-efficient binary field multiplication

By Han Tae   Lee Mun-Kyu  

The Journal of Supercomputing, Vol. 66, Iss. 2, 2013-11 ,pp. : 936-949

Springer Publishing Company

Access to resources Recommend Favorite

Efficient String Matching Algorithm for Searching Large DNA and Binary Texts

By  

International Journal on Semantic Web and Information Systems (IJSWIS), Vol. 13, Iss. 4, 2017-10 ,pp. : 198-220

IGI Global_journal

Access to resources Recommend Favorite

Efficient FPGA Implementation of Novel Cryptographic Hashing Core

By Michail H.   Kakarountas A.   Milidonis A.   Goutis C.  

Computing Letters, Vol. 2, Iss. 1-2, 2006-05 ,pp. : 21-27

VSP

Access to resources Recommend Favorite

A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences through Alignment

By Jansson Jesper   Ng See-Kiong   Sung Wing-Kin   Willy Hugo  

Algorithmica, Vol. 46, Iss. 2, 2006-10 ,pp. : 223-245

Springer Publishing Company

Access to resources Recommend Favorite