AI & ChatGPT searches , social queries for CRYPTOGRAPHIC LOG-ON
Search references for CRYPTOGRAPHIC LOG-ON. Phrases containing CRYPTOGRAPHIC LOG-ON
See searches and references containing CRYPTOGRAPHIC LOG-ON!
Search references for CRYPTOGRAPHIC LOG-ON. Phrases containing CRYPTOGRAPHIC LOG-ON
See searches and references containing CRYPTOGRAPHIC LOG-ON!CRYPTOGRAPHIC LOG-ON
Cryptographic log-on (CLO) is a process that uses Common Access Cards (CAC) and embedded Public Key Infrastructure (PKI) certificates to authenticate a
Cryptographic_log_on
Problem of inverting exponentiation in groups
computing them in general. Several cryptographic systems, including Diffie–Hellman and ElGamal, base their security on the hardness assumption that the
Discrete_logarithm
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
Practice and study of secure communication techniques
solvability or insolvability discrete log problem. As well as being aware of cryptographic history, cryptographic algorithm and system designers must also
Cryptography
Approach to public-key cryptography
Galbraith, S. D.; Smart, N. P. (1999). "A Cryptographic Application of Weil Descent". A cryptographic application of the Weil descent. Lecture Notes
Elliptic-curve_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
Hypothesis in computational complexity theory
importance in cryptography. A major goal in cryptography is to create cryptographic primitives with provable security. In some cases, cryptographic protocols
Computational hardness assumption
Computational_hardness_assumption
Process of converting plaintext to ciphertext
types of keys in cryptographic systems are symmetric-key and public-key (also known as asymmetric-key). Many complex cryptographic algorithms often use
Encryption
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
Algorithm for solving the discrete logarithm problem
discrete log problem is of fundamental importance to the area of public key cryptography. Many of the most commonly used cryptography systems are based on the
Baby-step_giant-step
Mathematical object
schemes are among the most important cryptographic primitives. They can be obtained by using the one-way functions based on the worst-case hardness of lattice
Ideal_lattice
gov. Archived from the original on 2021-10-23. "Cryptographic Module Validation Program | CSRC". "Search - Cryptographic Module Validation Program". CSRC
Comparison of cryptography libraries
Comparison_of_cryptography_libraries
to timestamp documents through cryptographic chaining. (This concept anticipates the modern notion of a cryptographic blockchain.) Benaloh and de Mare
Accumulator_(cryptography)
Optimization problem in computer science
of cryptographic algorithms. In addition, some lattice problems which are worst-case hard can be used as a basis for extremely secure cryptographic schemes
Lattice_problem
Mathematical function, inverse of an exponential function
formula: log b x = log 10 x log 10 b = log e x log e b . {\displaystyle \log _{b}x={\frac {\log _{10}x}{\log _{10}b}}={\frac {\log _{e}x}{\log _{e}b}}
Logarithm
Adding data to a message prior to encryption to hide its length
benefit of making some kinds of cryptanalysis more difficult. Most modern cryptographic hash functions process messages in fixed-length blocks; all but the
Padding_(cryptography)
Method of exchanging cryptographic keys
exchange is a mathematical method of securely generating a symmetric cryptographic key over a public channel and was one of the first protocols as conceived
Diffie–Hellman_key_exchange
Encryption Decryption History of cryptography Alan Turing Cipher Cryptanalysis Cryptographic primitive Cryptographic Service Provider HMAC HMAC-based
List of cybersecurity information technologies
List_of_cybersecurity_information_technologies
Scientific study of digital information
proved were possible. A third class of information theory codes are cryptographic algorithms (both codes and ciphers). Concepts, methods and results from
Information_theory
Physical computing device
The functions of an HSM are: onboard secure cryptographic key generation, onboard secure cryptographic key storage, at least for the top level and most
Hardware_security_module
Method for generating passphrases using dice
Diceware is a method for creating passphrases, passwords, and other cryptographic variables using ordinary dice as a hardware random number generator
Diceware
Quantum algorithm for integer factorization
{\displaystyle O\!\left((\log N)^{2}(\log \log N)(\log \log \log N)\right)} using fast multiplication, or even O ( ( log N ) 2 ( log log N ) ) {\displaystyle
Shor's_algorithm
Average uncertainty in variable's states
is H ( X ) := − ∑ x ∈ X p ( x ) log p ( x ) , {\displaystyle \mathrm {H} (X):=-\sum _{x\in {\mathcal {X}}}p(x)\log p(x),} where Σ {\displaystyle \Sigma
Entropy_(information_theory)
Information retrieval using cryptography
theoretic) PIR can be done with n O ( log log k k log k ) {\displaystyle n^{O\left({\frac {\log \log k}{k\log k}}\right)}} communication[citation
Private_information_retrieval
Mathematical function
distinguishing cryptographically strong pseudorandom bits from truly random bits) is negligible in terms of the input x {\displaystyle x} = cryptographic key length
Negligible_function
IT program of the US Navy
April 2006, users began to log on with Common Access Cards (CACs), a smartcard-based logon system called the Cryptographic Log On (CLO). In October 2008,
Navy_Marine_Corps_Intranet
Computer science concept
non-cryptographic hashes suffices to survive all non-malicious Byzantine failures (with high probability). Malicious attacks require cryptographic primitives
State_machine_replication
Device used to gain access to restricted resource
clock, either from a one-time pad or cryptographic algorithm. Challenge–response token Using public key cryptography, it is possible to prove possession
Security_token
Software framework of Linux kernel
or cryptographic verification, also used with LUKS dm-log-writes – mapping target that uses two devices, passing through the first device and logging the
Device_mapper
Formal concept in theoretical computer science and cryptography
of stronger variants of cryptographic pseudorandom generators. Katz, Jonathan (2014-11-06). Introduction to modern cryptography. Lindell, Yehuda (Second ed
Pseudorandom_generator
One-time password system
of the basic patents on public-key cryptography and the widespread use of laptop computers running SSH and other cryptographic protocols that can secure
S/KEY
Cryptographic hash function
In cryptography, Very Smooth Hash (VSH) is a provably secure cryptographic hash function invented in 2005 by Scott Contini, Arjen Lenstra, and Ron Steinfeld
Very_smooth_hash
Form of message tampering
management – how to manage cryptographic keys, including generation, exchange and storage. Key-agreement protocol – a cryptographic protocol for establishing
Man-in-the-middle_attack
Function that derives secret keys from a secret value
In cryptography, a key derivation function (KDF) is a cryptographic algorithm that derives one or more secret keys from a secret value such as a master
Key_derivation_function
Authentication method linking user identity to a physical SIM card
binding that uses SIM identifiers such as IMSI or ICCID or SIM-resident cryptographic capabilities to provide non-replicable proof of device possession. It
SIM_binding
Multiparty cryptographic process
generation for discrete-log based cryptosystems". Proceedings of the 17th International Conference on Theory and Application of Cryptographic Techniques. EUROCRYPT'99
Distributed_key_generation
Computer password or cryptographic key
In cryptography, a shared secret is a piece of data, known only to the parties involved, in a secure communication. This usually refers to the key of a
Shared_secret
Event in cryptography
In cryptography, a key ceremony is a ceremony held to generate or use a cryptographic key. A public example is the signing of the DNS root zone for DNSSEC
Key_ceremony
described efficient constructions for various cryptographic primitives in private key as well as public-key cryptography. Their result is the construction of an
Naor–Reingold pseudorandom function
Naor–Reingold_pseudorandom_function
cryptography and only one expensive public-key operation per cipher suite. A third technical challenge is representing the public-key cryptographic material
PURB_(cryptography)
Property of computer data storage
logged by the program, and on retrieval the program must combine the pieces of data found in this log file. Blockchains add cryptography to the logs so
Append-only
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
Secure network protocol suite
Protocol (ISAKMP) RFC 4307: Cryptographic Algorithms for Use in the Internet Key Exchange Version 2 (IKEv2) RFC 4308: Cryptographic Suites for IPsec RFC 4309:
IPsec
64-bit operating system for IBM mainframes
reporting the cryptographic security attributes of IPv4 and IPv6 application traffic that is protected using the TLS/SSL, SSH and IPSec cryptographic network
Z/OS
Consensus algorithm
yielding only crash fault tolerance. However there exist variants that use cryptographic signatures to achieve Byzantine fault tolerance. Raft achieves consensus
Raft_(algorithm)
Hyperelliptic curve cryptography is similar to elliptic curve cryptography (ECC) insofar as the Jacobian of a hyperelliptic curve is an abelian group in
Hyperelliptic curve cryptography
Hyperelliptic_curve_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
Component of Secure Shell
remote computers over insecure networks, through the use of various cryptographic techniques. The ssh-keygen utility is used to generate, manage, and
Ssh-keygen
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
data (typically cryptographic problems) can use randomization to ensure that privacy. In fact, the only provably secure cryptographic system (the one-time
Random_self-reducibility
Communication protocol for cryptographic keys
of cryptographic keys on a key management server. This facilitates data encryption by simplifying encryption key management. Keys may be created on a server
Key Management Interoperability Protocol
Key_Management_Interoperability_Protocol
On finding a repeating loop in a sequence
logarithm problem. In cryptographic applications, the ability to find two distinct values xμ−1 and xλ+μ−1 mapped by some cryptographic function ƒ to the same
Cycle_detection
Decomposition of a number into a product
to perform the factorization on any classical computer increases drastically. Many cryptographic protocols are based on the presumed difficulty of factoring
Integer_factorization
Privacy in blockchain systems
characteristics vary depending on system design and use case. Many blockchain systems represent participants using cryptographic addresses rather than real-world
Blockchain_privacy
Computational concept
needed] Randomness extractors are used widely in cryptographic applications, whereby a cryptographic hash function is applied to a high-entropy, but non-uniform
Randomness_extractor
Bob, agree on a group G {\displaystyle G} with generator g {\displaystyle g} of prime order q {\displaystyle q} in which the discrete log problem is hard
YAK_(cryptography)
Security software
Complete integrity check uses cryptographic checksums of files to detect modifications, can find rogue SUID executables anywhere on a disk, and Centralized
Samhain_(software)
Assumption used in cryptographic systems
cyclic groups. It is used as the basis to prove the security of many cryptographic protocols, most notably the ElGamal and Cramer–Shoup cryptosystems.
Decisional Diffie–Hellman assumption
Decisional_Diffie–Hellman_assumption
Controversial pseudorandom number generator
CONSEQUENCES OF CORRUPTING A CRYPTOGRAPHIC STANDARDIZATION PROCESS Kostsyuk and Landau article about international cryptographic community's largely continued
Dual_EC_DRBG
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
Special-purpose algorithm for factoring integers
sometimes construed as "safe for cryptographic purposes", but they might be unsafe — in current recommendations for cryptographic strong primes (e.g. ANSI X9
Pollard's_p_−_1_algorithm
Tor onion service of Facebook
address provides a way to access Facebook through Tor without losing the cryptographic protections provided by the Tor cloud. ... it provides end-to-end communication
Facebook_onion_address
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
time instead of to individuals or organizations, and the blocks of cryptographic data are chained through time. In a transient-key system, private keys
Transient-key_cryptography
Digital signature scheme
public-key cryptography, Edwards-curve Digital Signature Algorithm (EdDSA) is a digital signature scheme using a variant of Schnorr signature based on twisted
EdDSA
Free and open-source disk encryption utility
VeraCrypt includes optimizations to the original cryptographic hash functions and ciphers, which boost performance on modern central processing units. VeraCrypt
VeraCrypt
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
Public_key_infrastructure
Award
recognized one or more individuals for theoretical advancements to cryptographic methods with a practical impact, while the other has recognized one
Levchin_Prize
Algorithm for fast exponentiation
∑ i = 0 O ( log n ) ( 2 i O ( log x ) ) k = O ( ( n log x ) k ) . {\displaystyle \sum \limits _{i=0}^{O(\log n)}{\big (}2^{i}O(\log x){\big )}^{k}=O{\big
Exponentiation_by_squaring
Israeli computer scientist
he was unable to provide the required cryptographic key. Yung research covers primarily the area of cryptography and its applications to information security
Moti_Yung
Cryptographic network protocol
The Secure Shell Protocol (SSH Protocol) is a cryptographic network protocol for operating network services securely over an unsecured network. Its most
Secure_Shell
Probabilistic algorithm for computing discrete logarithms
their cryptographic significance, by Andrew Odlyzko Discrete Logarithm Problem, by Chris Studholme, including the June 21, 2002 paper "The Discrete Log Problem"
Index_calculus_algorithm
Resistance of a password to being guessed
this risk is to store only a cryptographic hash of each password instead of the password itself. Standard cryptographic hashes, such as the Secure Hash
Password_strength
Text used for user authentication to prove identity
hardware on which the attack is running and the strength of the algorithm used to create the hash. Passwords that are used to generate cryptographic keys
Password
Proposed web cryptography standard
HS256 indicates that this token is signed using HMAC-SHA256. Typical cryptographic algorithms used are HMAC with SHA-256 (HS256) and RSA signature with
JSON_Web_Token
Family of cryptographic hash functions
In cryptography, the fast syndrome-based hash functions (FSB) are a family of cryptographic hash functions introduced in 2003 by Daniel Augot, Matthieu
Fast_syndrome-based_hash
Information-theoretic measure
defined as follows: H ( p , q ) = − E p [ log q ] , {\displaystyle H(p,q)=-\operatorname {E} _{p}[\log q],} where E p [ ⋅ ] {\displaystyle \operatorname
Cross-entropy
solve the DDH problem trivially. Many cryptographic schemes that are constructed from the CDH problem rely in fact on the hardness of the DDH problem. The
Computational Diffie–Hellman assumption
Computational_Diffie–Hellman_assumption
Elliptic curve used in Internet cryptography
Retrieved 2018-12-02. Green, Matthew (2015-01-14). "A Few Thoughts on Cryptographic Engineering: The Many Flaws of Dual_EC_DRBG". blog.cryptographyengineering
Curve25519
Mathematical operation on points on an elliptic curve
discrete logarithm problem by analogy to other cryptographic systems). This is because the addition of two points on an elliptic curve (or the addition of one
Elliptic curve point multiplication
Elliptic_curve_point_multiplication
ARM- and RISC-V-architecture microcontroller by the Raspberry Pi Foundation
code in boot ROM allows for checking blocks in the flash memory for cryptographic signatures using a public key stored in the OTP memory. It also includes
RP2350
Computational problem used in cryptography
For cryptography applications, worst case complexity is not sufficient, and we need to guarantee cryptographic construction are hard based on average
Short integer solution problem
Short_integer_solution_problem
Estimate of time taken for running an algorithm
multiplication, O ( n log n log log n ) {\displaystyle O(n\log n\log \log n)} In many cases, the O ( n log n ) {\displaystyle O(n\log n)} running time
Time_complexity
Digital signature scheme
assumed 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
Mathematical problem in cryptography
In cryptography, learning with errors (LWE) is a mathematical problem that is widely used to create secure encryption algorithms. It is based on the idea
Learning_with_errors
Type of cryptographic attack
attack BHT Algorithm "Avoiding collisions, Cryptographic hash functions" (PDF). Foundations of Cryptography, Computer Science Department, Wellesley College
Birthday_attack
Amateur radio verification database
operation in 2003. The LoTW system uses "secure" authentication using cryptographic key distribution. An amateur's computer-based logbook, in ADIF or Cabrillo
Logbook_of_The_World
Piece of multi-factor authentication
physically possess, they are exposed to unique threats based on duplication of the underlying cryptographic material - for example, computer viruses and software
Software_token
Lemma in cryptography
amplification section in the article Quantum key distribution). In quantum cryptographic settings, privacy amplification must also bound information held in
Leftover_hash_lemma
Method of externally opening ports on a firewall
any other attacking IP address, the ports on the firewall will still appear to be closed. Using cryptographic hashes inside the port knock sequence defends
Port_knocking
In cryptography, a subgroup confinement attack, or small subgroup confinement attack, on a cryptographic method that operates in a large finite group
Small subgroup confinement attack
Small_subgroup_confinement_attack
Class of interactive proof
digital credential systems. Cryptographic protocol Zero-knowledge proof Interactive proof system Topics in cryptography Zero-knowledge password proof
Proof_of_knowledge
Cryptographic hash function
satisfies many desirable cryptographic and statistical properties, it was not designed to be an "all-purpose" cryptographic hash function. For example
SWIFFT
Password authentication algorithm
a one-time password (OTP) algorithm based on the hash-based message authentication code (HMAC) cryptographic algorithm and is a basis for the commonly
HMAC-based_one-time_password
Proving validity without revealing other data
various cryptographic primitives, such as hash-based cryptography, pairing-based cryptography, multi-party computation, or lattice-based cryptography. Generally
Zero-knowledge_proof
Public-key cryptosystem
In cryptography, the ElGamal encryption system is a public-key encryption algorithm based on the Diffie–Hellman key exchange. It was described by Taher
ElGamal_encryption
Data structure for approximate set membership
of the Spatial Bloom Filters and Their Relevance to Cryptographic Protocols", IEEE Transactions on Information Forensics and Security, 13 (7): 1710–1721
Bloom_filter
Computing concept
) = ⌈ log 2 ( n + 1 ) ⌉ = ⌊ log 2 ( n ) ⌋ + 1 {\displaystyle \ell (n)=\lceil \log _{2}(n+1)\rceil =\lfloor \log _{2}(n)\rfloor +1} where log 2 {\displaystyle
Bit-length
Integer having only small prime factors
∼ 1 π ( B ) ! ∏ p ≤ B log x log p . {\displaystyle \Psi (x,B)\sim {\frac {1}{\pi (B)!}}\prod _{p\leq B}{\frac {\log x}{\log p}}.} where π ( B ) {\displaystyle
Smooth_number
Free and open-source VPN protocol
implementing cryptographic controls, limits the choices for key exchange processes, and maps algorithms to a small subset of modern cryptographic primitives
WireGuard
CRYPTOGRAPHIC LOG-ON
CRYPTOGRAPHIC LOG-ON
CRYPTOGRAPHIC LOG-ON
CRYPTOGRAPHIC LOG-ON
CRYPTOGRAPHIC LOG-ON
CRYPTOGRAPHIC LOG-ON
CRYPTOGRAPHIC LOG-ON
CRYPTOGRAPHIC LOG-ON
CRYPTOGRAPHIC LOG-ON