Key Generation. Under the GlobalSign model the subscriber has the opportunity to use a trustworthy system in order to generate its own private-public keys, in which case the following terms also apply:
Key Generation. Under the GlobalSign model the subscriber has the opportunity to allow GlobalSign to use a trustworthy system as detailed within the CPS and marketed as ‘AutoCSR’ in order to generate the private-public keys, in which case the following terms also apply:
Key Generation. The algorithm GKE.KGen, on input the set of clients C and a security parameter A, performs the following steps:
Key Generation. Xxxxx generates a secret key sA and public key pA, likewise Xxx generates sB and pB.
Key Generation. If Key Pairs are generated by GlobalSign on behalf of the Subscriber offered as Token or PKCS#12 options, GlobalSign will endeavor to use trustworthy systems in order to generate such Key Pairs, in which case, the following terms also apply. • GlobalSign will generate Key Pairs using a platform recognized as being fit for such purpose and will ensure that Private Keys are encrypted if transported to the Subscriber, • GlobalSign will use a key length and algorithm which is recognized as being fit for the purpose of Digital Signature, and • In the case of both Code Signing and EV Code Signing Certificates, Subscriber acknowledges that GlobalSign will not sign Key Pairs that are smaller than 2048 bits and, in the case of EV Code Signing, will offer SHA2 as the only option for the signature algorithm. GlobalSign does not generate Key Pairs for publicly trusted SSL certificates.
Key Generation. Xxxxx generates k secret key/public key pairs (sAi, pAi),
Key Generation. Upon input of 0, the key generation function computes, for 1 ≤ i ≤ k: αi ←R Z/2mZ, φAi : E → EAi = E/(PA + [αi]QA), (Ri, Si) ← (φAi(PB), φAi(QB)). The key generation function then outputs the private key (α1, . . . , αk) and the public key (EA1, R1, S1), . . . , (EAk, Rk, Sk). The recipient checks that the order of each Ri and Si is 3n to ensure no faults were induced. Upon input of 1 the key generation function computes, for 1 ≤ j ≤ k: βj ←R Z/3nZ, φBj : E → EBi = E/(PB + [βj]QB), (Uj, Vj) ← (φBj(PA), φBj(QA)). The key generation function then outputs the private key (β1, . . . , βk) and the public key (EB1 , U1, V1), . . . , (EBk , Uk, Vk). The recipient checks that the order of each Uj and Vj is 2m to ensure no faults were induced. Communication: Xxx initiates conversation and sends his public key to Xxxxx. Xxxxx responds with her public key.
Key Generation. Xxxxx may use any sophisticated key generation method to determine a strong secret key with high randomness and entropy. In the Figure 5 example, she uses a key starting with 0110.
Key Generation. Upon input of 0, the key generation function computes, for 1 ≤ i ≤ k:
Key Generation. If the SUBSCRIBER generates the key pair itself, it shall choose an algorithm and key length according to ETSI stand- ard TS 119 312, which shall be deemed to be recognised for the usage of this certificate for the duration of the validity pe- riod.
