{
  "id": "enwiki-001350860423",
  "slug": "ace-encrypt",
  "title": "ACE Encrypt",
  "qid": "",
  "lead": "ACE (advanced cryptographic engine) is the collection of units, implementing both a public key encryption scheme and a digital signature scheme. Corresponding names for these schemes — «ACE Encrypt» and «ACE Sign». Schemes are based on Cramer-Shoup public key encryption scheme and Cramer-Shoup signature scheme. Introduced variants of these schemes are intended to achieve a good balance between performance and security of the whole encryption system.",
  "body": "ACE (advanced cryptographic engine) is the collection of units, implementing both a public key encryption scheme and a digital signature scheme. Corresponding names for these schemes — «ACE Encrypt» and «ACE Sign». Schemes are based on Cramer-Shoup public key encryption scheme and Cramer-Shoup signature scheme. Introduced variants of these schemes are intended to achieve a good balance between performance and security of the whole encryption system. b\\overset{\\text{def}}{{}={}}\\left\\{0,1\\right\\} — The set of bits. Let us take all sets of form b, b^{n_1}, (b^{n_1})^{n_2},... . For such a set A we define the \"zero element\": {{center| 0_b\\stackrel{\\mathrm{def}}{=}0 \\in b ; 0_{A^n}\\stackrel{\\mathrm{def}}{=}(0_A,...,0_A) \\in A^n for n>0 .}} We define B\\stackrel{\\mathrm{def}}{{}={}}b^8 as a set of bytes, and W\\stackrel{\\mathrm{def}}{{}={}}b^{32} as a set of words. For x \\in A^{\\ast} with A \\in \\left\\{b,B,W\\right\\} and l>0 we define a padding operator: {{center| pad_l(x) \\stackrel{\\mathrm{def}}{=} \\begin{cases} x, & L(x) \\ge l \\\\ x||0_{A^{l-L(x)}}, & L(x) .}} k_1,k_2 — elements B^\\ast with L(k_1)=20l'+64 and L(k_2)=32\\left\\lceil l/16 \\right\\rceil+40 , where l=\\left\\lceil m/8 \\right\\rceil and l'=L_b(\\left\\lceil (2\\left\\lceil l/4 \\right\\rceil +4)/16 \\right\\rceil) . Generate random byte strings k_1 \\in B^{20l'+64} and k_2 \\in B^{2\\left\\lceil l/16 \\right\\rceil+40} , where l=L_B(P) and l' = L_B(\\left\\lceil (2\\left\\lceil l/4 \\right\\rceil +4)/16 \\right\\rceil) . Return the public key/private key pair representation, and the corresponding inverse function CDecode . For the integer l>0 , word string s \\in W^4 , integers 0 \\le u_1,u_2,v , and byte string e \\in B^{\\ast} , {{center| CEncode(l,s,u_1,u_2,v,e) \\stackrel{\\mathrm{def}}{=}I_{W^{\\ast}}^{B^{\\ast}}(s)||pad_l(I_{Z}^{B^{\\ast}}(u_1))||pad_l(I_{Z}^{B^{\\ast}}(u_2))||pad_l(I_{Z}^{B^{\\ast}}(v))||e \\in B^{\\ast} .}} For integer l>0 , byte string \\psi \\in B^{\\ast} , such that L(\\psi) \\ge 3l+16 , {{center| CDecode(l,\\psi) \\stackrel{\\mathrm{def}}{=}(I_{B^{\\ast}}^{W^{\\ast}}(\\Bigl[\\psi\\Bigr]_{0}^{16}),I_{B^{\\ast}}^{Z}(\\Bigl[\\psi\\Bigr]_{16}^{16+l}),I_{B^{\\ast}}^{Z}(\\Bigl[\\psi\\Bigr]_{16+l}^{16+2l}),I_{B^{\\ast}}^{Z}(\\Bigl[\\psi\\Bigr]_{16+2l}^{16+3l}),\\Bigl[\\psi\\Bigr]_{16+3l}^{L(\\psi)}) \\in W^4 \\times Z \\times Z \\times Z \\times B^{\\ast} .}} Before starting off the symmetric encryption process, the input message M \\in B^{\\ast} is divided into blocks M_1,...,M_t , where each of the block, possibly except the last one, is of 1024 bytes. Each block is encrypted by the stream cipher. For each encrypted block E_i 16-byte message authentication code is computed. We get the cryptogram Note that if L(M)=0 , then L(e)=0 . Algorithm. ACE asymmetric encryption process. Input: (k,s,M,m) \\in W^8 \\times W^4 \\times Z \\times B^{\\ast} m>0 Output: e \\in B^l , l=L(M)+16 \\left\\lceil L(N)/m \\right\\rceil . If M=\\lambda_B , then return \\lambda_B . Initialize a pseudo-random generator state: Generate the key k_{AXU} AXUHash : e \\leftarrow \\lambda_B, i \\leftarrow 0 . While i , do the following: r \\leftarrow min(L(M)-i,m) . Generate mask values for the encryption and MAC: (mask_m,genState) \\leftarrow GenWords(4,genState) . (mask_e,genState) \\leftarrow GenWords(r,genState) . Encrypt the plaintext: enc \\leftarrow \\Bigl[M\\Bigr]_i^{i+r} \\oplus mask_e . Generate the message authentication code: If i+r=L(M) , then lastBlock \\leftarrow 1 ; else lastBlock \\leftarrow 0 . mac \\leftarrow AXUHash(k_{AXU},lastBlock,enc) \\in W^4 . Update the ciphertext: e \\leftarrow e||enc||I_{W^{\\ast}}^{B^{\\ast}}(mac \\oplus mask_m) . i \\leftarrow i+r . Return e . Compute: note that 0 \\le u_1,u_2,v , where l=L_B(P) . Verify the ciphertext preamble: If u_1 \\ge P or u_2 \\ge P or v \\ge P , then return Reject . If u_1^q \\ne 1 rem P , then return Reject . reject \\leftarrow 0 . If u_2 \\ne u_1^w rem P , then reject \\leftarrow 1 . Compute \\alpha \\leftarrow UOWHash^{\\prime}(k_1,L_B(P),s,u_1,u_2) \\in Z ; note that 0 \\le \\alpha \\le 2^{160} . If v \\ne u_1^{x+{\\alpha}y} rem P , then reject \\leftarrow 1 . If reject=1 , then return Reject . Compute the key for the symmetric decryption operation: \\tilde{h_1} \\leftarrow u_1^{z_1} rem P , \\tilde{h_2} \\leftarrow u_1^{z_2} rem P . Compute k \\leftarrow ESHash(k_2,L_B(P),s,u_1,\\tilde{h_1},\\tilde{h_2}) \\in W^8 . Compute M \\leftarrow SDec(k,s,1024,e) ;note that SDec can return Reject . Return M . Algorithm. Decryption operation SDec . Input: (k,s,m,e) \\in W^8 \\times W^4 \\times Z \\times B^{\\ast} m>0 Output: Decrypted message M \\in B^{\\ast} \\cup {Reject} . If e=\\lambda_B , then return \\lambda_B . Initialize a pseudo-random generator state: Generate the key k_{AXU} AXUHash : M \\leftarrow \\lambda_B, i \\leftarrow 0 . While i , do the following: r \\leftarrow min(L(e)-i,m+16)-16 . If r \\le 0 , then return Reject . Generate mask values for the encryption and MAC: (mask_m,genState) \\leftarrow GenWords(4,genState) . (mask_e,genState) \\leftarrow GenWords(r,genState) . Verify the message authentication code: If i+r+16=L(M) , then lastblock \\leftarrow 1 ; else lastblock \\leftarrow 0 . mac \\leftarrow AXUHash(k_{AXU},lastBlock,\\Bigl[e\\Bigr]_i^{i+r}) \\in W^4 . If \\Bigl[e\\Big]r_{i+r}^{i+r+16} \\ne I_{W^{\\ast}}^{B^{\\ast}}(mac \\oplus mask_m) , then return Reject . Update the plaintext: M \\leftarrow M||(\\Bigl[e\\Bigr]_i^{i+r}) \\oplus mask_e) . i \\leftarrow i+r+16 . Return M . N — N=pq and has either m or m-1 bit. h,x — elements \\left\\{1,...,N-1\\right\\} (quadratic residues modulo N ). e' — 161-bit prime number. a — element \\left\\{0,...,(p-1)(q-1)/4-1\\right\\} k' — elements B^{184} . s — elements B^{32} . Generate random prime numbers p,q , such that (p-1)/2 and (q-1)/2 — is also a prime number, and m_1=\\left\\lfloor m/2 \\right\\rfloor and m_1=\\left\\lceil m/2 \\right\\rceil . Set N \\leftarrow pq . Generate random prime number e' , где 2^{160} \\le e' \\le 2^{161} . Generate random h' \\in \\left\\{1,...,N-1\\right\\} , taking into account gcd(h',N)=1 and gcd(h' \\pm 1,N)=1 , and compute h \\leftarrow (h')^{-2} rem N . Generate random a \\in \\left\\{0,...,(p-1)(q-1)/4-1\\right\\} and compute x \\leftarrow h^a rem N . Generate random byte strings k' \\in B^{184} , and s \\in B^{32} . Return public key/private key pair \\tilde{k} — element B^{\\ast} ;note that L(\\tilde{k})=64+20L_B(\\left\\lceil (L(M)+8)/64 \\right\\rceil) , where M — message being signed. We need to introduce the SEncode function, which maps a signature into its byte string representation, and the corresponding inverse function SDecode . For integer l>0 , byte string d \\in B^{64} , integers 0 \\le w \\le 256^{21} and 0 \\le y,y' , and byte string \\tilde{k} \\in B^{\\ast} ,{{center| SEncode(l,d,w,y,y',\\tilde{k}) \\stackrel{\\mathrm{def}}{=}d||pad_{21}(I_{Z}^{B^{\\ast}}(w))||pad_l(I_{Z}^{B^{\\ast}}(y))||pad_l(I_{Z}^{B^{\\ast}}(y'))||\\tilde{k} \\in B^{\\ast} .}} For integer l>0 , byte string \\sigma \\in B^{\\ast} , where L(\\sigma) \\ge 2l+53 , {{center| CSecode(l,\\sigma) \\stackrel{\\mathrm{def}}{=}(\\Bigl[\\sigma\\Bigr]_{0}^{64},I_{B^{\\ast}}^{Z}(\\Bigl[\\sigma\\Bigr]_{64}^{85}),I_{B^{\\ast}}^{Z}(\\Bigl[\\sigma\\Bigr]_{85}^{85+l}),I_{B^{\\ast}}^{Z}(\\Bigl[\\sigma\\Bigr]_{85+l}^{85+2l}),\\Bigl[\\sigma\\Bigr]_{85+2l}^{L(\\sigma)}) \\in B^{64} \\times Z \\times Z \\times Z \\times B^{\\ast} .}} Generate a hash key \\tilde{k} \\in B^{20m+64} at random, such that m=L_b(\\left\\lceil (L(M)+8)/64 \\right\\rceil) . Compute m_h \\leftarrow I_{W^{\\ast}}^{Z}(UOWHash^{\\prime\\prime}(\\tilde{k},M)) . Select \\tilde{y} \\in \\left\\{1,...,N-1\\right\\} at random, and compute y' \\leftarrow \\tilde{y}^2 rem N . Compute x' \\leftarrow (y')^{r'}h^{m_h} rem N . Generate a random prime e , 2^{160} \\le e \\le 2^{161} , and its certificate of correctness (w,d) : (e,w,d) \\leftarrow GenCertPrime(s) . Repeat this step until e \\ne e' . Set r \\leftarrow UOWHash^{\\prime\\prime\\prime}(k',L_B(N),x',\\tilde{k}) \\in Z ; note that 0 \\le r . Compute y \\leftarrow h^b rem N , where and where p'=(p-1)/2 and q'=(q-1)/2 . Encode the signature: Return \\sigma ==External links== http://www.alphaworks.ibm.com/tech/ace http://www.zurich.ibm.com/security/ace/ NESSIE Portfolio of recommended cryptographic primitives",
  "categories": [
    "22917375",
    "23287627",
    "24043274"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1350860423",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1777029863.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001350860423",
    "type": "webpage",
    "title": "ACE Encrypt",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/ace-encrypt",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          21
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          21
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001350860423",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1350860423",
    "note": "Immutable snapshot enwiki-001350860423"
  }
}