In current cryptography, Encryption Algorithm - Script is code based key derivation feature developed by the Colin Percival, actually for the Tars nap internet (Online) backup service. The Algorithm tech was specifically developed to create it costly to perform extensive scale personalize hardware attacks by needing huge values of currency.
Two years before, the Scrip Algorithm was firstly published by the IETF as RFC 7914. A smooth version of Script is applied as POW (Proof of work) plan by a range of virtual coins, first applied by an unknown developer and followed by LTC and DOGECOIN etc. very soon after.
Why Encryption Algorithm?
• A password or code based derivation feature (code (password) based KDF) is typically made to be mechanically intensive so that it gets a relatively huge time to compute (say on the order of several milliseconds).
• Lawful consumers just need to perform the feature once each process (e.g., verification) and the period needed is negligible. Even though, a brute-force attack would likely need to perform the process millions or billions of times, at that point the time needs become important and ideally, prohibitive.
• Old code/password based KDFs (such as the famous Laboratories PBKDF2 from RSA) have relatively fewer resource demands, meaning they don't need elaborate hardware or extremely huge memory to perform. They're therefore cheaply and simply applied in the hardware (for example or even an FPGA).
• This permits an attacker with enough resources with start on a huge scale parallel attack by developing tons of implementations of the algorithm in tools and having every search in diff subset of the password space.
• This divides the figure of time required to complete a brute force attack by the range of implementations avail, highly possible bringing it to fall down to an affordable time period.
The SCRIPT feature is developed to hinder such tries by growing the resources demands of the algorithm. Especially, the algorithm developed to use a huge value of memory compared to all other code backed KDFs, creating the value of and cost of tools applying much more costly and therefore restricting the value of parallelism an attacker can apply, for given value of economic resources.
The big memory requirements of SCRIPT approach from a great vector of pseudorandom little strings which are designed as part of the algorithm. Once the vector is designed, the parts of it are accessed in a pseudorandom order and united to generate the derived code/password or key. A basic implementation would require to keep the full vector in RAM so that it can be accessed as desired. Because the parts of the vector are designed algorithmically, every part could be designed on the fly as desired, only storing one part in recollection at a time and thus cutting the memory needs significantly.
Even though the generation of every part is intended to be computationally luxurious, and the parts are expected to be accessed a lot of times throughout the execution of the feature. Thus there's a major trade-off in speed in order to dispose of the outsized memory requirements.
This kind of time-recollection deal-off often exists in PC algorithms: speed can be boosted at the price of using more space, or space requirements reduced at the rate of performing more processes and taking longer.
The plan behind this is to deliberately create this trade-off expensive in either side. Therefore an attacker could utilize an implementation that doesn't need a lot of resources but runs incredibly slowly, or utilize an implementation that runs more speedily but has very huge memory needs and is, therefore, more luxurious to parallelize.
Want to learn more about the PAX Coin, follow these official links below:
Website: https://www.pax-coin.io/
Whitepaper: https://www.pax-coin.io/download/PAXCoinWhitepaperEnglishv1.pdf
Telegram group: https://t.me/PaxCoinChat
ANN: https://bitcointalk.org/index.php?topic=5061285
Bounty threads: https://bitcointalk.org/index.php?topic=5061623
Bitcointalk username sudaoiya
PAX address: PHyQ6uNhaKmV6uNpejtuzYEbnSDywm2PHF