Skip to search formSkip to main contentSkip to account menu

Strong cryptography

Known as: Cryptographically strong, Strong encryption, Cryptographic strength 
Strong cryptography or cryptographically strong are general terms applied to cryptographic systems or components that are considered highly resistant… 
Wikipedia (opens in a new tab)

Related topics

Related topics

27 relations
Advanced Encryption Standard processAlgorithmBlock cipherColossus computer

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Detail Power Analysis of the SHA-3 Hashing Algorithm Candidates on Xilinx Spartan-3E
and Technology (NIST) created an open competition to find a new standard for cryptographic hashing in 2007. The competition was… 
2012
2012
GENERATION OF SECURE ONE -TIME PASSWORD BASED ON IMAGE AUTHENTICATION
Phishing, a serious security threat to Internet users is an e-mail fraud in which the perpetrator sends out an email which looks… 
Review
2011
Review
2011
On the identification and analysis of Skype traffic
Skype applies strong encryption to provide secure communication inside the whole Skype network. It also uses several techniques… 
2009
2009
Performance of WiMAX Security Algorithm (The Comparative Study of RSA Encryption Algorithm with ECC Encryption Algorithm)
IEEE 802.16, known as WiMax, is at the top of communication technology drive because it is gaining a great position in the next… 
2009
2009
DNA Cryptographic Algorithms
DNA has a great cryptographic strength, its binding properties between nucleotides bases (A—T, C—G) offer the possibility to… 
2009
2009
Secure Access of Smart Cards Using Elliptic Curve Cryptosystems
Public Key Cryptography (PKC) is recently playing an essential role in electronic banking and financial transactions. Elliptic… 
2007
2007
Skype Traffic Identification
Skype uses strong encryption to secure communications inside the whole Skype network. Clients choose communication ports randomly… 
2004
2004
Network security hacks
To the uninitiated, the title may seem like an oxymoron: after all, aren't hacks what network security is supposed to prevent… 
2004
2004
Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters
We propose efficient and secure (string) oblivious transfer (OT/sup 1//sub n/) schemes for any n/spl ges/2. We build our OT/sup 1… 
Review
1990
Review
1990
A short proof for explicit formulas for discrete logarithms in finite fields
Let Fq be the finite field of order q and characteristic p, so that q is a power of the prime p. Then the multiplicative group F… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)