ASCII code table

In the EMA system, both the key and the data source are sets of bytes stored in files and/or RAM. Keys can be generated randomly using simple algorithms or even manually. Each key element is naturally and closely related to its unique progressive index. Once generated, it is used to mask a source and cannot be modified. Only the same key that was used to mask the source data can unmask the masked data. All files, whether they contain keys or source data, whether they are encrypted or decrypted, consist of 256 ASCII characters/bytes.

1^st column=decimal unsigned value 2^nd column=signed decimal value 3^rd column=corresponding character (depends on the encoding used)
000	000	NUL	032	032	space	064	064	@	096	096	`	128	-128	Ç	160	-096	á	192	-064	└	224	-032	α
001	001	SOH	033	033	!	065	065	A	097	097	a	129	-127	ü	161	-095	í	193	-063	┴	225	-031	ß
002	002	STX	034	034	“	066	066	B	098	098	b	130	-126	é	162	-094	ó	194	-062	├	226	-030	Γ
003	003	ETX	035	035	#	067	067	C	099	099	c	131	-125	â	163	-093	ú	195	-061	├	227	-029	π
004	004	EOT	036	036	$	068	068	D	100	100	d	132	-124	ä	164	-092	ñ	196	-060	─	228	-028	Σ
005	005	ENQ	037	037	%	069	069	E	101	101	e	133	-123	à	165	-091	Ñ	197	-059	┼	229	-027	σ
006	006	ACK	038	038	&	070	070	F	102	102	f	134	-122	å	166	-090	ª	198	-058	╞	230	-026	µ
007	007	BEL	039	039	‘	071	071	G	103	103	g	135	-121	ç	167	-089	º	199	-057	╟	231	-025	ß
008	008	BS	040	040	(	072	072	H	104	104	h	136	-120	ê	168	-088	¿	200	-056	╚	232	-024	τ
009	009	HT	041	041	)	073	073	I	105	105	i	137	-119	ë	169	-087	⌐	201	-055	╔	233	-023	Φ
010	010	LF/NL	042	042	*	074	074	J	106	106	j	138	-118	è	170	-086	¬	202	-054	╩	234	-022	Θ
011	011	VT	043	043	+	075	075	K	107	107	k	139	-117	ï	171	-085	½	203	-053	╦	235	-021	Ω
012	012	FF	044	044	,	076	076	L	108	108	l	140	-116	î	172	-084	¼	204	-052	╠	236	-020	δ
013	013	CR	045	045	–	077	077	M	109	109	m	141	-115	ì	173	-083	¡	205	-051	═	237	-019	∞
014	014	SO	046	046	.	078	078	N	110	110	n	142	-114	Ä	174	-082	«	206	-050	╬	238	-018	φ
015	015	SI	047	047	/	079	079	O	111	111	o	143	-113	Å	175	-081	»	207	-049	╧	239	-017	ε
016	016	DLE	048	048	0	080	080	P	112	112	p	144	-112	É	176	-080	░	208	-048	╨	240	-016	∩
017	017	DC1	049	049	1	081	081	Q	113	113	q	145	-111	§	177	-079	▒	209	-047	╤	241	-015	≡
018	018	DC2	050	050	2	082	082	R	114	114	r	146	-110	Æ	178	-078	▓	210	-046	╥	242	-014	±
019	019	DC3	051	051	3	083	083	S	115	115	s	147	-109	ô	179	-077	│	211	-045	╙	243	-013	≥
020	020	DC4	052	052	4	084	084	T	116	116	t	148	-108	ö	180	-076	┤	212	-044	╘	244	-012	≤
021	021	NAK	053	053	5	085	085	U	117	117	u	149	-107	ò	181	-075	╡	213	-043	╒	245	-011	⌠
022	022	SYN	054	054	6	086	086	V	118	118	v	150	-106	û	182	-074	╢	214	-042	╓	246	-010	⌡
023	023	ETB	055	055	7	087	087	W	119	119	w	151	-105	ù	183	-073	╖	215	-041	╫	247	-009	÷
024	024	CAN	056	056	8	088	088	X	120	120	x	152	-104	ÿ	184	-072	╕	216	-040	╪	248	-008	≈
025	025	EM	057	057	9	089	089	Y	121	121	y	153	-103	Ö	185	-071	╣	217	-039	┘	249	-007	°
026	026	SUB	058	058	:	090	090	Z	122	122	z	154	-102	Ü	186	-070	║	218	-038	┌	250	-006	∙
027	027	ESC	059	059	;	091	091	[	123	123	{	155	-101	¢	187	-069	╗	219	-037	█	251	-005	·
028	028	FS	060	060	<	092	092	\	124	124	\|	156	-100	£	188	-068	╝	220	-036	▄	252	-004	√
029	029	GS	061	061	=	093	093	]	125	125	}	157	-099	¥	189	-067	╜	221	-035	▌	253	-003	ⁿ
030	030	RS	062	062	>	094	094	^	126	126	~	158	-098	₧	190	-066	╛	222	-034	▐	254	-002	²
031	031	US	063	063	?	095	095	_	127	127	DEL	159	-097	ƒ	191	-065	┐	223	-033	▀	255	-001	■

ASCII code table (ANSI encoding) containing the bytes that make up the keys and all data sources.
You can see in the form three columns for each byte/character (unsigned decimal, signed decimal, and character).
The display of characters depends on the encoding set used. Many of them are not printable.

The key is applied to the data source by a known and public masking technique generating the encrypted data, which is a set of data of the same length as the data source plus a limited number of bytes, (additional data) that are used to make the checks needed in the subsequent unmasking/decryption stage.

The masked data content may not be the same as the original data and may be mixed within blocks of the same length as the key. For example, using the replacement technique with a 1024 bytes long key, data is replaced within each 1024 byte blocks of the data source. Almost the same is true for shuffling.

Once the data source has been encrypted, the loss of the key means that it is impossible to decrypt the data and thus get back the original data.

Someone who wanted to decrypt the data source would have to be able to recreate the exact keys. Guessing a 512KB long key means finding it among 256^524.288 of possible theoretical combinations. Furthermore, finding a sequence of characters with complete meaning (plain text or binary) is neither the same as having found the key nor being sure that the “decrypted” string is correct.

Note
Bytes can be represented in a number of ways. As unsigned integers from 0 to 255, as signed integers from -128 to 127, and as characters (many of which cannot be displayed). For convenience, they are represented as unsigned integers from 0 to 255 and as relative characters (ANSI encoding).