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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Generation of an (arbitrarily) long string of bits unique to a givenfinite-length numerical seed is of great value in the field of random numbergeneration, computer simulations, and other areas of computer science.Extending this idea such that the bitstring cannot be reverse-engineered torecover the original seed value extends the value of such a system to the fieldof cryptography, as the string can be used directly as an encryption mask, oras the input to some other cryptographic function. The longer the string thatcan be generated, the closer the system would come to the ideal cryptographiccase of the One Time Pad.  In this paper we propose a scheme for taking an initial seed (nominally a128-bit integer, but not restricted to such), and expanding this into a uniquebitstring of a length determined by a limit cycle that makes it useful inpractical applications. We utilize novel mathematical concepts such ascombinatorial decomposition to turn the seed value into unique rotations of apre-defined table, which are operated on via destructive functions such asexclusive-OR (XOR) and add-with-carry (ADC) to eventually produce the uniquebitstring.  We assert that the process of iterating the XOR or ADC operation conforms tothe known NP-complete problem known as Subset-Sum, meaning that the reversal ofthe process that produced the bitstring is tantamount to solving theNP-Complete Subset-Sum problem, which in turn is less efficient than thebrute-force method of testing every seed value until the correspondingbitstring is found, making the system highly relevant in a cryptographiccontext.

Driving an NP-Complete problem with Combinatorial Decomposition to generate a unique and irreversible bitstring from a single integer seed value