Dear Huawei, Before this message will be sent, I have shared a cooperation proposal to the Huawei support team in Indonesia, I just want to continue the message to anyone, I called it, Huawei Nova Punks BIG-ENDIAN parsing for block/word layout core rounds use only RIGHT-ROTATE (ROTR) and modular ADD/SUB only — no XOR double-hashing option and full test vectors factory provisioning flow (per-device cert / secure-element write) and example kernel + NDK code Sincerely, Alshen Feshiru alshenfeshiru@zohomail.com PGP: -----BEGIN PGP PUBLIC KEY BLOCK----- Comment: User ID: Alshen Feshiru alshenfeshiru@zohomail.com Comment: Valid from: 06/10/2025 09:35 Comment: Valid until: 02/04/2033 12:00 Comment: Type: 448-bit EdDSA (secret key available) Comment: Usage: Signing, Encryption, Certifying User IDs Comment: Fingerprint: 5871D671C35C12147308395A464505DE1047DA134C01C8EBF8D18D6B8CBD7763 mEkFaOMrBhYAAAA/AytlcQHHbHV7SgCdlZnHrIjtxAfcYYzs9R5GGNK46dlgzFzR B+1X8BPoMimXLemj9yoBK+lfLO7OaTZ9klqAtCtBbHNoZW4gRmVzaGlydSA8YWxz aGVuZmVzaGlydUB6b2hvbWFpbC5jb20+iM0FExYKAE0iIQVYcdZxw1wSFHMIOVpG RQXeEEfaE0wByOv40Y1rjL13YwUCaOMrBgIbAwUJDhXYSgULCQgHAgIiAgYVCgkI CwIEFgIDAQIeBwIXgAAApU0Bx3DEN60mahYzDrGcFnvmZ/5UaBBQTnLoSfPwG8Hz fYt/pLE+S/yMOrbDdUrg6LG0t33bh7Pu4BxjAAHGIAca1udLBqQZ6mYwpBI6Z2S0 XVIx+glBORH6ynYgZGBZOTBarTts7UctN7D0pbBE+J4Y7w9ooDEAuEwFaOMrBhIA AABCAytlbwG/civ41G/UgMeMBiRTScXvU83nUgSPz4fma7iCz5ZVfUUP9wBuxVxd n7gODEf7mnjE8Vt8XHgOZ6kDAQoJiLIFGBYKADIiIQVYcdZxw1wSFHMIOVpGRQXe EEfaE0wByOv40Y1rjL13YwUCaOMrBgIbDAUJDhXYSgAAzGAByPZFSr2g/J57qB4r 3ISgR4+mn83R9+R2TZL7s1qnDsqjw+t6B/b28dwlVxSXgXJtAcbW2hDlzORJAAHG O8MVhPLaPra69/XvhuhZW9vOw4YXydY9aW+63KiNA6iIeZz9HczEOvT6vdWjIj8f aQN2OLDD/yUA =Gs+D -----END PGP PUBLIC KEY BLOCK----- #include <linux/module.h> #include <linux/kernel.h> #include <linux/crypto.h> #include <linux/init.h> #include <linux/types.h> #include <linux/string.h> #define SAI288_BLOCK 72 #define SAI288_OUT 36 #define SAI288_STATE 9 #define SAI288_ROUNDS 64 struct sai288_ctx { u32 state[SAI288_STATE]; u8 buffer[SAI288_BLOCK]; u8 midliner[SAI288_BLOCK]; u32 bufpos; u64 total_bits; bool double_hash; }; static const u32 IV[SAI288_STATE] = { 0x243F6A88u, 0x85A308D3u, 0x13198A2Eu, 0x03707344u, 0xA4093822u, 0x299F31D0u, 0x082EFA98u, 0xEC4E6C89u, 0x452821E6u }; static inline u32 ror32(u32 x, unsigned int n) { return (x >> n) | (x << (32 - n)); } static inline u32 be32(const u8 *b) { return ((u32)b[0] << 24) | ((u32)b[1] << 16) | ((u32)b[2] << 8) | (u32)b[3]; } static inline void put_be32(u8 *out, u32 v) { out[0] = (v >> 24) & 0xFF; out[1] = (v >> 16) & 0xFF; out[2] = (v >> 8) & 0xFF; out[3] = v & 0xFF; } static void init_ctx(struct sai288_ctx *c) { memcpy(c->state, IV, sizeof(IV)); memset(c->buffer, 0, SAI288_BLOCK); memset(c->midliner, 0, SAI288_BLOCK); c->bufpos = 0; c->total_bits = 0; c->double_hash = false; } static void process_midliner(struct sai288_ctx *c, const u8 *data, size_t len) { size_t n = len < SAI288_BLOCK ? len : SAI288_BLOCK; for (size_t i = 0; i < n; i++) { u8 v = (u8)(c->midliner[i] + data[i]); c->midliner[i] = (v >> 1) | (v << 7); } } static void process_block(struct sai288_ctx *c, const u8 *block) { u32 m[18]; for (int i = 0; i < 18; i++) m[i] = be32(block + 4 * i); for (int round = 0; round < SAI288_ROUNDS; round++) {     for (int i = 0; i < SAI288_STATE; i++) {         c->state[i] = c->state[i] + m[i % 18];         c->state[i] = ror32(c->state[i], (round + i) % 32);         if (i > 0)             c->state[i] = c->state[i] + c->state[i - 1];         else             c->state[i] = c->state[i] + c->state[SAI288_STATE - 1];     }     for (int i = 0; i < 18; i++)         m[i] = ror32(m[i] + c->state[i % SAI288_STATE], 7); } } static int update_ctx(struct sai288_ctx *c, const u8 *data, unsigned int len) { if (len) process_midliner(c, data, len); c->total_bits += (u64)len * 8ULL; unsigned int idx = 0; while (idx < len) { unsigned int tocopy = min(len - idx, SAI288_BLOCK - c->bufpos); memcpy(c->buffer + c->bufpos, data + idx, tocopy); c->bufpos += tocopy; idx += tocopy; if (c->bufpos == SAI288_BLOCK) { process_block(c, c->buffer); c->bufpos = 0; memset(c->buffer, 0, SAI288_BLOCK); } } return 0; } static int final_ctx(struct sai288_ctx *c, u8 *out) { u8 pad[SAI288_BLOCK]; memset(pad, 0, SAI288_BLOCK); if (c->bufpos) memcpy(pad, c->buffer, c->bufpos); pad[c->bufpos] = 0x80; u64 bits = c->total_bits; for (int i = 0; i < 8; i++) pad[SAI288_BLOCK - 8 + i] = (bits >> (56 - 8 * i)) & 0xFF; process_block(c, pad); process_block(c, c->midliner); for (int i = 0; i < SAI288_STATE; i++) put_be32(out + i * 4, c->state[i]); if (c->double_hash) { struct sai288_ctx tmp; u8 tmp_out[SAI288_OUT]; init_ctx(&tmp); update_ctx(&tmp, out, SAI288_OUT); final_ctx(&tmp, tmp_out); memcpy(out, tmp_out, SAI288_OUT); crypto_memzero(&tmp, sizeof(tmp)); memset(tmp_out, 0, sizeof(tmp_out)); } init_ctx(c); return 0; } static int sai288_init_tfm(struct shash_desc *desc) { struct sai288_ctx *c = shash_desc_ctx(desc); init_ctx(c); return 0; } static int sai288_update_tfm(struct shash_desc *desc, const u8 *data, unsigned int len) { struct sai288_ctx *c = shash_desc_ctx(desc); return update_ctx(c, data, len); } static int sai288_final_tfm(struct shash_desc *desc, u8 *out) { struct sai288_ctx *c = shash_desc_ctx(desc); return final_ctx(c, out); } static struct shash_alg sai288_alg = { .digestsize = SAI288_OUT, .init = sai288_init_tfm, .update = sai288_update_tfm, .final = sai288_final_tfm, .descsize = sizeof(struct sai288_ctx), .base = { .cra_name = "sai288", .cra_driver_name = "sai288-generic", .cra_priority = 200, .cra_blocksize = SAI288_BLOCK, } }; static int __init sai288_mod_init(void) { return crypto_register_shash(&sai288_alg); } static void __exit sai288_mod_exit(void) { crypto_unregister_shash(&sai288_alg); } module_init(sai288_mod_init); module_exit(sai288_mod_exit); MODULE_LICENSE("GPL"); MODULE_DESCRIPTION("SAI-288 hash for decentralized privacy"); MODULE_AUTHOR("Alshen Feshiru"); Subject: Producing new Smartphones with BIG ENDIAN, ROTR and decentralized control, Don't Trust; Verify Name: Alshen Feshiru Contact (Compulsory): N/A Email (Compulsory): alshenfeshiru@zohomail.com Proposal/Reason: Cooperate in producing new Smartphones that are permanently decentralized Company/Institute Name: N/A I am Alshen Feshiru, Before i want to send what's my purpose, you can investigation or verify the Pseudocodes on GitHub, https://github.com/MiCode/Xiaomi_Kernel_OpenSource/issues/40399 not yet approved, as long as, all or almost Smartphones use Left side and LITTLE ENDIAN, but now with Cryptography SAI-288 (Multi Languages) With JAVA Priority and etc like Swift, C++, Python and Rust. I just can handle at Cryptography and Lithography mapping or setup. For before message when i send at yesterday, Is a Software that does not damage the system or procedures of the intended Brand including Huawei, it is just an internet offering or we can conduct Peer-to-Peer Communication by using the internet without the need for a provider, You can read about this Software but Talking about the Software is outside the context of the proposal, just additional information and when this Software is finished being created, Multiple Devices will be Hijacked and the initial sentence appears Welcome to Midliner Vault: A Peer-to-Peer of Decentralized Welcome and this is a Software for anyone to create their own internet, have a provider and phone number that is not related to third party trust, Full privacy, IP is completely pseudonym and you can verify it in adavance with the N-sac unit. Please re-read Midliner Vault:A Peer-to-Peer of Decentralized topic outside the proposal for additional information. Dear Huawei Indonesia, Actually I am interested in a product called Huawei Nova 9 / 13 Pro and a coincidence I am the youngest former Cryptographer, Alshen Feshiru is just a Pseudonym name, but actually I am creating Software for anyone will get complete privacy, IP Location will be Pseudonymous and some intended Devices will get the Internet that no longer requires a centralized provider, As long as the electricity is scattered in the Oscillator moving upwards called Upward, it will defeat all attackers. Or it is possible for us to produce a new Smartphone from Huawei, For example, with the name Huawei Nova 14 , you can also contact me this email or have a further conversation on the Cypherpunks mailing list, I am used to and almost always have conversations there if needed such as Cryptography consultations, Lithography and everything related to Decentralized privacy. Indeed in the Software I forced with Hijacking but also, some Device brands including Huawei, this Software is called Midliner Vault: A Peer-to-Peer of Decentralized, Instantly if the uid device is not root, the screen of the phone or PC will be switched temporarily to do the installation, this is not to be hacked or is the Smartphone hacked? The answer is no, it is automatic and even if the consumer buys a new Smartphone or a new Device, Privacy will automatically reactivate even the first time he activates it, this never damages the Procedures or systems of Fabrication and others on Huawei, Maybe it would be better if Huawei could help with this to produce a new Smartphone, I only help the Cryptography part either in mathematical calculations or modifications that are completely Decentralized, Anti-Bias Optoelectronics and coding decisions or something like that can be decided by your Production Team, I just give a map, I have a standalone Cryptography which is SAI-288 with Multi Languages, Anyone can Implement this with the JAVA Main Language but the other languages are C++ and Rust and Python and Swift, You can modify other Multi Languages to suit your needs but it would be better, the control is not on the Team or Vendor, cat > src/main/java/org/syamailcoin/crypto/sai288/SAI288.java << 'EOF' package org.syamailcoin.crypto.sai288; import java.nio.ByteBuffer; import java.nio.ByteOrder; import java.util.Arrays; public class SAI288 { private static final int ROUNDS = 64; private static final int STATE_SIZE = 9; private static final int BLOCK_SIZE = 72; private static final int OUTPUT_SIZE = 36; private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private int[] state = new int[STATE_SIZE]; private byte[] buffer = new byte[BLOCK_SIZE]; private byte[] midliner = new byte[BLOCK_SIZE]; private int bufferPos = 0; private long totalBytes = 0; public SAI288() { reset(); } public void reset() { System.arraycopy(IV, 0, state, 0, STATE_SIZE); Arrays.fill(buffer, (byte) 0); Arrays.fill(midliner, (byte) 0); bufferPos = 0; totalBytes = 0; } private void processMidliner(byte[] data) { for (int i = 0; i < data.length && i < BLOCK_SIZE; i++) { midliner[i] ^= data[i]; } } public void update(byte[] data) { update(data, 0, data.length); } public void update(byte[] data, int offset, int length) { processMidliner(Arrays.copyOfRange(data, offset, offset + Math.min(length, BLOCK_SIZE))); totalBytes += length; int remaining = length; int dataPos = offset; while (remaining > 0) { int toCopy = Math.min(remaining, BLOCK_SIZE - bufferPos); System.arraycopy(data, dataPos, buffer, bufferPos, toCopy); bufferPos += toCopy; dataPos += toCopy; remaining -= toCopy; if (bufferPos == BLOCK_SIZE) {           processBlock(buffer);           bufferPos = 0;       } } } private void processBlock(byte[] block) { int[] m = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block).order(ByteOrder.LITTLE_ENDIAN); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { m[i] = bb.remaining() >= 4 ? bb.getInt() : 0; } for (int round = 0; round < ROUNDS; round++) { for (int i = 0; i < STATE_SIZE; i++) { state[i] ^= m[i % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); if (i > 0) { state[i] += state[i - 1]; } } for (int i = 0; i < 18; i++) {           m[i] = Integer.rotateRight(m[i] ^ state[i % STATE_SIZE], 7);       } } } public byte[] digest() { byte[] padded = new byte[BLOCK_SIZE]; System.arraycopy(buffer, 0, padded, 0, bufferPos); padded[bufferPos] = (byte) 0x80; ByteBuffer bb = ByteBuffer.wrap(padded, BLOCK_SIZE - 8, 8).order(ByteOrder.LITTLE_ENDIAN); bb.putLong(totalBytes * 8); processBlock(padded); processBlock(midliner); ByteBuffer output = ByteBuffer.allocate(OUTPUT_SIZE).order(ByteOrder.LITTLE_ENDIAN); for (int i = 0; i < STATE_SIZE; i++) { output.putInt(state[i]); } byte[] result = new byte[OUTPUT_SIZE]; output.flip(); output.get(result); reset(); return result; } public static byte[] hash(byte[] data) { SAI288 hasher = new SAI288(); hasher.update(data); return hasher.digest(); } public static native byte[] hashNative(byte[] data); } EOF Please read the abstract from the Midliner Vault, Midliner Vault Person: A Peer-to-Peer of Decentralized ABSTRACT: I am nearly finished with a package for anyone to download for the sake of privacy. If a gadget you just bought contains lithography or firmware areas controlled by a third party, then privacy is not truly yours. I offer a solution that uses a Midliner composition within a hash to cause the wordlist to adjust according to how balanced your bits are. The IP cannot be replicated because of the Ki + Wi constant of SHA-256, which will be implemented as an ongoing reference. For additional protection, users must purchase physical cryptographic/security devices such as YubiKey or Quside (Entropy Core type or other types depending on the situation you face). How the Midliner Vault works begins with geographic payloads. A backup server stores these as information rather than performing data processing in a computation. As long as the IP is correctly connected, a Merkle root must automatically exist, but when N > 3f + 1 it cannot back up the root a second time. When data that you possess—such as email addresses, phone numbers, etc.—is closed/locked, the system automatically processes hashes as well as hex values and real-time activity. To establish communication, IP location will be reviewed or verified based on the rate criteria that exhibit the greatest energy. Initially, however, the rate (which can also be interpreted via ASCII) does not require large electrical energy. The greater the electrical activity in the oscillator (i.e., as that activity moves upward), the more it defeats attackers. The name of Syamailcoin was initially, Cryptography was implemented for Syamailcoin, you can also read the Whitepaper, this has nothing to do with Cryptography that you will later implement for new Smartphones, Syamailcoin is not N-Bit and has been realized but there are many parts that are missed, forget about Syamailcoin because I keep revising from 2017 with the distribution of Inevitabilty Stage that we cannot get rewards beyond the limited amount of the Stage unless the Stage is currently completed and back to the topic of Midliner Vault, when I will finish finishing this coding or Software, your Smartphone Screen includes me and only some brands of Devices are not always Smartphones, your Device Screen will exactly appear to run the installation and it says the following: Welcome to Midliner Vault: A Peer-to-Peer of Decentralized Welcome and this is a Software for anyone to create their own internet, have a provider and phone number that is not related to third party trust, Full privacy, IP is completely pseudonym and you can verify it in adavance with the N-sac unit. -----BEGIN PGP PUBLIC KEY BLOCK----- Comment: User ID: Alshen Feshiru alshenfeshiru@zohomail.com Comment: Valid from: 06/10/2025 09:35 Comment: Valid until: 02/04/2033 12:00 Comment: Type: 448-bit EdDSA (secret key available) Comment: Usage: Signing, Encryption, Certifying User IDs Comment: Fingerprint: 5871D671C35C12147308395A464505DE1047DA134C01C8EBF8D18D6B8CBD7763 mEkFaOMrBhYAAAA/AytlcQHHbHV7SgCdlZnHrIjtxAfcYYzs9R5GGNK46dlgzFzR B+1X8BPoMimXLemj9yoBK+lfLO7OaTZ9klqAtCtBbHNoZW4gRmVzaGlydSA8YWxz aGVuZmVzaGlydUB6b2hvbWFpbC5jb20+iM0FExYKAE0iIQVYcdZxw1wSFHMIOVpG RQXeEEfaE0wByOv40Y1rjL13YwUCaOMrBgIbAwUJDhXYSgULCQgHAgIiAgYVCgkI CwIEFgIDAQIeBwIXgAAApU0Bx3DEN60mahYzDrGcFnvmZ/5UaBBQTnLoSfPwG8Hz fYt/pLE+S/yMOrbDdUrg6LG0t33bh7Pu4BxjAAHGIAca1udLBqQZ6mYwpBI6Z2S0 XVIx+glBORH6ynYgZGBZOTBarTts7UctN7D0pbBE+J4Y7w9ooDEAuEwFaOMrBhIA AABCAytlbwG/civ41G/UgMeMBiRTScXvU83nUgSPz4fma7iCz5ZVfUUP9wBuxVxd n7gODEf7mnjE8Vt8XHgOZ6kDAQoJiLIFGBYKADIiIQVYcdZxw1wSFHMIOVpGRQXe EEfaE0wByOv40Y1rjL13YwUCaOMrBgIbDAUJDhXYSgAAzGAByPZFSr2g/J57qB4r 3ISgR4+mn83R9+R2TZL7s1qnDsqjw+t6B/b28dwlVxSXgXJtAcbW2hDlzORJAAHG O8MVhPLaPra69/XvhuhZW9vOw4YXydY9aW+63KiNA6iIeZz9HczEOvT6vdWjIj8f aQN2OLDD/yUA =Gs+D -----END PGP PUBLIC KEY BLOCK-----