OpenLLM-France/wikimedia huggingface dataset:
# Cryptography/Prime Curve/Chudnovsky Coordinates

<Cryptography

### Introduction

Chudnovsky Coordinates are used to represent elliptic curve points on prime curves y^2 = x^3 + ax + b. They give a speed benefit over Affine Coordinates when the cost for field inversions is significantly higher than field multiplications. In Chudnovsky Coordinates the quintuple (X, Y, Z, Z^2, Z^3) represents the affine point (X / Z^2, Y / Z^3).

### Point Doubling (5M + 6S or 5M + 4S)

Let (X, Y, Z, Z^2, Z^3) be a point (unequal to the point at infinity) represented in Chudnovsky Coordinates. Then its double (X', Y', Z', Z'^2, Z'^3) can be calculated by
Note: if a = -3, then M can also be calculated as M = 3*(X + Z^2)*(X - Z^2), saving 2 field squarings.

### Point Addition (11M + 3S)

Let (X1, Y1, Z1, Z1^2, Z1^3) and (X2, Y2, Z2, Z2^2, Z2^3) be two points (both unequal to the point at infinity) represented in Chudnovsky Coordinates. Then the sum (X3, Y3, Z3, Z3^2, Z3^3) can be calculated by

### Mixed Addition (with affine point) (8M + 3S)

Let (X1, Y1, Z1, Z1^2, Z1^3) be a point represented in Chudnovsky Coordinates and (X2, Y2) a point in Affine Coordinates (both unequal to the point at infinity). A formula to add those points can be readily derived from the regular chudnovsky point addition by replacing each occurrence of "Z2" by "1" (and thereby dropping three field multiplications).

### Mixed Addition (with jacobian point) (11M + 3S)

See Jacobian Coordinates for further details.
# Cryptography/Proportionality of Secrecy

"The more secret information you know, the more successful the concealment of the plaintext."
It is important to realize that any crypto system in its design is an exercise in resource allocation and optimization.
If we were to return to the postal analogy used in the discussion of Asymmetric Ciphers. Suppose Alice has a secret message to send to Bob in the mail. Alice could put the message in her lock box and use Bob's padlock to lock it allowing Bob to open it with his key, as describe earlier. But if it were a really important message or Alice and Bob had a higher expectation of the opponent they wished to thwart (Bob's girlfriend knows where Bob keeps his keys) Alice and Bob might want to resort to a more complicated crypto system. For example Bob could have multiple keys, one he keeps on his key chain, one he keeps in a rented Post Office box and one that is in a box in a Swiss bank vault. Bob might welcome this sort of security for really serious messages but for day to day messages between Bob and Alice Bob will no doubt find a daily flight to Switzerland rather expensive inconvenient. All crypto systems must face a resource trade-off between convenience and security.
This page or section of the Cryptography book is a stub. You can help Wikibooks by expanding it.
# Cryptography/Prime Curve/Jacobian Coordinates

<Cryptography

### Introduction

Jacobian Coordinates are used to represent elliptic curve points on prime curves $y^{2}=x^{3}+ax+b.$ They give a speed benefit over Affine Coordinates when the cost for field inversions is significantly higher than field multiplications. In Jacobian Coordinates the triple $(X,Y,Z)$ represents the affine point $({\frac {X}{Z^{2}}},{\frac {Y}{Z^{3}}})$.

### Point Doubling (4M + 6S or 4M + 4S)

Let (X, Y, Z) be a point (unequal to the point at infinity) represented in Jacobian Coordinates. Then its double (X', Y', Z') can be calculated by
Note: if a = -3, then M can also be calculated as M = 3*(X + Z^2)*(X - Z^2), saving 2 field squarings.

### Repeated Doubling ((4m-1)M + (4m+2)S)

Let P=(X, Y, Z) be a point (unequal to the point at infinity) represented in Jacobian Coordinates. Then, in the case a = -3, its "m-fold double" (2^m)P can be calculated as follows:
An alternative repeated doubling routine with costs (4m)M + (4m+2)S for any value a can be derived from the Modified Jacobian doubling routine. For small values a (say 0 or -3) the costs reduce to (4m-1)M + (4m+2)S, competing nicely with the algorithm showed above.

### Point Addition (12M + 4S)

Let (X1, Y1, Z1) and (X2, Y2, Z2) be two points (both unequal to the point at infinity) represented in Jacobian Coordinates. Then the sum (X3, Y3, Z3) can be calculated by

### Mixed Addition (with affine point) (8M + 3S)

Let (X1, Y1, Z1) be a point represented in Jacobian Coordinates and (X2, Y2) a point in Affine Coordinates (both unequal to the point at infinity). A formula to add those points can be readily derived from the regular jacobian point addition by replacing each occurrence of "Z2" by "1" (and thereby dropping four field multiplications and one field squaring).

### Mixed Addition (with chudnovsky point) (11M + 3S)

Let (X1, Y1, Z1) be a point represented in Jacobian Coordinates and (X2, Y2, Z2, Z2^2, Z2^3) a point in Chudnovsky Coordinates (both unequal to the point at infinity). Then the sum (X3, Y3, Z3) can be readily calculated using the addition formula given above (saving one field multiplication and one field squaring).
# Cryptography/Prime Curve/Standard Projective Coordinates

<Cryptography

### Introduction

Standard Projective Coordinates are used to represent elliptic curve points on prime curves y^2 = x^3 + ax + b. Their usage might give a speed benefit over Affine Coordinates when the cost for field inversions is significantly higher than field multiplications. In Standard Projective Coordinates the triple (X, Y, Z) represents the affine point (X / Z, Y / Z).

### Point Doubling (7M + 5S or 7M + 3S)

Let (X, Y, Z) be a point (unequal to the point at infinity) represented in Standard Projective Coordinates. Then its double (X', Y', Z') can be calculated by
Note: if a = -3, then W can also be calculated as W = 3*(X + Z)*(X - Z), saving 2 field squarings.

### Point Addition (12M + 2S)

Let (X1, Y1, Z1) and (X2, Y2, Z2) be two points (both unequal to the point at infinity) represented in Standard Projective Coordinates. Then the sum (X3, Y3, Z3) can be calculated by

### Mixed Addition (with affine point) (9M + 2S)

Let (X1, Y1, Z1) be a point represented in Standard Projective Coordinates and (X2, Y2) a point in Affine Coordinates (both unequal to the point at infinity). A formula to add those points can be readily derived from the regular standard projective point addition by replacing each occurrence of "Z2" by "1" (and thereby dropping three field multiplications).
# Cryptography/Prime Curve/Affine Coordinates

<Cryptography

### Point Doubling (1I + 2M + 2S)

Let (x,y) be a point (unequal to the point at infinity) on the elliptic (prime) curve given by the equation y^2 = x^3 + ax + b. Then the point (x',y') := 2*(x,y) can be computed by

### Point Addition (1I + 2M + 1S)

Let (x1,y1) and (x2,y2) be two points (both unequal to the point at infinity). Then the point (x3,y3) := (x1,y1) + (x2,y2) can be computed by

### Point decompression

The following algorithm calculates for a given x a value y, such that (x,y) is a point on the elliptic curve.
Notes:
* (t|p) denotes the Legendre symbol of t, which decides whether t is a square number or not.
* The square root can be calculated using the Algorithm of Shanks & Tonelli.
# Cryptography/Protocols

The ideas used in cryptography have been used to create a large number of protocols.
The original application of these ideas was secret hiding -- Alice wanted to send a message to Bob, but Alice and Bob didn't want anyone else to know exactly what the message said.
More recently, many "cryptographic protocols" have been developed that do useful things *other* than secret hiding.
Some cryptographic protocols make secret hiding better or more convenient in some way --
* key-agreement protocols such as Diffie-Hellman key exchange
* Message authentication
(FIXME: say something here about commutative ciphers)
Other cryptographic protocols and cryptography-related ideas are used to improve on non-cryptographic systems:
* Early "everyone in favor, hold up their hands while I count" voting systems don't hide any secrets; end-to-end auditable voting systems (which internally use cryptographic ideas) are arguably better.
* mental poker
* convergent encryption
* digital signatures
* version identifiers in Mercurial and git.
* error-detection and error-correction codes.
* the rsync protocol
* verifiable computing
* various ideas for improving (non-secret) email to reduce the amount of spam, such as hashcash, Sender ID, DomainKeys Identified Mail (DKIM), etc.
In particular, the first fully homomorphic encryption was announced in 2009 by Craig Gentry. It is widely expected that homomorphic encryption will make it relatively easy to do things that were previously considered impossible or infeasible.
# Character Encodings/Code Tables/EBCDIC/EBCDIC 1078

IBM code page 1078 is an EBCDIC code page used in IBM mainframes in Portugal. It is an old version of code page 282.

## Codepage layout

Characters are shown with their equivalent Unicode codes.
EBCDIC 1078 :
| | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | A | B | C | D | E | F |
| 0x | NUL | SOH | STX | ETX | SEL | HT | RNL | DEL | GE | SPS | RPT | VT | FF | CR | SO | SI |
| 1x | DLE | DC1 | DC2 | DC3 | RES/ ENP | NL | BS | POC | CAN | EM | UBS | CU1 | IFS | IGS | IRS | ITB |
| 2x | DS | SOS | FS | WUS | BYP/ INP | LF | ETB | ESC | SA | SFE | SM/ SW | CSP | MFA | ENQ | ACK | BEL |
| 3x | | | SYN | IR | PP | TRN | NBS | EOT | SBS | IT | RFF | CU3 | DC4 | NAK | | SUB |
| 4x | SP | NBSP | â 00E2 | ä 00E4 | à 00E0 | á 00E1 | { 007B | å 00E5 | ~ 007E | ñ 00F1 | [ 005B | . 002E | < 003C | ( 0028 | + 002B | ! 0021 |
| 5x | & 0026 | é 00E9 | ê 00EA | ë 00EB | è 00E8 | í 00ED | î 00EE | ï 00EF | ì 00EC | ß 00DF | ] 005D | $ 0024 | * 002A | ) 0029 | ; 003B | ^ 005E |
| 6x | - 002D | / 002F | Â 00C2 | Ä 00C4 | À 00C0 | Á 00C1 | # 0023 | Å 00C5 | \ 005C | Ñ 00D1 | õ 00F5 | , 002C | % 0025 | _ 005F | > 003E | ? 003F |
| 7x | ø 00F8 | É 00C9 | Ê 00CA | Ë 00CB | È 00C8 | Í 00CD | Î 00CE | Ï 00CF | Ì 00CC | ` 0060 | : 003A | Ã 00C3 | Õ 00D5 | ' 0027 | = 003D | " 0022 |
| 8x | Ø 00D8 | a 0061 | b 0062 | c 0063 | d 0064 | e 0065 | f 0066 | g 0067 | h 0068 | i 0069 | « 00AB | » 00BB | ð 00F0 | ý 00FD | þ 00FE | ± 00B1 |
| 9x | ° 00B0 | j 006A | k 006B | l 006C | m 006D | n 006E | o 006F | p 0070 | q 0071 | r 0072 | ª 00AA | º 00BA | æ 00E6 | ¸ 00B8 | Æ 00C6 | ¤ 00A4 |
| Ax | µ 00B5 | ç 00E7 | s 0073 | t 0074 | u 0075 | v 0076 | w 0077 | x 0078 | y 0079 | z 007A | ¡ 00A1 | ¿ 00BF | Ð 00D0 | Ý 00DD | Þ 00DE | ® 00AE |
| Bx | ¢ 00A2 | £ 00A3 | ¥ 00A5 | · 00B7 | ƒ 0192 | § 00A7 | ¶ 00B6 | ¼ 00BC | ½ 00BD | ¾ 00BE | ¬ 00AC | | 007C | ¯ 00AF | ¨ 00A8 | } 007D | ‗ 2017 |
| Cx | ã 00E3 | A 0041 | B 0042 | C 0043 | D 0044 | E 0045 | F 0046 | G 0047 | H 0048 | I 0049 | SHY | ô 00F4 | ö 00F6 | ò 00F2 | ó 00F3 | ¦ 00A6 |
| Dx | ´ 00B4 | J 004A | K 004B | L 004C | M 004D | N 004E | O 004F | P 0050 | Q 0051 | R 0052 | ı 0131 | û 00FB | ü 00FC | ù 00F9 | ú 00FA | ÿ 00FF |
| Ex | Ç 00C7 | FSP 2007 | S 0053 | T 0054 | U 0055 | V 0056 | W 0057 | X 0058 | Y 0059 | Z 005A | ² 00B2 | Ô 00D4 | Ö 00D6 | Ò 00D2 | Ó 00D3 | @ 0040 |
| Fx | 0 0030 | 1 0031 | 2 0032 | 3 0033 | 4 0034 | 5 0035 | 6 0036 | 7 0037 | 8 0038 | 9 0039 | ³ 00B3 | Û 00DB | Ü 00DC | Ù 00D9 | Ú 00DA | EO |
| Differences from EBCDIC 1084 |||||||||||||||||

## References

* ↑ "Code Page 1078" (PDF). Archived from the original (PDF) on 2013-01-21.
# Character Encodings/Code Tables/EBCDIC/EBCDIC 1072

IBM code page 1072 is an EBCDIC code page used in IBM mainframes in Belgium. It is an old version of code page 274.

## Codepage layout

Characters are shown with their equivalent Unicode codes.
EBCDIC 1072 :
| | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | A | B | C | D | E | F |
| 0x | NUL | SOH | STX | ETX | SEL | HT | RNL | DEL | GE | SPS | RPT | VT | FF | CR | SO | SI |
| 1x | DLE | DC1 | DC2 | DC3 | RES/ ENP | NL | BS | POC | CAN | EM | UBS | CU1 | IFS | IGS | IRS | ITB |
| 2x | DS | SOS | FS | WUS | BYP/ INP | LF | ETB | ESC | SA | SFE | SM/ SW | CSP | MFA | ENQ | ACK | BEL |
| 3x | | | SYN | IR | PP | TRN | NBS | EOT | SBS | IT | RFF | CU3 | DC4 | NAK | | SUB |
| 4x | SP | NBSP | â 00E2 | ä 00E4 | @ 0040 | á 00E1 | ã 00E3 | å 00E5 | \ 005C | ñ 00F1 | [ 005B | . 002E | < 003C | ( 0028 | + 002B | ! 0021 |
| 5x | & 0026 | { 007B | ê 00EA | ë 00EB | } 007D | í 00ED | î 00EE | ï 00EF | ì 00EC | ß 00DF | ] 005D | $ 0024 | * 002A | ) 0029 | ; 003B | ^ 005E |
| 6x | - 002D | / 002F | Â 00C2 | Ä 00C4 | À 00C0 | Á 00C1 | Ã 00C3 | Å 00C5 | Ç 00C7 | Ñ 00D1 | ù 00F9 | , 002C | % 0025 | _ 005F | > 003E | ? 003F |
| 7x | ø 00F8 | É 00C9 | Ê 00CA | Ë 00CB | È 00C8 | Í 00CD | Î 00CE | Ï 00CF | Ì 00CC | ` 0060 | : 003A | # 0023 | à 00E0 | ' 0027 | = 003D | " 0022 |
| 8x | Ø 00D8 | a 0061 | b 0062 | c 0063 | d 0064 | e 0065 | f 0066 | g 0067 | h 0068 | i 0069 | « 00AB | » 00BB | ð 00F0 | ý 00FD | þ 00FE | ± 00B1 |
| 9x | ° 00B0 | j 006A | k 006B | l 006C | m 006D | n 006E | o 006F | p 0070 | q 0071 | r 0072 | ª 00AA | º 00BA | æ 00E6 | ¸ 00B8 | Æ 00C6 | ¤ 00A4 |
| Ax | µ 00B5 | ¨ 00A8 | s 0073 | t 0074 | u 0075 | v 0076 | w 0077 | x 0078 | y 0079 | z 007A | ¡ 00A1 | ¿ 00BF | Ð 00D0 | Ý 00DD | Þ 00DE | ® 00AE |
| Bx | ¢ 00A2 | £ 00A3 | ¥ 00A5 | · 00B7 | ƒ 0192 | § 00A7 | ¶ 00B6 | ¼ 00BC | ½ 00BD | ¾ 00BE | ¬ 00AC | | 007C | ¯ 00AF | ~ 007E | ´ 00B4 | ‗ 2017 |
| Cx | é 00E9 | A 0041 | B 0042 | C 0043 | D 0044 | E 0045 | F 0046 | G 0047 | H 0048 | I 0049 | SHY | ô 00F4 | ö 00F6 | ò 00F2 | ó 00F3 | õ 00F5 |
| Dx | è 00E8 | J 004A | K 004B | L 004C | M 004D | N 004E | O 004F | P 0050 | Q 0051 | R 0052 | ı 0131 | û 00FB | ü 00FC | ¦ 00A6 | ú 00FA | ÿ 00FF |
| Ex | ç 00E7 | FSP 2007 | S 0053 | T 0054 | U 0055 | V 0056 | W 0057 | X 0058 | Y 0059 | Z 005A | ² 00B2 | Ô 00D4 | Ö 00D6 | Ò 00D2 | Ó 00D3 | Õ 00D5 |
| Fx | 0 0030 | 1 0031 | 2 0032 | 3 0033 | 4 0034 | 5 0035 | 6 0036 | 7 0037 | 8 0038 | 9 0039 | ³ 00B3 | Û 00DB | Ü 00DC | Ù 00D9 | Ú 00DA | EO |
| Differences from EBCDIC 1084 |||||||||||||||||
# Character Encodings/Code Tables/EBCDIC/EBCDIC 1073

IBM code page 1073 is an EBCDIC code page used in IBM mainframes in Brazil. It is an old version of code page 275.

## Codepage layout

Characters are shown with their equivalent Unicode codes.
EBCDIC 1073 :
| | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | A | B | C | D | E | F |
| 0x | NUL | SOH | STX | ETX | SEL | HT | RNL | DEL | GE | SPS | RPT | VT | FF | CR | SO | SI |
| 1x | DLE | DC1 | DC2 | DC3 | RES/ ENP | NL | BS | POC | CAN | EM | UBS | CU1 | IFS | IGS | IRS | ITB |
| 2x | DS | SOS | FS | WUS | BYP/ INP | LF | ETB | ESC | SA | SFE | SM/ SW | CSP | MFA | ENQ | ACK | BEL |
| 3x | | | SYN | IR | PP | TRN | NBS | EOT | SBS | IT | RFF | CU3 | DC4 | NAK | | SUB |
| 4x | SP | NBSP | â 00E2 | ä 00E4 | à 00E0 | á 00E1 | ` 0060 | å 00E5 | ¦ 00A6 | ñ 00F1 | É 00C9 | . 002E | < 003C | ( 0028 | + 002B | ! 0021 |
| 5x | & 0026 | } 007D | ê 00EA | ë 00EB | è 00E8 | í 00ED | î 00EE | ï 00EF | ì 00EC | ß 00DF | $ 0024 | Ç 00C7 | * 002A | ) 0029 | ; 003B | ^ 005E |
| 6x | - 002D | / 002F | Â 00C2 | Ä 00C4 | À 00C0 | Á 00C1 | @ 0040 | Å 00C5 | ] 005D | Ñ 00D1 | ç 00E7 | , 002C | % 0025 | _ 005F | > 003E | ? 003F |
| 7x | ø 00F8 | [ 005B | Ê 00CA | Ë 00CB | È 00C8 | Í 00CD | Î 00CE | Ï 00CF | Ì 00CC | ã 00E3 | : 003A | Õ 00D5 | Ã 00C3 | ' 0027 | = 003D | " 0022 |
| 8x | Ø 00D8 | a 0061 | b 0062 | c 0063 | d 0064 | e 0065 | f 0066 | g 0067 | h 0068 | i 0069 | « 00AB | » 00BB | ð 00F0 | ý 00FD | þ 00FE | ± 00B1 |
| 9x | ° 00B0 | j 006A | k 006B | l 006C | m 006D | n 006E | o 006F | p 0070 | q 0071 | r 0072 | ª 00AA | º 00BA | æ 00E6 | ¸ 00B8 | Æ 00C6 | ¤ 00A4 |
| Ax | µ 00B5 | ~ 007E | s 0073 | t 0074 | u 0075 | v 0076 | w 0077 | x 0078 | y 0079 | z 007A | ¡ 00A1 | ¿ 00BF | Ð 00D0 | Ý 00DD | Þ 00DE | ® 00AE |
| Bx | ¢ 00A2 | £ 00A3 | ¥ 00A5 | · 00B7 | ƒ 0192 | § 00A7 | ¶ 00B6 | ¼ 00BC | ½ 00BD | ¾ 00BE | ¬ 00AC | | 007C | ¯ 00AF | ¨ 00A8 | ´ 00B4 | ‗ 2017 |
| Cx | õ 00F5 | A 0041 | B 0042 | C 0043 | D 0044 | E 0045 | F 0046 | G 0047 | H 0048 | I 0049 | SHY | ô 00F4 | ö 00F6 | ò 00F2 | ó 00F3 | { 007B |
| Dx | é 00E9 | J 004A | K 004B | L 004C | M 004D | N 004E | O 004F | P 0050 | Q 0051 | R 0052 | ı 0131 | û 00FB | ü 00FC | ù 00F9 | ú 00FA | ÿ 00FF |
| Ex | \ 005C | FSP 2007 | S 0053 | T 0054 | U 0055 | V 0056 | W 0057 | X 0058 | Y 0059 | Z 005A | ² 00B2 | Ô 00D4 | Ö 00D6 | Ò 00D2 | Ó 00D3 | # 0023 |
| Fx | 0 0030 | 1 0031 | 2 0032 | 3 0033 | 4 0034 | 5 0035 | 6 0036 | 7 0037 | 8 0038 | 9 0039 | ³ 00B3 | Û 00DB | Ü 00DC | Ù 00D9 | Ú 00DA | EO |
| Differences from EBCDIC 1084 |||||||||||||||||

## References

* ↑ "Code Page 1073" (PDF). Archived from the original (PDF) on 2013-01-21.
# Character Encodings/Code Tables/EBCDIC/EBCDIC 1077

IBM code page 1077 is an EBCDIC code page used in IBM mainframes in Japan. It is an old version of code page 281.

## Codepage layout

Characters are shown with their equivalent Unicode codes.
EBCDIC 1077 :
| | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | A | B | C | D | E | F |
| 0x | NUL | SOH | STX | ETX | SEL | HT | RNL | DEL | GE | SPS | RPT | VT | FF | CR | SO | SI |
| 1x | DLE | DC1 | DC2 | DC3 | RES/ ENP | NL | BS | POC | CAN | EM | UBS | CU1 | IFS | IGS | IRS | ITB |
| 2x | DS | SOS | FS | WUS | BYP/ INP | LF | ETB | ESC | SA | SFE | SM/ SW | CSP | MFA | ENQ | ACK | BEL |
| 3x | | | SYN | IR | PP | TRN | NBS | EOT | SBS | IT | RFF | CU3 | DC4 | NAK | | SUB |
| 4x | SP | NBSP | â 00E2 | ä 00E4 | à 00E0 | á 00E1 | ã 00E3 | å 00E5 | ç 00E7 | ñ 00F1 | £ 00A3 | . 002E | < 003C | ( 0028 | + 002B | | 007C |
| 5x | & 0026 | é 00E9 | ê 00EA | ë 00EB | è 00E8 | í 00ED | î 00EE | ï 00EF | ì 00EC | ß 00DF | ! 0021 | ¥ 00A5 | * 002A | ) 0029 | ; 003B | ¬ 00AC |
| 6x | - 002D | / 002F | Â 00C2 | Ä 00C4 | À 00C0 | Á 00C1 | Ã 00C3 | Å 00C5 | Ç 00C7 | Ñ 00D1 | ¦ 00A6 | , 002C | % 0025 | _ 005F | > 003E | ? 003F |
| 7x | ø 00F8 | É 00C9 | Ê 00CA | Ë 00CB | È 00C8 | Í 00CD | Î 00CE | Ï 00CF | Ì 00CC | ` 0060 | : 003A | # 0023 | @ 0040 | ' 0027 | = 003D | " 0022 |
| 8x | Ø 00D8 | a 0061 | b 0062 | c 0063 | d 0064 | e 0065 | f 0066 | g 0067 | h 0068 | i 0069 | « 00AB | » 00BB | ð 00F0 | ý 00FD | þ 00FE | ± 00B1 |
| 9x | ° 00B0 | j 006A | k 006B | l 006C | m 006D | n 006E | o 006F | p 0070 | q 0071 | r 0072 | ª 00AA | º 00BA | æ 00E6 | ¸ 00B8 | Æ 00C6 | ¤ 00A4 |
| Ax | µ 00B5 | ¯ 00AF | s 0073 | t 0074 | u 0075 | v 0076 | w 0077 | x 0078 | y 0079 | z 007A | ¡ 00A1 | ¿ 00BF | Ð 00D0 | Ý 00DD | Þ 00DE | ® 00AE |
| Bx | ¢ 00A2 | [ 005B | \ 005C | · 00B7 | ƒ 0192 | § 00A7 | ¶ 00B6 | ¼ 00BC | ½ 00BD | ¾ 00BE | ^ 005E | ] 005D | ~ 007E | ¨ 00A8 | ´ 00B4 | ‗ 2017 |
| Cx | { 007B | A 0041 | B 0042 | C 0043 | D 0044 | E 0045 | F 0046 | G 0047 | H 0048 | I 0049 | SHY | ô 00F4 | ö 00F6 | ò 00F2 | ó 00F3 | õ 00F5 |
| Dx | } 007D | J 004A | K 004B | L 004C | M 004D | N 004E | O 004F | P 0050 | Q 0051 | R 0052 | ı 0131 | û 00FB | ü 00FC | ù 00F9 | ú 00FA | ÿ 00FF |
| Ex | $ 0024 | FSP 2007 | S 0053 | T 0054 | U 0055 | V 0056 | W 0057 | X 0058 | Y 0059 | Z 005A | ² 00B2 | Ô 00D4 | Ö 00D6 | Ò 00D2 | Ó 00D3 | Õ 00D5 |
| Fx | 0 0030 | 1 0031 | 2 0032 | 3 0033 | 4 0034 | 5 0035 | 6 0036 | 7 0037 | 8 0038 | 9 0039 | ³ 00B3 | Û 00DB | Ü 00DC | Ù 00D9 | Ú 00DA | EO |
| Differences from EBCDIC 1070 |||||||||||||||||

## References

* ↑ "Code Page 1077" (PDF). Archived from the original (PDF) on 2013-01-21.
# Character Encodings/Code Tables/EBCDIC/EBCDIC 1071

IBM code page 1071 is an EBCDIC code page used in IBM mainframes in Austria and Germany. It is an old version of code page 273.

## Codepage layout

Characters are shown with their equivalent Unicode codes.
EBCDIC 1071 :
| | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | A | B | C | D | E | F |
| 0x | NUL | SOH | STX | ETX | SEL | HT | RNL | DEL | GE | SPS | RPT | VT | FF | CR | SO | SI |
| 1x | DLE | DC1 | DC2 | DC3 | RES/ ENP | NL | BS | POC | CAN | EM | UBS | CU1 | IFS | IGS | IRS | ITB |
| 2x | DS | SOS | FS | WUS | BYP/ INP | LF | ETB | ESC | SA | SFE | SM/ SW | CSP | MFA | ENQ | ACK | BEL |
| 3x | | | SYN | IR | PP | TRN | NBS | EOT | SBS | IT | RFF | CU3 | DC4 | NAK | | SUB |
| 4x | SP | NBSP | â 00E2 | { 007B | à 00E0 | á 00E1 | ã 00E3 | å 00E5 | ç 00E7 | ñ 00F1 | Ä 00C4 | . 002E | < 003C | ( 0028 | + 002B | ! 0021 |
| 5x | & 0026 | é 00E9 | ê 00EA | ë 00EB | è 00E8 | í 00ED | î 00EE | ï 00EF | ì 00EC | ~ 007E | Ü 00DC | $ 0024 | * 002A | ) 0029 | ; 003B | ^ 005E |
| 6x | - 002D | / 002F | Â 00C2 | [ 005B | À 00C0 | Á 00C1 | Ã 00C3 | Å 00C5 | Ç 00C7 | Ñ 00D1 | ö 00F6 | , 002C | % 0025 | _ 005F | > 003E | ? 003F |
| 7x | ø 00F8 | É 00C9 | Ê 00CA | Ë 00CB | È 00C8 | Í 00CD | Î 00CE | Ï 00CF | Ì 00CC | ` 0060 | : 003A | # 0023 | § 00A7 | ' 0027 | = 003D | " 0022 |
| 8x | Ø 00D8 | a 0061 | b 0062 | c 0063 | d 0064 | e 0065 | f 0066 | g 0067 | h 0068 | i 0069 | « 00AB | » 00BB | ð 00F0 | ý 00FD | þ 00FE | ± 00B1 |
| 9x | ° 00B0 | j 006A | k 006B | l 006C | m 006D | n 006E | o 006F | p 0070 | q 0071 | r 0072 | ª 00AA | º 00BA | æ 00E6 | ¸ 00B8 | Æ 00C6 | ¤ 00A4 |
| Ax | µ 00B5 | ß 00DF | s 0073 | t 0074 | u 0075 | v 0076 | w 0077 | x 0078 | y 0079 | z 007A | ¡ 00A1 | ¿ 00BF | Ð 00D0 | Ý 00DD | Þ 00DE | ® 00AE |
| Bx | ¢ 00A2 | £ 00A3 | ¥ 00A5 | · 00B7 | ƒ 0192 | @ 0040 | ¶ 00B6 | ¼ 00BC | ½ 00BD | ¾ 00BE | ¬ 00AC | | 007C | ¯ 00AF | ¨ 00A8 | ´ 00B4 | ‗ 2017 |
| Cx | ä 00E4 | A 0041 | B 0042 | C 0043 | D 0044 | E 0045 | F 0046 | G 0047 | H 0048 | I 0049 | SHY | ô 00F4 | ¦ 00A6 | ò 00F2 | ó 00F3 | õ 00F5 |
| Dx | ü 00FC | J 004A | K 004B | L 004C | M 004D | N 004E | O 004F | P 0050 | Q 0051 | R 0052 | ı 0131 | û 00FB | } 007D | ù 00F9 | ú 00FA | ÿ 00FF |
| Ex | Ö 00D6 | FSP 2007 | S 0053 | T 0054 | U 0055 | V 0056 | W 0057 | X 0058 | Y 0059 | Z 005A | ² 00B2 | Ô 00D4 | \ 005C | Ò 00D2 | Ó 00D3 | Õ 00D5 |
| Fx | 0 0030 | 1 0031 | 2 0032 | 3 0033 | 4 0034 | 5 0035 | 6 0036 | 7 0037 | 8 0038 | 9 0039 | ³ 00B3 | Û 00DB | ] 005D | Ù 00D9 | Ú 00DA | EO |
| Differences from EBCDIC 1084 |||||||||||||||||

## References

* ↑ "Code Page 1071" (PDF). Archived from the original (PDF) on 2013-01-21.