Searched refs:algorithms (Results 1 - 10 of 10) sorted by relevance
/external/bouncycastle/src/main/java/org/bouncycastle/x509/ |
H A D | X509Util.java | 41 private static Hashtable algorithms = new Hashtable(); field in class:X509Util 48 // algorithms.put("MD2WITHRSAENCRYPTION", PKCSObjectIdentifiers.md2WithRSAEncryption); 49 // algorithms.put("MD2WITHRSA", PKCSObjectIdentifiers.md2WithRSAEncryption); 51 algorithms.put("MD5WITHRSAENCRYPTION", PKCSObjectIdentifiers.md5WithRSAEncryption); 52 algorithms.put("MD5WITHRSA", PKCSObjectIdentifiers.md5WithRSAEncryption); 53 algorithms.put("SHA1WITHRSAENCRYPTION", PKCSObjectIdentifiers.sha1WithRSAEncryption); 54 algorithms.put("SHA1WITHRSA", PKCSObjectIdentifiers.sha1WithRSAEncryption); 56 // algorithms.put("SHA224WITHRSAENCRYPTION", PKCSObjectIdentifiers.sha224WithRSAEncryption); 57 // algorithms.put("SHA224WITHRSA", PKCSObjectIdentifiers.sha224WithRSAEncryption); 59 algorithms [all...] |
/external/bouncycastle/src/main/java/org/bouncycastle/jce/ |
H A D | PKCS10CertificationRequest.java | 75 private static Hashtable algorithms = new Hashtable(); field in class:PKCS10CertificationRequest 85 // algorithms.put("MD2WITHRSAENCRYPTION", new DERObjectIdentifier("1.2.840.113549.1.1.2")); 86 // algorithms.put("MD2WITHRSA", new DERObjectIdentifier("1.2.840.113549.1.1.2")); 88 algorithms.put("MD5WITHRSAENCRYPTION", new DERObjectIdentifier("1.2.840.113549.1.1.4")); 89 algorithms.put("MD5WITHRSA", new DERObjectIdentifier("1.2.840.113549.1.1.4")); 90 algorithms.put("RSAWITHMD5", new DERObjectIdentifier("1.2.840.113549.1.1.4")); 91 algorithms.put("SHA1WITHRSAENCRYPTION", new DERObjectIdentifier("1.2.840.113549.1.1.5")); 92 algorithms.put("SHA1WITHRSA", new DERObjectIdentifier("1.2.840.113549.1.1.5")); 94 // algorithms.put("SHA224WITHRSAENCRYPTION", PKCSObjectIdentifiers.sha224WithRSAEncryption); 95 // algorithms [all...] |
/external/bouncycastle/src/main/java/org/bouncycastle/jce/provider/ |
H A D | JCEDHKeyAgreement.java | 35 private static final Hashtable algorithms = new Hashtable(); field in class:JCEDHKeyAgreement 46 algorithms.put("DES", i64); 47 algorithms.put("DESEDE", i192); 48 algorithms.put("BLOWFISH", i128); 49 algorithms.put("AES", i256); 146 if (algorithms.containsKey(algKey)) 148 Integer length = (Integer)algorithms.get(algKey);
|
/external/bouncycastle/src/main/java/org/bouncycastle/jce/provider/asymmetric/ec/ |
H A D | KeyAgreement.java | 58 private static final Hashtable algorithms = new Hashtable(); field in class:KeyAgreement 68 algorithms.put(NISTObjectIdentifiers.id_aes128_CBC.getId(), i128); 69 algorithms.put(NISTObjectIdentifiers.id_aes192_CBC.getId(), i192); 70 algorithms.put(NISTObjectIdentifiers.id_aes256_CBC.getId(), i256); 71 algorithms.put(NISTObjectIdentifiers.id_aes128_wrap.getId(), i128); 72 algorithms.put(NISTObjectIdentifiers.id_aes192_wrap.getId(), i192); 73 algorithms.put(NISTObjectIdentifiers.id_aes256_wrap.getId(), i256); 74 algorithms.put(PKCSObjectIdentifiers.id_alg_CMS3DESwrap.getId(), i192); 197 // if (!algorithms.containsKey(algorithm)) 202 // int keySize = ((Integer)algorithms [all...] |
/external/openssl/crypto/asn1/ |
H A D | x_algor.c | 70 ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SEQUENCE_OF, 0, algorithms, X509_ALGOR)
|
/external/bouncycastle/src/main/java/org/bouncycastle/openssl/ |
H A D | PEMReader.java | 431 String[] algorithms = {"DSA", "RSA"}; 432 for (int i = 0; i < algorithms.length; i++) 436 KeyFactory keyFact = KeyFactory.getInstance(algorithms[i], provider);
|
/external/dropbear/libtommath/ |
H A D | bn.tex | 88 algorithms used in the library. 255 Source code alone cannot really teach how the algorithms work which is why I also wrote a textbook that accompanies 271 \hline Five modular reduction algorithms & X & & Faster modular exponentiation for a variety of moduli. \\ 441 Certain algorithms require more than one large integer. In these instances it is ideal to initialize all of the mp\_int 1226 algorithms all which can be called from mp\_sqr(). It is ideal to use mp\_sqr over mp\_mul when squaring terms because 1231 Both of the Toom-Cook and Karatsuba multiplication algorithms are faster than the traditional $O(n^2)$ approach that 1232 the Comba and baseline algorithms use. At $O(n^{1.464973})$ and $O(n^{1.584962})$ running times respectively they require 1285 fast reduction algorithms can be written for the limited range. 1287 Note that one of the four optimized reduction algorithms are automatically chosen in the modular exponentiation 1569 and the other two algorithms [all...] |
/external/ipsec-tools/src/racoon/ |
H A D | cfparse.y | 1526 algorithms EOS 1529 algorithms 1538 COMMA algorithms 2294 /* reject suppressed algorithms */
|
/external/dropbear/libtomcrypt/ |
H A D | crypt.tex | 178 This flexibility within the library means it can be used with any combination of primitive algorithms and 363 Certain PRNG algorithms do not require a \textit{prng\_state} argument (sprng for example). The \textit{prng\_state} argument 1975 Similar to the cipher descriptor table you must register your hash algorithms before you can use them. These functions 3058 padding algorithms for encryption and signatures. The standard includes the \textit{v1.5} and \textit{v2.1} algorithms. 3059 To simplify matters a little the v2.1 encryption and signature padding algorithms are called OAEP and PSS respectively. 4767 is made up of two algorithms, Algorithm One and Algorithm Two. Algorithm One is the older fairly limited algorithm which has been implemented 4940 typos can cause algorithms to fail to work as desired. 4946 A neat bonus to the registry system is that you can add external algorithms that are not part of the library without 5193 stored in \textit{tomcrypt\_custom.h} which allow the enabling and disabling of various algorithms [all...] |
/external/iproute2/doc/ |
H A D | ip-cref.tex | 1903 Classic routing algorithms used in the Internet make routing decisions 1906 routing algorithms and their modifications can be found in~\cite{RFC1812}.
|
Completed in 2056 milliseconds