Help
RSS
API
Feed
Maltego
Contact
Domain > oldeed.com
×
Welcome!
Right click nodes and scroll the mouse to navigate the graph.
×
More information on this domain is in
AlienVault OTX
Is this malicious?
Yes
No
Whois
Property
Value
Email
mail@wuxueqi.com
NameServer
NS6.CNMSN.NET
Created
2001-01-21 00:00:00
Changed
2016-07-17 00:00:00
Expires
2017-01-21 00:00:00
Registrar
BIZCN.COM, INC.
DNS Resolutions
Date
IP Address
2024-09-09
47.56.138.221
(
ClassC
)
Port 80
HTTP/1.1 200 OKContent-Type: text/htmlLast-Modified: Tue, 13 Aug 2024 13:32:14 GMTAccept-Ranges: bytesETag: 0c3353585edda1:0Server: Microsoft-IIS/7.5Date: Mon, 09 Sep 2024 03:35:32 GMTContent-Length: 17461 html>head> meta namewechat-enable-text-zoom-em contenttrue>meta http-equivContent-Type contenttext/html; charsetutf-8>meta http-equivX-UA-Compatible contentIEedge>meta namecolor-scheme contentlight dark>meta nameviewport contentwidthdevice-width,initial-scale1.0,maximum-scale1.0,user-scalable0,viewport-fitcover>link relshortcut icon typeimage/x-icon meta nameformat-detection contenttelephoneno> meta http-equivContent-Type contenttext/html; charsetgb2312>meta namedescription content提供精品国际域名,国内域名,拼音域名数字域名转让合作或投资开发信,购买域名电话: 15010783599>meta namekeywords content域名银行,网站合作,域名转让,域名合作,域名租用,域名投资,域名经济,国际域名,国内域名,拼音域名,购买域名,域名销??域名银行,域名交易> meta nametheme-color content#f7f7f9>link relicon hreffavicon.ico typeimage/x-icon />link relshortcut icon hreffavicon.ico typeimage/x-icon />link relcanonical hrefhttp://CnLogo.com/>link href/cncss/bootstrap.css relstylesheet typetext/css />!-- Custom Theme files -->link href/cncss/style0.css relstylesheet typetext/css /> script src/js/jquery.min.js> /script>script typetext/javascript>try {var urlhash window.location.hash;if (!urlhash.match(fromapp)){if ((navigator.userAgent.match(/(iPhone|iPod|Android|ios|iPad)/i))){window.locationhttp://cnlogo.com/M/;}}}catch(err){}/script>script languagejavascript> //平台、设备和操作系统 var system { win : false, mac : false, xll : false }; //检测平台 var p navigator.platform; system.win p.indexOf(Win) 0; system.mac p.indexOf(Mac) 0; system.x11 (p X11) || (p.indexOf(Linux) 0); //跳转语句,如果是手机访问就自动跳转到http://s.gmzm.org/mobi页面 if(system.win||system.mac||system.xll){ }else{ window.location.hrefhttp://cnlogo.com/m/; } //此处网址可手动修改为想跳转到的网址/script>script languagejavascript>if (location.hostnamesoulsky.com){ location.replace(http://soulsky.com/work/index.html)} if (location.hostnamewww.soulsky.com){ location.replace(http://soulsky.com/work/index.html)} if (location.hostnamesoulsky.cn){ location.replace(http://soulsky.com/work/index.html)} if (location.hostnamewww.soulsky.cn){ location.replace(http://soulsky.com/work/index.html)} /script>/head>body link#0000FF vlink#C0C0C0>div aligncenter>p aligncenter> font color#a1a3a5>script typetext/javascript charsetUTF-8>no_www_url document.domain ; // from home test : no_www_url xn--hxto71f.tw;if (no_www_url.substr(0,4) www. ) { no_www_url no_www_url.substring(4,no_www_url.length) };document.write(font size4>欢迎访问:b> font facegeorgia,blod color#FF0000>+no_www_url+ /font> font size4 color#000000> 本网站域名可转让/b> )puny_code_check no_www_url ; if (puny_code_check.substr(0,4) xn--){//Javascript Punycode converter derived from example in RFC3492.//This implementation is created by some@domain.name and released into public domainvar punycode new function Punycode() { // This object converts to and from puny-code used in IDN // // punycode.ToASCII ( domain ) // // Returns a puny coded representation of domain. // It only converts the part of the domain name that // has non ASCII characters. I.e. it dosent matter if // you call it with a domain that already is in ASCII. // // punycode.ToUnicode (domain) // // Converts a puny-coded domain name to unicode. // It only converts the puny-coded parts of the domain name. // I.e. it dosent matter if you call it on a string // that already has been converted to unicode. // // this.utf16 { // The utf16-class is necessary to convert from javascripts internal character representation to unicode and back. decode:function(input){ var output , i0, leninput.length,value,extra; while (i len) { value input.charCodeAt(i++); if ((value & 0xF800) 0xD800) { extra input.charCodeAt(i++); if ( ((value & 0xFC00) ! 0xD800) || ((extra & 0xFC00) ! 0xDC00) ) { throw new RangeError(UTF-16(decode): Illegal UTF-16 sequence); } value ((value & 0x3FF) 10) + (extra & 0x3FF) + 0x10000; } output.push(value); } return output; }, encode:function(input){ var output , i0, leninput.length,value; while (i len) { value inputi++; if ( (value & 0xF800) 0xD800 ) { throw new RangeError(UTF-16(encode): Illegal UTF-16 value); } if (value > 0xFFFF) { value - 0x10000; output.push(String.fromCharCode(((value >>>10) & 0x3FF) | 0xD800)); value 0xDC00 | (value & 0x3FF); } output.push(String.fromCharCode(value)); } return output.join(); } } //Default parameters var initial_n 0x80; var initial_bias 72; var delimiter \x2D; var base 36; var damp 700; var tmin1; var tmax26; var skew38; var maxint 0x7FFFFFFF; // decode_digit(cp) returns the numeric value of a basic code // point (for use in representing integers) in the range 0 to // base-1, or base if cp is does not represent a value. function decode_digit(cp) { return cp - 48 10 ? cp - 22 : cp - 65 26 ? cp - 65 : cp - 97 26 ? cp - 97 : base; } // encode_digit(d,flag) returns the basic code point whose value // (when used for representing integers) is d, which needs to be in // the range 0 to base-1. The lowercase form is used unless flag is // nonzero, in which case the uppercase form is used. The behavior // is undefined if flag is nonzero and digit d has no uppercase form. function encode_digit(d, flag) { return d + 22 + 75 * (d 26) - ((flag ! 0) 5); // 0..25 map to ASCII a..z or A..Z // 26..35 map to ASCII 0..9 } //** Bias adaptation function ** function adapt(delta, numpoints, firsttime ) { var k; delta firsttime ? Math.floor(delta / damp) : (delta >> 1); delta + Math.floor(delta / numpoints); for (k 0; delta > (((base - tmin) * tmax) >> 1); k + base) { delta Math.floor(delta / ( base - tmin )); } return Math.floor(k + (base - tmin + 1) * delta / (delta + skew)); } // encode_basic(bcp,flag) forces a basic code point to lowercase if flag is zero, // uppercase if flag is nonzero, and returns the resulting code point. // The code point is unchanged if it is caseless. // The behavior is undefined if bcp is not a basic code point. function encode_basic(bcp, flag) { bcp - (bcp - 97 26) 5; return bcp + ((!flag && (bcp - 65 26)) 5); } // Main decode this.decodefunction(input,preserveCase) { // Dont use utf16 var output; var case_flags; var input_length input.length; var n, out, i, bias, basic, j, ic, oldi, w, k, digit, t, len; // Initialize the state: n initial_n; i 0; bias initial_bias; // Handle the basic code points: Let basic be the number of input code // points before the last delimiter, or 0 if there is none, then // copy the first basic code points to the output. basic input.lastIndexOf(delimiter); if (basic 0) basic 0; for (j 0; j basic; ++j) { if(preserveCase) case_flagsoutput.length ( input.charCodeAt(j) -65 26); if ( input.charCodeAt(j) > 0x80) { throw new RangeError(Illegal input > 0x80); } output.push( input.charCodeAt(j) ); } // Main decoding loop: Start just after the last delimiter if any // basic code points were copied; start at the beginning otherwise. for (ic basic > 0 ? basic + 1 : 0; ic input_length; ) { // ic is the index of the next character to be consumed, // Decode a generalized variable-length integer into delta, // which gets added to i. The overflow checking is easier // if we increase i as we go, then subtract off its starting // value at the end to obtain delta. for (oldi i, w 1, k base; ; k + base) { if (ic > input_length) { throw RangeError (punycode_bad_input(1)); } digit decode_digit(input.charCodeAt(ic++)); if (digit > base) { throw RangeError(punycode_bad_input(2)); } if (digit > Math.floor((maxint - i) / w)) { throw RangeError (punycode_overflow(1)); } i + digit * w; t k bias ? tmin : k > bias + tmax ? tmax : k - bias; if (digit t) { break; } if (w > Math.floor(maxint / (base - t))) { throw RangeError(punycode_overflow(2)); } w * (base - t); } out output.length + 1; bias adapt(i - oldi, out, oldi 0); // i was supposed to wrap around from out to 0, // incrementing n each time, so well fix that now: if ( Math.floor(i / out) > maxint - n) { throw RangeError(punycode_overflow(3)); } n + Math.floor( i / out ) ; i % out; // Insert n at position i of the output: // Case of last character determines uppercase flag: if (preserveCase) { case_flags.splice(i, 0, input.charCodeAt(ic -1) -65 26);} output.splice(i, 0, n); i++; } if (preserveCase) { for (i 0, len output.length; i len; i++) { if (case_flags) { output (String.fromCharCode(output).toUpperCase()).charCodeAt(0); } } } return this.utf16.encode(output); }; //** Main encode function ** this.encode function (input,preserveCase) { //** Bias adaptation function ** var n, delta, h, b, bias, j, m, q, k, t, ijv, case_flags; if (preserveCase) { // Preserve case, step1 of 2: Get a list of the unaltered string case_flags this.utf16.decode(input); } // Converts the input in UTF-16 to Unicode input this.utf16.decode(input.toLowerCase()); var input_length input.length; // Cache the length if (preserveCase) { // Preserve case, step2 of 2: Modify the list to true/false for (j0; j input_length; j++) { case_flagsj inputj ! case_flagsj; } } var output; // Initialize the state: n initial_n; delta 0; bias initial_bias; // Handle the basic code points: for (j 0; j input_length; ++j) { if ( inputj 0x80) { output.push( String.fromCharCode( case_flags ? encode_basic(inputj, case_flagsj) : inputj ) ); } } h b output.length; // h is the number of code points that have been handled, b is the // number of basic code points if (b > 0) output.push(delimiter); // Main encoding loop: // while (h input_length) { // All non-basic code points n have been // handled already. Find the next larger one: for (m maxint, j 0; j input_length; ++j) { ijv inputj; if (ijv > n && ijv m) m ijv; } // Increase delta enough to advance the decoders // n,i> state to m,0>, but guard against overflow: if (m - n > Math.floor((maxint - delta) / (h + 1))) { throw RangeError(punycode_overflow (1)); } delta + (m - n) * (h + 1); n m; for (j 0; j input_length; ++j) { ijv inputj; if (ijv n ) { if (++delta > maxint) return Error(punycode_overflow(2)); } if (ijv n) { // Represent delta as a generalized variable-length integer: for (q delta, k base; ; k + base) { t k bias ? tmin : k > bias + tmax ? tmax : k - bias; if (q t) break; output.push( String.fromCharCode(encode_digit(t + (q - t) % (base - t), 0)) ); q Math.floor( (q - t) / (base - t) ); } output.push( String.fromCharCode(encode_digit(q, preserveCase && case_flagsj ? 1:0 ))); bias adapt(delta, h + 1, h b); delta 0; ++h; } } ++delta, ++n; } return output.join(); } this.ToASCII function ( domain ) { var domain_array domain.split(.); var out ; for (var i0; i domain_array.length; ++i) { var s domain_array; out.push( s.match(/^A-Za-z0-9-/) ? xn-- + punycode.encode(s) : s ); } return out.join(.); } this.ToUnicode function ( domain ) { var domain_array domain.split(.); var out ; for (var i0; i domain_array.length; ++i) { var s domain_array; out.push( s.match(/^xn--/) ? punycode.decode(s.slice(4)) : s ); } return out.join(.); }}();var punycode_convert punycode.ToUnicode(puny_code_check);document.write(font size6 facegeorgia,blod color#FF0000>IDN_punycode_from:+punycode_convert+/font>);}; document.write( )/script>img border0 src/links/QQ.jpg> img border0 src/links/TEL.jpg > img border0 src/links/weixin.jpg > /p>/div> div classcontainer aligncenter>div classlogo>img width20 border0 src/img/cnlogo32.jpg > a hrefhttp://cnlogo.com/so/ >搜索导航/a>img width20 border0 src/img/cnlogo32.jpg > a hrefhttp://www.gmzm.org/ >光明之门/a> img width20 border0 src/img/cnlogo32.jpg > a hrefhttp://s.gmzm.org/ >天神天台/a> a classlogo-link hrefhttp://cnlogo.com/show/ title网标网CnLogo.com:通向元宇宙的入口>img altlogo srchttp://cnlogo.com/weblogo/cnlogo/cnlogo200.jpg classlogo-image>/a> img width20 border0 src/img/cnlogo32.jpg > a hrefhttp://cnlogo.com/china/ >网上中国/a> img width20 border0 src/img/cnlogo32.jpg > a hrefhttp://cnlogo.com/Museum/ >博物馆展/a> img width20 border0 src/img/cnlogo32.jpg > a hrefhttps://mi.aliyun.com/shop/33382 >域名转让/a> br/>/div>div classlogo aligncenter> div classsection> div classow-spage-content-detail> p stylewhite-space: normal; text-align: center; line-height:150%> a target_blank hrefhttps://mp.weixin.qq.com/mp/appmsgalbum?__bizMzIzODQzNDQ3Nw&actiongetalbum&album_id3301289610609934340#wechat_redirect> img src/2024AD/2024.jpg > /a> /p>/div>/div>div classfooter text-center> div classcopy> p aligncenter> img width26 border0 src/img/cnlogo.ico > © Since 2000 a hrefhttp://CnLogo.com/show/ >网标网/a> CnLogo.com a hrefhttp://cnlogo.com/links/ly-write.asp target_blank>意见反馈/a> /small>/p> p>br/>script charsetUTF-8 idLA_COLLECT src//sdk.51.la/js-sdk-pro.min.js>/script>script>LA.init({id: JgIiwYDbw37e0icO,ck: JgIiwYDbw37e0icO})/script> /h5>/p>p>br/>/p> /div> /div>/footer> /div>/body>/html>
View on OTX
|
View on ThreatMiner
Please enable JavaScript to view the
comments powered by Disqus.
Data with thanks to
AlienVault OTX
,
VirusTotal
,
Malwr
and
others
. [
Sitemap
]