English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We present a new approach to constructing of pseudo-random binary sequences(PRS) generators for the purpose of cryptographic data protection, secured fromthe perpetrator's attacks, caused by generation of masses of hardware errorsand faults. The new method is based on use of linear polynomial arithmetic forthe realization of systems of boolean characteristic functions of PRS'generators. "Arithmetizatio" of systems of logic formulas has allowed to applymathematical apparatus of residue systems for multisequencing of the process ofPRS generation and organizing control of computing errors, caused by hardwarefaults. This has guaranteed high security of PRS generator's functioning and,consequently, security of tools for cryptographic data protection based onthose PRSs.

Secure pseudo-random linear binary sequences generators based on arithmetic polynoms