Blog page 194



                                               

Sephardic yeshivas

                                               

Reformed church seminaries and theological colleges

                                               

Seminaries and theological colleges in Hong Kong

                                               

Pacific Unitarian School for the Ministry

                                               

Starr King School for the Ministry alumni

                                               

Former Lasallian educational institutions

                                               

Orthodox yeshivas by city

                                               

Ellen DeVoe

Ellen DeVoe is a Professor in the Clinical Practice Department at the Boston University School of Social Work and Founding Director of the Trauma Certificate Program. From 2013-2019, DeVoe was the Director of the Interdisciplinary PhD Program in ...

                                               

OpenMAX IL

                                               

OptimFROG

OptimFROG is a proprietary lossless audio data compression codec developed by Florin Ghido. OptimFROG is optimized for very high compression ratios at the expense of encoding and decoding speed.

                                               

Windows Media Audio 9 Lossless

                                               

Benaloh cryptosystem

The Benaloh Cryptosystem is an extension of the Goldwasser-Micali cryptosystem created in 1994 by Josh Benaloh. The main improvement of the Benaloh Cryptosystem over GM is that longer blocks of data can be encrypted at once, whereas in GM each bi ...

                                               

Blum–Goldwasser cryptosystem

The Blum–Goldwasser cryptosystem is an asymmetric key encryption algorithm proposed by Manuel Blum and Shafi Goldwasser in 1984. Blum–Goldwasser is a probabilistic, semantically secure cryptosystem with a constant-size ciphertext expansion. The e ...

                                               

Cayley–Purser algorithm

The Cayley–Purser algorithm was a public-key cryptography algorithm published in early 1999 by 16-year-old Irishwoman Sarah Flannery, based on an unpublished work by Michael Purser, founder of Baltimore Technologies, a Dublin data security compan ...

                                               

Cramer–Shoup cryptosystem

The Cramer–Shoup system is an asymmetric key encryption algorithm, and was the first efficient scheme proven to be secure against adaptive chosen ciphertext attack using standard cryptographic assumptions. Its security is based on the computation ...

                                               

Damgård–Jurik cryptosystem

The Damgård–Jurik cryptosystem is a generalization of the Paillier cryptosystem. It uses computations modulo n s + 1 {\displaystyle n^{s+1}} where n {\displaystyle n} is an RSA modulus and s {\displaystyle s} a natural number. Pailliers scheme is ...

                                               

Efficient Probabilistic Public-Key Encryption Scheme

EPOC is a probabilistic public-key encryption scheme. EPOC was developed in 1999 by T. Okamoto, S. Uchiyama and E. Fujisaki of NTT Labs in Japan. It is based on the random oracle model, in which a primitive public-key encryption function is conve ...

                                               

ElGamal encryption

In cryptography, the ElGamal encryption system is an asymmetric key encryption algorithm for public-key cryptography which is based on the Diffie–Hellman key exchange. It was described by Taher Elgamal in 1985. ElGamal encryption is used in the f ...

                                               

Goldwasser–Micali cryptosystem

The Goldwasser–Micali cryptosystem is an asymmetric key encryption algorithm developed by Shafi Goldwasser and Silvio Micali in 1982. GM has the distinction of being the first probabilistic public-key encryption scheme which is provably secure un ...

                                               

Naccache–Stern cryptosystem

The Naccache–Stern cryptosystem is a homomorphic public-key cryptosystem whose security rests on the higher residuosity problem. The Naccache–Stern cryptosystem was discovered by David Naccache and Jacques Stern in 1998.

                                               

Naccache–Stern knapsack cryptosystem

The Naccache–Stern Knapsack Cryptosystem is an atypical public-key cryptosystem developed by David Naccache and Jacques Stern in 1997. This cryptosystem is deterministic, and hence is not semantically secure. While unbroken to date, this system a ...

                                               

Okamoto–Uchiyama cryptosystem

The Okamoto–Uchiyama cryptosystem is a public key cryptosystem proposed in 1998 by Tatsuaki Okamoto and Shigenori Uchiyama. The system works in the multiplicative group of integers modulo n, ∗ {\displaystyle ^{*}}, where n is of the form p 2 q an ...

                                               

Paillier cryptosystem

The Paillier cryptosystem, invented by and named after Pascal Paillier in 1999, is a probabilistic asymmetric algorithm for public key cryptography. The problem of computing n -th residue classes is believed to be computationally difficult. The d ...

                                               

Rabin cryptosystem

The Rabin cryptosystem is an asymmetric cryptographic technique, whose security, like that of RSA, is related to the difficulty of integer factorization. However the Rabin cryptosystem has the advantage that it has been mathematically proven to b ...

                                               

Schmidt-Samoa cryptosystem

The Schmidt-Samoa cryptosystem is an asymmetric cryptographic technique, whose security, like Rabin depends on the difficulty of integer factorization. Unlike Rabin this algorithm does not produce an ambiguity in the decryption at a cost of encry ...

                                               

3-Way

In cryptography, 3-Way is a block cipher designed in 1994 by Joan Daemen. It is closely related to BaseKing; the two are variants of the same general cipher technique. 3-Way has a block size of 96 bits, notably not a power of two such as the more ...

                                               

Akelarre (cipher)

Akelarre is a block cipher proposed in 1996, combining the basic design of IDEA with ideas from RC5. It was shown to be susceptible to a ciphertext-only attack in 1997. Akelarre is a 128-bit block cipher with a variable key-length which must be s ...

                                               

BaseKing

In cryptography, BaseKing is a block cipher designed in 1994 by Joan Daemen. It is very closely related to 3-Way, as the two are variants of the same general cipher technique. BaseKing has a block size of 192 bits–twice as long as 3-Way, and nota ...

                                               

BassOmatic

In cryptography, BassOmatic is the symmetric-key cipher designed by Phil Zimmermann as part of his email encryption software PGP. Comments in the source code indicate that he had been designing the cipher since as early as 1988, but it was not pu ...

                                               

Cellular Message Encryption Algorithm

In cryptography, the Cellular Message Encryption Algorithm is a block cipher which was used for securing mobile phones in the United States. CMEA is one of four cryptographic primitives specified in a Telecommunications Industry Association stand ...

                                               

Churning (cipher)

Churning is an encryption function used to scramble downstream user data of the ATM passive optical network system defined by the ITU G.983.1 standard. The standard states that churning "offers a low level of protection for data confidentiality". ...

                                               

COCONUT98

In cryptography, COCONUT98 is a block cipher designed by Serge Vaudenay in 1998. It was one of the first concrete applications of Vaudenays decorrelation theory, designed to be provably secure against differential cryptanalysis, linear cryptanaly ...

                                               

Cryptomeria cipher

The Cryptomeria cipher, also called C2, is a proprietary block cipher defined and licensed by the 4C Entity. It is the successor to CSS algorithm and was designed for the CPRM/CPPM digital rights management scheme which are used by DRM-restricted ...

                                               

FEAL

In cryptography, FEAL is a block cipher proposed as an alternative to the Data Encryption Standard, and designed to be much faster in software. The Feistel based algorithm was first published in 1987 by Akihiro Shimizu and Shoji Miyaguchi from NT ...

                                               

International Data Encryption Algorithm

In cryptography, the International Data Encryption Algorithm, originally called Improved Proposed Encryption Standard, is a symmetric-key block cipher designed by James Massey of ETH Zurich and Xuejia Lai and was first described in 1991. The algo ...

                                               

KN-Cipher

In cryptography, KN-Cipher is a block cipher created by Kaisa Nyberg and Lars Knudsen in 1995. One of the first ciphers designed to be provably secure against ordinary differential cryptanalysis, KN-Cipher was later broken using higher order diff ...

                                               

LOKI

In cryptography, LOKI89 and LOKI91 are symmetric-key block ciphers designed as possible replacements for the Data Encryption Standard. The ciphers were developed based on a body of work analysing DES, and are very similar to DES in structure. The ...

                                               

LOKI97

In cryptography, LOKI97 is a block cipher which was a candidate in the Advanced Encryption Standard competition. It is a member of the LOKI family of ciphers, with earlier instances being LOKI89 and LOKI91. LOKI97 was designed by Lawrie Brown, as ...

                                               

Madryga

In cryptography, Madryga is a block cipher published in 1984 by W. E. Madryga. It was designed to be easy and efficient for implementation in software. Serious weaknesses have since been found in the algorithm, but it was one of the first encrypt ...

                                               

NewDES

In cryptography, NewDES is a symmetric key block cipher. It was created in 1984–1985 by Robert Scott as a potential DES replacement. Despite its name, it is not derived from DES and has quite a different structure. Its intended niche as a DES rep ...

                                               

Q (cipher)

In cryptography, Q is a block cipher invented by Leslie McBride. It was submitted to the NESSIE project, but was not selected. The algorithm uses a key size of 128, 192, or 256 bits. It operates on blocks of 128 bits using a substitution-permutat ...

                                               

RC2

In cryptography, RC2 is a symmetric-key block cipher designed by Ron Rivest in 1987. "RC" stands for "Rons Code" or "Rivest Cipher"; other ciphers designed by Rivest include RC4, RC5, and RC6. The development of RC2 was sponsored by Lotus, who we ...

                                               

RC5

In cryptography, RC5 is a symmetric-key block cipher notable for its simplicity. Designed by Ronald Rivest in 1994, RC stands for "Rivest Cipher", or alternatively, "Rons Code". The Advanced Encryption Standard candidate RC6 was based on RC5.

                                               

XXTEA

In cryptography, Corrected Block TEA is a block cipher designed to correct weaknesses in the original Block TEA. XXTEA is vulnerable to a chosen-plaintext attack requiring 2 59 queries and negligible work. See cryptanalysis below. The ciphers des ...

                                               

A5/2

A5/2 is a stream cipher used to provide voice privacy in the GSM cellular telephone protocol. It was used for export instead of the relatively stronger A5/1. It is one of seven A5 ciphering algorithms which have been defined for GSM use. The ciph ...

                                               

CCM mode

CCM mode is a mode of operation for cryptographic block ciphers. It is an authenticated encryption algorithm designed to provide both authentication and confidentiality. CCM mode is only defined for block ciphers with a block length of 128 bits. ...

                                               

EAX mode

EAX mode is a mode of operation for cryptographic block ciphers. It is an Authenticated Encryption with Associated Data algorithm designed to simultaneously provide both authentication and privacy of the message with a two-pass scheme, one pass f ...

                                               

IAPM (mode)

Integrity Aware Parallelizable Mode is a mode of operation for cryptographic block ciphers. As its name implies, it allows for a parallel mode of operation for higher throughput.

                                               

OCB mode

OCB mode is an authenticated encryption mode of operation for cryptographic block ciphers. OCB mode was designed by Phillip Rogaway, who credits Mihir Bellare, John Black, and Ted Krovetz with assistance and comments on the designs. It is based o ...

                                               

Block ciphers

Free and no ads
no need to download or install

Pino - logical board game which is based on tactics and strategy. In general this is a remix of chess, checkers and corners. The game develops imagination, concentration, teaches how to solve tasks, plan their own actions and of course to think logically. It does not matter how much pieces you have, the main thing is how they are placement!

online intellectual game →