Search references for CRYPTOGRAPHIC PRIMITIVE. Phrases containing CRYPTOGRAPHIC PRIMITIVE
See searches and references containing CRYPTOGRAPHIC PRIMITIVE!CRYPTOGRAPHIC PRIMITIVE
Basic cryptographic algorithm used to build cryptographic protocols
Cryptographic primitives are well-established, low-level cryptographic algorithms that are frequently used to build cryptographic protocols for computer
Cryptographic_primitive
Practice and study of secure communication techniques
work in cryptography concerns cryptographic primitives—algorithms with basic cryptographic properties—and their relationship to other cryptographic problems
Cryptography
Hash function that is suitable for use in cryptography
infeasible: a cryptographic hash is expected to have a collision resistance strength of n/2 bits (lower because of the birthday paradox). Cryptographic hash functions
Cryptographic_hash_function
Ability to easily switch cryptographic primitives
In cryptographic protocol design, cryptographic agility or crypto-agility is the ability to switch between multiple cryptographic primitives. A cryptographically
Cryptographic_agility
Measure of cryptographic strength
In cryptography, security level is a measure of the strength that a cryptographic primitive — such as a cipher or hash function — achieves. Security level
Security_level
Cryptographic primitives that involve lattices
Lattice-based cryptography is the generic term for constructions of cryptographic primitives that involve lattices, either in the construction itself or
Lattice-based_cryptography
Aspect of cryptography
A cryptographic protocol is an abstract or concrete protocol that performs a security-related function and applies cryptographic methods, often as sequences
Cryptographic_protocol
International standard
The Cryptographic Message Syntax (CMS) is the IETF's standard for cryptographically protected messages. It can be used by cryptographic schemes and protocols
Cryptographic_Message_Syntax
Term applied to cryptographic systems that are highly resistant to cryptanalysis
Strong cryptography or cryptographically strong are general terms used to designate the cryptographic algorithms that, when used correctly, provide a very
Strong_cryptography
Type of functions designed for being unsolvable by root-finding algorithms
it suitable for use in cryptography. It is also referred to as a cryptographic random number generator (CRNG). Most cryptographic applications require random
Cryptographically secure pseudorandom number generator
Cryptographically_secure_pseudorandom_number_generator
Input to a cryptographic primitive
In cryptography, an initialization vector (IV) or starting variable is an input to a cryptographic primitive being used to provide the initial state.
Initialization_vector
Cryptography secured against quantum computers
Post-quantum cryptography (PQC), sometimes referred to as quantum-proof, quantum-safe, or quantum-resistant, is the development of cryptographic algorithms
Post-quantum_cryptography
Mathematical scheme for verifying the authenticity of digital documents
underlying cryptographic engineering, and have had the net effect of confusing potential users and specifiers, nearly all of whom are not cryptographically knowledgeable
Digital_signature
Random data used as an additional input to a hash function
(or its version after key stretching) are concatenated and fed to a cryptographic hash function, and the output hash value is then stored with the salt
Salt_(cryptography)
Concept in cryptography
Hash-based cryptography is the generic term for constructions of cryptographic primitives based on the security of hash functions. It is of interest as
Hash-based_cryptography
Cryptographic algorithm
Symmetric-key algorithms are algorithms for cryptography that use the same cryptographic keys for both the encryption of plaintext and the decryption of
Symmetric-key_algorithm
Tables comparing general and technical information for common hashes
Benchmarking of Cryptographic Hashes – measurements of hash function speed on various platforms The ECRYPT Hash Function Website – A wiki for cryptographic hash
Comparison of cryptographic hash functions
Comparison_of_cryptographic_hash_functions
Technical standard
RSA algorithm for public-key cryptography. It defines the mathematical properties of public and private keys, primitive operations for encryption and
PKCS_1
Process of converting plaintext to ciphertext
information through its length. Cryptosystem Cold boot attack Cryptographic primitive Cryptography standards Cyberspace Electronic Security Act (US) Dictionary
Encryption
Adding data to a message prior to encryption to hide its length
modern cryptography because modern ciphers are designed to be secure even when the cryptanalyst chooses the message to encrypt. Most modern cryptographic hash
Padding_(cryptography)
Cryptographic system with public and private keys
Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a
Public-key_cryptography
System that regulates the formation of blocks on a blockchain
work (also written as proof-of-work, and abbreviated PoW) is a form of cryptographic proof in which one party (the prover) proves to others (the verifiers)
Proof_of_work
Used for encoding or decoding ciphertext
stored in a file, which, when processed through a cryptographic algorithm, can encode or decode cryptographic data. Based on the used method, the key can be
Key_(cryptography)
System to verify the source and or authenticity of a message
authenticate information transmitted between them. It is based on using a cryptographic hash or symmetric encryption algorithm. The authentication key is only
Message_authentication
Information used for message authentication and integrity checking
security. MAC algorithms can be constructed from other cryptographic primitives, like cryptographic hash functions (as in the case of HMAC) or from block
Message_authentication_code
Repeated basic operation in a cryptosystem
rounds usually chosen between 8 and 32 (with 64 and even 80 used in cryptographic hashes). For some Feistel-like cipher descriptions, notably that of
Round_(cryptography)
Approach to public-key cryptography
transition suite for national security systems. Since the early 2000s, cryptographic primitives based on bilinear mappings on various elliptic curve groups, such
Elliptic-curve_cryptography
Deleting data by deleting encryption keys
Crypto-shredding or crypto erase (cryptographic erasure) is the practice of rendering encrypted data unusable by deliberately deleting or overwriting
Crypto-shredding
Cryptography based on quantum mechanical phenomena
development of a broader range of quantum cryptographic primitives and protocols that extend quantum cryptography well beyond key distribution. Besides quantum
Quantum_cryptography
Hash functions intended for applications that do not need rigorous security
with other cryptographic primitives); in this case they are described as universal hash functions. Among the typical uses of non-cryptographic hash functions
Non-cryptographic hash function
Non-cryptographic_hash_function
Method to set encryption keys
function is typically used. Such systems almost always use symmetric key cryptographic algorithms. The term PSK is used in Wi-Fi encryption such as Wired Equivalent
Pre-shared_key
In cryptography, the white-box model refers to an extreme attack scenario, in which an adversary has full unrestricted access to a cryptographic implementation
White-box_cryptography
English cryptanalyst (1917–1996)
protocol Cryptographic primitive Cryptanalysis Cryptocurrency Cryptosystem Cryptographic nonce Cryptovirology Hash function Cryptographic hash function Key
Joan_Clarke
Proposed cryptographic primitive
In cryptography, black-box obfuscation was a proposed cryptographic primitive which would allow a computer program to be obfuscated in a way such that
Black-box_obfuscation
Stream cipher algorithm
Philip; McDonald, Cameron; Paddon, Michael; Rose, Gregory G. (2005). Primitive Specification for NLS (Report). ECRYPT Network of Excellence. Retrieved
NLS_(cipher)
Cryptography standard
Public-Key Cryptography Standards (PKCS) #7: Cryptographic Message Syntax Specification Version 1.5, March 1998 RFC 2630 – Cryptographic Message Syntax
PKCS_7
U.S. government cryptographic standard
computer security standard used to approve cryptographic modules. The title is Security Requirements for Cryptographic Modules. Initial publication was on March
FIPS_140-3
Cryptography algorithm
which combined confidentiality and data integrity into a single cryptographic primitive (an encryption algorithm). These combined modes are referred to
Block cipher mode of operation
Block_cipher_mode_of_operation
Computer communications authentication algorithm
of message authentication code (MAC) involving a cryptographic hash function and a secret cryptographic key. As with any MAC, it may be used to simultaneously
HMAC
Hash function phenomenon
("range"), making collisions inevitable ("pigeonhole principle"). For the cryptographic hash functions (CHFs), the output is a compact representative of particular
Hash_collision
Collection of efficiently-computable functions which emulate a random oracle
Pseudorandom functions are vital tools in the construction of cryptographic primitives, especially secure encryption schemes. Pseudorandom functions are
Pseudorandom_function_family
Cryptographic hash function
Shabal is a cryptographic hash function submitted by the France-funded research project Saphir to NIST's international competition on hash functions.
Shabal
Surveillance strategy
the improvement in decryption technology need not be due to a quantum-cryptographic advance; any other form of attack capable of enabling decryption would
Harvest_now,_decrypt_later
Block cipher
256-bits. It is intended to be used in DRM systems. It is among the cryptographic techniques recommended candidate for Japanese government use by CRYPTREC
CLEFIA
Number of bits in a key used by a cryptographic algorithm
In cryptography, key size or key length refers to the number of bits in a key used by a cryptographic algorithm (such as a cipher). Key length defines
Key_size
Cryptographic technique
Visual cryptography is a cryptographic technique which allows visual information (pictures, text, etc.) to be encrypted in such a way that the decrypted
Visual_cryptography
Application of group theory to cryptography
Group-based cryptography is a use of groups to construct cryptographic primitives. A group is a very general algebraic object and most cryptographic schemes
Group-based_cryptography
Method of exchanging cryptographic keys
exchange is a mathematical method of securely generating a symmetric cryptographic key over a public channel. It is named after Whitfield Diffie and Martin
Diffie–Hellman_key_exchange
Fundamental tool in cryptography
In cryptography, the tabula recta (from Latin tabula rēcta) is a square table of alphabets, each row of which is made by shifting the previous one to the
Tabula_recta
Standard in public cryptography
"Cryptoki" (from "cryptographic token interface" and pronounced as "crypto-key"). The API defines most commonly used cryptographic object types (RSA keys
PKCS_11
Subfield of quantum cryptography
including the quantum resources they employ or the underlying cryptographic primitive; these classification schemes are not mutually exclusive but highlight
Quantum_authentication
Cryptographic scheme
A commitment scheme is a cryptographic primitive that allows one to commit to a chosen value (or chosen statement) while keeping it hidden to others,
Commitment_scheme
Type of symmetric key cipher
seed value using digital shift registers. The seed value serves as the cryptographic key for decrypting the ciphertext stream. Stream ciphers represent a
Stream_cipher
Type of substitution cipher
letters can be assigned to the grid. The Pigpen cipher offers little cryptographic security. It differentiates itself from other simple monoalphabetic
Pigpen_cipher
Function that derives secret keys from a secret value
stretching. High-throughput (keyed) cryptographic hash functions are inappropriate for generating cryptographic keys from low-entropy secrets like passwords
Key_derivation_function
Quantum-safe key encapsulation mechanism
public selection process for a first standard for quantum-safe cryptographic primitives (NISTPQC). It was the first key encapsulation mechanism that has
ML-KEM
Encryption method
operation – Cryptography algorithm CWC mode – Authenticated encryption mode for block ciphers Signcryption – Asymmetric cryptographic primitive Sophie Germain
Authenticated_encryption
Authenticated encryption with associated data algorithm
(February 2017). Using ChaCha20-Poly1305 Authenticated Encryption in the Cryptographic Message Syntax (CMS). Internet Engineering Task Force. doi:10.17487/RFC8103
ChaCha20-Poly1305
Encrypted information
Gold-Bug" Beale ciphers Kryptos Zodiac Killer ciphers Bibliography of cryptography Cryptographic hash function Frequency analysis RED/BLACK concept Berti, Hansche
Ciphertext
Type of code
Greece Straddling checkerboard – Cryptographic cipher device Tap code – Encoding for text messages Topics in cryptography "Polybius • Histories — Book 10"
Polybius_square
Set of cryptographic hash functions
structure of SHA-1 and SHA-2. SHA-3 is a subset of the broader cryptographic primitive family Keccak (/ˈkɛtʃæk/ or /ˈkɛtʃɑːk/), designed by Guido Bertoni
SHA-3
Method of encryption
Retrieved 7 January 2021. Savard, John. "Methods of Transposition". A Cryptographic Compendium. Retrieved 27 June 2023. jdege (11 November 2014). "A simple
Transposition_cipher
Key derivation function
process many times to produce a derived key, which can then be used as a cryptographic key in subsequent operations. The added computational work makes password
PBKDF2
Function computed by two parties that emulates a random oracle
An oblivious pseudorandom function (OPRF) is a cryptographic function, similar to a keyed-hash function, but with the distinction that in an OPRF two
Oblivious pseudorandom function
Oblivious_pseudorandom_function
Simple and widely known encryption technique
of the simplest and most widely known encryption techniques used in cryptography. It is a type of substitution cipher in which each letter in the plaintext
Caesar_cipher
Theory of cryptography
uses. They can be used to model or implement many cryptographic primitives, including cryptographic hashes, message authentication codes, mask generation
Sponge_function
Transfer of cryptography technology from one country to another
The export of cryptography is the transfer from one country to another of devices and technology related to cryptography. In the early days of the Cold
Export_of_cryptography
Class of functions in cryptography
Unpredictable permutations may be used as a cryptographic primitive, a building block for cryptographic systems with more complex properties. An adversary
Pseudorandom_permutation
Cryptographic secret, not public in contrast to salt
In cryptography, a pepper is a secret added to an input such as a password during hashing with a cryptographic hash function. This value differs from
Pepper_(cryptography)
Authenticated encryption mode for block ciphers
In cryptography, Galois/Counter Mode (GCM) is a mode of operation for symmetric-key cryptographic block ciphers. The proposal was first published in 2007
Galois/Counter_Mode
Cryptographic algorithm
Lightweight Cryptographic Systems), a benchmarking framework for evaluation of software implementations of lightweight cryptographic primitives. PRESENT
PRESENT
"Modules In Process List - Cryptographic Module Validation Program | CSRC | CSRC". CSRC | NIST. Retrieved 2024-11-22. "Cryptographic Module Validation Program
Comparison of cryptography libraries
Comparison_of_cryptography_libraries
Type of cipher
can be used to build other cryptographic primitives, such as those below. For these other primitives to be cryptographically secure, care has to be taken
Block_cipher
Study of analyzing information systems in order to discover their hidden aspects
is used to breach cryptographic security systems and gain access to the contents of encrypted messages, even if the cryptographic key is unknown. In
Cryptanalysis
Cryptography practises of the USA's National Security Agency
classified or controlled cryptographic item for classified or sensitive U.S. government information, including cryptographic equipment, assembly or component
NSA_cryptography
Type of polyalphabetic substitution cipher
In classical cryptography, the running key cipher is a type of polyalphabetic substitution cipher in which a text, typically from a book, is used to provide
Running_key_cipher
Digital signature scheme
to be hard. Typically a Schnorr group is used. All users agree on a cryptographic hash function H : { 0 , 1 } ∗ → Z / q Z {\displaystyle H:\{0,1\}^{*}\rightarrow
Schnorr_signature
Suite of cryptographic algorithms needed to implement a particular security service
In cryptography, a cryptosystem is a suite of cryptographic algorithms needed to implement a particular security service, such as confidentiality (encryption)
Cryptosystem
Information retrieval using cryptography
privacy for both parties is already non-trivial. Collision-resistant cryptographic hash functions are implied by any one-round computational PIR scheme
Private_information_retrieval
Software inventory list
discovery and representation of cryptographic use in the CycloneDX CBOM schema. A CBOM inventories cryptographic primitives and materials—such as encryption
Cryptographic bill of materials
Cryptographic_bill_of_materials
Data used to detect errors in other data
suitable checksum. Checksums are used as cryptographic primitives in larger authentication algorithms. For cryptographic systems with these two specific design
Checksum
Encryption tool used to perform a transposition cipher
(middle of the 3rd century BC) that a clear indication of its use as a cryptographic device appeared. A description of how it operated is not known from
Scytale
Classic polyalphabet encryption system
Pipher, Jill; Silverman, Joseph (2014). An Introduction to Mathematical Cryptography. Springer. p. 288. ISBN 9781493917112. "Autokey Calculator". Asecuritysite
Autokey_cipher
Cryptographic attack
the hardware implementation, and even more so, the cryptographic system in use. Since cryptographic security should never depend on the obscurity of either
Timing_attack
Algorithm for encrypting and decrypting information
use one or two keys. The Caesar Cipher is one of the earliest known cryptographic systems. Julius Caesar used a cipher that shifts the letters in the
Cipher
Key derivation function based on an HMAC
optional, non-secret, random or pseudorandom salt (r); and generates a cryptographic key called the PRK ("pseudorandom key"). HKDF-Extract acts as a "randomness
HKDF
Cryptography primitive
Panama is a cryptographic primitive which can be used both as a hash function and a stream cipher, but its hash function mode of operation has been broken
Panama_(cryptography)
Simple encryption method
ROT13 a buffer with the command: ggg?G. Without using specific built-in cryptographic libraries or advanced string methods, a ROT13 function can be implemented
ROT13
Augmented password-authenticated key exchange protocol
interesting properties of the protocol is that even if one or two of the cryptographic primitives it uses are attacked, it is still secure. The SRP protocol has
Secure Remote Password protocol
Secure_Remote_Password_protocol
Cryptographic hash function
RIPEMD (RIPE Message Digest) is a family of cryptographic hash functions developed in 1992 (the original RIPEMD) and 1996 (other variants). There are
RIPEMD
Projected date when quantum computers could break modern encryption
large-scale cryptographic transition. As algorithms, standards, and threats continue to evolve, organizations are increasingly investing in cryptographic management
Quantum_threat
System that can issue, distribute and verify digital certificates
actually interacting. Assorted cryptographic protocols were invented and analyzed within which the new cryptographic primitives could be effectively used.
Public_key_infrastructure
Cryptographic tool
A mask generation function (MGF) is a cryptographic primitive similar to a cryptographic hash function except that while a hash function's output has a
Mask_generation_function
Cipher method
July 2, 2010 Langen's entry for Chaocipher in his personal memoirs "Cryptography - Confidential" "The Tragic Story of J.F. Byrne". PurpleHunt.com. 1998
Chaocipher
Manually operated symmetric encryption cipher
In the history of cryptography, the Nihilist cipher is a manually operated symmetric encryption cipher, originally used by Russian Nihilists in the 1880s
Nihilist_cipher
Cryptographic hash function
Lane is a cryptographic hash function submitted to the NIST hash function competition; it was designed by Sebastiaan Indesteege with contributions by
Lane_(hash_function)
Cryptographic primitive
functions are for instance used in the Merkle–Damgård construction inside cryptographic hash functions. One-way compression functions are often built from block
One-way_compression_function
Controlled Cryptographic Item (CCI) is a U.S. National Security Agency term for secure telecommunications or information handling equipment, an associated
Controlled_Cryptographic_Item
Function used in computer cryptography
public-key cryptography, quantum digital signatures, quantum money, and other quantum cryptographic protocols. One-way compression function Cryptographic hash
One-way_function
Method for dividing a secret among multiple parties
maintaining enough security to be considered as secure as other common cryptographic primitives. For example, they might allow secrets to be protected by shares
Secret_sharing
travel, tourism, insurance
CRYPTOGRAPHIC PRIMITIVE
CRYPTOGRAPHIC PRIMITIVE
Girl/Female
American, Australian, Biblical, British, Chinese, Christian, Danish, English, Finnish, French, German, Gothic, Italian, Latin, Portuguese, Swedish
Ancient; Primitive; Venerable
Boy/Male
Arabic, Hindu, Indian, Muslim, Sindhi
Ancient; Antique; Old; Primitive; Without Any Beginning or End
Girl/Female
American, Australian, Chinese, Finnish, French, Latin, Portuguese, Swedish
Ancient; Primitive; Venerable
Girl/Female
Danish, Finnish, French, German, Latin, Swedish
Ancient; Primitive; Venerable
Girl/Female
German, Latin
Archaic; Ancient; Old; Primitive
Surname or Lastname
English
English : probably for the most part a topographic name for someone who lived near the trunk or stump of a large tree, Middle English stocke (Old English stocc). In some cases the reference may be to a primitive foot-bridge over a stream consisting of a felled tree trunk. Some early examples without prepositions may point to a nickname for a stout, stocky man or a metonymic occupational name for a keeper of punishment stocks.German : from Middle German stoc ‘tree’, ‘tree stump’, hence a topographic name equivalent to 1, but sometimes also a nickname for an impolite or obstinate person.Jewish (Ashkenazic) : ornamental name from German Stock ‘stick’, ‘pole’.
CRYPTOGRAPHIC PRIMITIVE
CRYPTOGRAPHIC PRIMITIVE
CRYPTOGRAPHIC PRIMITIVE
CRYPTOGRAPHIC PRIMITIVE
CRYPTOGRAPHIC PRIMITIVE
CRYPTOGRAPHIC PRIMITIVE
CRYPTOGRAPHIC PRIMITIVE
a.
Relating to glyptography, or the art of engraving on precious stones.
a.
Original; primary; radical; not derived; as, primitive verb in grammar.
a.
Pertaining to cryptography; cryptographical.
n.
One of any savage race that dwells in caves, instead of constructing dwellings; a cave dweller. Most of the primitive races of man were troglodytes.
n.
Same as Cryptographer.
adv.
Those which have the value of independent words, inasmuch as the simple words are either not used at all, or are rarely, or at least much less frequently, used; as, unavoidable, unconscionable, undeniable, unspeakable, unprecedented, unruly, and the like; or inasmuch as they are used in a different sense from the usual meaning of the primitive, or especially in one of the significations of the latter; as, unaccountable, unalloyed, unbelieving, unpretending, unreserved, and the like; or inasmuch as they are so frequently and familiarly used that they are hardly felt to be of negative origin; as, uncertain, uneven, and the like.
n.
One who writes in cipher, or secret characters.
n.
The quality or state of being primitive; conformity to primitive style or practice.
n.
Among the primitive Christians, the living on a diet of dry food in Lent and on other fasts.
n.
The act or art of writing in secret characters; also, secret characters, or cipher.
n.
A cipher writing. Same as Cryptograph.
a.
Of or pertaining to a former time; old-fashioned; characterized by simplicity; as, a primitive style of dress.
n.
One skilled in steganography; a cryptographer.
n.
The art of writing in cipher, or in characters which are not intelligible except to persons who have the key; cryptography.
n.
The ancient language of the Hindoos, long since obsolete in vernacular use, but preserved to the present day as the literary and sacred dialect of India. It is nearly allied to the Persian, and to the principal languages of Europe, classical and modern, and by its more perfect preservation of the roots and forms of the primitive language from which they are all descended, is a most important assistance in determining their history and relations. Cf. Prakrit, and Veda.
a.
Relating to cryptography; written in secret characters or in cipher, or with sympathetic ink.
n.
A primitive form of speech; one of the earliest terms employed in language; a word from which other words are formed; a radix, or radical.
n.
Cipher; something written in cipher.
a.
Alt. of Cryptographical
a.
Of or pertaining to the beginning or origin, or to early times; original; primordial; primeval; first; as, primitive innocence; the primitive church.
travel, tourism, insurance