Home
Search results “Crypto cipher aes python for loop” for the 2017
Recover RSA private key from public keys - rhme2 Key Server (crypto 200)
 
12:42
Using the greatest common divisor (GCD) to factorize the public modulo into the secret primes, so we can forge a RSA signature. Source for the rhme2 challenges: https://github.com/Riscure/Rhme-2016 -=[ 🔴 Stuff I use ]=- → Microphone:* https://amzn.to/2LW6ldx → Graphics tablet:* https://amzn.to/2C8djYj → Camera#1 for streaming:* https://amzn.to/2SJ66VM → Lens for streaming:* https://amzn.to/2CdG31I → Connect Camera#1 to PC:* https://amzn.to/2VDRhWj → Camera#2 for electronics:* https://amzn.to/2LWxehv → Lens for macro shots:* https://amzn.to/2C5tXrw → Keyboard:* https://amzn.to/2LZgCFD → Headphones:* https://amzn.to/2M2KhxW -=[ ❤️ Support ]=- → per Video: https://www.patreon.com/join/liveoverflow → per Month: https://www.youtube.com/channel/UClcE-kVhqyiHCcjYwcpfj9w/join -=[ 🐕 Social ]=- → Twitter: https://twitter.com/LiveOverflow/ → Website: https://liveoverflow.com/ → Subreddit: https://www.reddit.com/r/LiveOverflow/ → Facebook: https://www.facebook.com/LiveOverflow/ -=[ 📄 P.S. ]=- All links with "*" are affiliate links. LiveOverflow / Security Flag GmbH is part of the Amazon Affiliate Partner Programm. #CTF #Cryptography
Views: 40768 LiveOverflow
Secret Key Exchange (Diffie-Hellman) - Computerphile
 
08:40
How do we exchange a secret key in the clear? Spoiler: We don't - Dr Mike Pound shows us exactly what happens. Mathematics bit: https://youtu.be/Yjrfm_oRO0w Computing Limit: https://youtu.be/jv2H9fp9dT8 https://www.facebook.com/computerphile https://twitter.com/computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com
Views: 207927 Computerphile
Encrypt/Decrypt file in python
 
04:28
after i've got many error i find other way to encrypt/decrypt any file with aes encryption gist: https://gist.github.com/darkeyepy/f0efa96d1a7fc5be7334410fe9443e27
Views: 1411 Саад
Neo Blockchain Python Smart Contract compiler
 
12:14
A demo of using the neo-python smart contract compiler to build, test, and run smart contracts on the Neo blockchain
Views: 2585 City of Zion
PicoCTF 2017 - computeAES Walkthrough
 
03:07
Level 1 - computeAES - Cryptography PicoCTF 2017 CyberSecurity Competition Challenge Walkthroughs PicoCTF 2017 Competition: https://2017game.picoctf.com/
Cryptography with Python : MD5 and SHA Hashes | packtpub.com
 
06:12
This playlist/video has been uploaded for Marketing purposes and contains only selective videos. For the entire video course and code, visit [http://bit.ly/2jeErfC]. In this video, we understand what hashes are. We then take a look at MD5, SHA-1, SHA-2, and SHA-3 hashes. Cracking Hashes are also explored. • What are Hashes? • MD5 • SHA-1, SHA-2, and SHA-3 For the latest Networking & Servers video tutorials, please visit http://bit.ly/2lkC8Kb Find us on Facebook -- http://www.facebook.com/Packtvideo Follow us on Twitter - http://www.twitter.com/packtvideo
Views: 81 Packt Video
SHA1 length extension attack on the Secure Filesystem - rhme2 Secure Filesystem (crypto 100)
 
06:58
The first challenge I solved for the embedded hardware CTF by riscure. It implements a Secure Filesystem which prevents you from readeing files without knowing the correct token for a file. Load the challenge on your own board: https://github.com/Riscure/Rhme-2016 -=[ 🔴 Stuff I use ]=- → Microphone:* https://amzn.to/2LW6ldx → Graphics tablet:* https://amzn.to/2C8djYj → Camera#1 for streaming:* https://amzn.to/2SJ66VM → Lens for streaming:* https://amzn.to/2CdG31I → Connect Camera#1 to PC:* https://amzn.to/2VDRhWj → Camera#2 for electronics:* https://amzn.to/2LWxehv → Lens for macro shots:* https://amzn.to/2C5tXrw → Keyboard:* https://amzn.to/2LZgCFD → Headphones:* https://amzn.to/2M2KhxW -=[ ❤️ Support ]=- → per Video: https://www.patreon.com/join/liveoverflow → per Month: https://www.youtube.com/channel/UClcE-kVhqyiHCcjYwcpfj9w/join -=[ 🐕 Social ]=- → Twitter: https://twitter.com/LiveOverflow/ → Website: https://liveoverflow.com/ → Subreddit: https://www.reddit.com/r/LiveOverflow/ → Facebook: https://www.facebook.com/LiveOverflow/ -=[ 📄 P.S. ]=- All links with "*" are affiliate links. LiveOverflow / Security Flag GmbH is part of the Amazon Affiliate Partner Programm. #CTF #Cryptography
Views: 14050 LiveOverflow
rail fence cipher in java
 
10:37
Code in java of Rail Fence cipher. Like and share. It's FREE too :) ASP.NET Web API https://www.youtube.com/playlist?list=PLOGAj7tCqHx9n-_d3YKwLJr-uHkmKZyih Download source code at: https://drive.google.com/file/d/0B61-MHkMYqM4RHc4bkNJYlIxTTg/ Follow us on Facebook https://www.facebook.com/AllTech-1089946481026048/ Play Lists Swift https://www.youtube.com/playlist?list=PLOGAj7tCqHx9C08vyhSMciLtkMSPiirYr All https://www.youtube.com/channel/UCBGENnRMZ3chHn_9gkcrFuA/playlists JavaScript https://www.youtube.com/playlist?list=PLOGAj7tCqHx_grLMl0A0yC8Ts_ErJMJft c# https://www.youtube.com/playlist?list=PLOGAj7tCqHx9H5dGNA4TGkmjKGOfiR4gk Java https://www.youtube.com/playlist?list=PLOGAj7tCqHx-ey9xikbXOfGdbvcOielRw Amazon Lumberyard Game Engine https://www.youtube.com/playlist?list=PLOGAj7tCqHx-IZssU8ItkRAXstlyIWZxq
Views: 1288 AllTech
RSA Power Analysis Side-Channel Attack - rhme2
 
12:07
Preparing an arduino nano board to perform a power analysis side channel attack and explaining how that can be used to break RSA. Also proof I can't count. RSA video: https://www.youtube.com/watch?v=sYCzu04ftaY rhme2 by riscure: http://rhme.riscure.com/home Oscilloscope: Rigol DS2072A Soldering Station: Weller WD1 -=[ 💻 Related Products ]=- → Soldering station:* https://amzn.to/2SII4du → Oscilloscope:* https://amzn.to/2SMsDAY → Cheaper Oscilloscope:* https://amzn.to/2RCzCyX -=[ 🔴 Stuff I use ]=- → Microphone:* https://amzn.to/2LW6ldx → Graphics tablet:* https://amzn.to/2C8djYj → Camera#1 for streaming:* https://amzn.to/2SJ66VM → Lens for streaming:* https://amzn.to/2CdG31I → Connect Camera#1 to PC:* https://amzn.to/2VDRhWj → Camera#2 for electronics:* https://amzn.to/2LWxehv → Lens for macro shots:* https://amzn.to/2C5tXrw → Keyboard:* https://amzn.to/2LZgCFD → Headphones:* https://amzn.to/2M2KhxW -=[ ❤️ Support ]=- → per Video: https://www.patreon.com/join/liveoverflow → per Month: https://www.youtube.com/channel/UClcE-kVhqyiHCcjYwcpfj9w/join -=[ 🐕 Social ]=- → Twitter: https://twitter.com/LiveOverflow/ → Website: https://liveoverflow.com/ → Subreddit: https://www.reddit.com/r/LiveOverflow/ → Facebook: https://www.facebook.com/LiveOverflow/ -=[ 📄 P.S. ]=- All links with "*" are affiliate links. LiveOverflow / Security Flag GmbH is part of the Amazon Affiliate Partner Programm.
Views: 18284 LiveOverflow
Ethical Hacking Training Course ( Sponsored by Infinite Skills )
 
10:22:01
Do You Know Infosec Experts Make 30% More than Ethical Hackers...? Here is my NEW Course https://www.youtube.com/watch?v=Igq9Q3r00uk Which OS Do I Personally Use For Ethical Hacking:- https://www.youtube.com/watch?v=3u0nkxdCC6c What Should Be Your PC Specs For Ethical Hacking - https://www.youtube.com/watch?v=B9Vxsc7y-AU What Shall You Learn First In Ethical Hacking - https://www.youtube.com/watch?v=nyTG0n9KlEc People ask me, why am i making those PRECIOUS COURSES FREE! well, i don't want you to struggle here and there and get scammed by so many institutes and so called fake experts. I have many companies who pay my high fees charges so i am fine with that money, these videos make sure i contribute to society in the best possible way. The Complete Ethical Hacking Training Course - Become An Ethical Hacker Today Would you like to learn how to become an ethical hacker from the beginner to advanced level? This video tutorial which is more than 9+ hours long is something that you’re absolutely going to love! Timestamps :- What you should expect from the video → 00:00 - 04:12 What is Hacking → 04:13 - 07:40 Why do we hack → 07:41 - 13:04 Types Of Hacking → 13:05 - 19:10 Being Ethical → 19:11 - 22:35 Legal Issues Around Hacking → 22:36 - 29:05 Methodology → 29:06 - 36:00 Types Of Attacks → 36:01 - 44:20 Skills Necessary And Skills To Be Learned → 44:21 - 50:23 What Is Penetration Testing Scope → 50:24 - 59:00 What Is Footprinting → 59:01 - 1:03:16 History Lessons - Way Back Machine → 1:03:17 - 1:08:54 Using Your Resources → 1:08:55 - 1:13:37 Using Whois Lookups → 1:13:38 - 1:20:10 Using DNS To Extract Information → 1:20:11 - 1:27:18 Finding Network Ranges → 1:27:19 - 1:32:34 Google Hacking → 1:32:35 - 1:36:15 Mining For Information Using Google Hacking → 1:36:16 - 1:40:20 Google Hacking Database → 1:40:21 - 1:46:04 History Of TCPIP → 1:46:05 - 1:53:10 Using Wireshark To Examine Packets → 1:53:11 - 1:58:50 OSI And IP Models → 1:58:51 - 2:07:38 Addressing → 2:07:39 - 2:11:20 UDP → 2:11:21 - 2:16:34 TCP → 2:16:35 - 2:24:40 Services → 2:24:41 - 2:30:27 Using Wireshark For Deep Analysis → 2:30:28 - 2:39:10 DHCP → 2:39:11 - 2:48:35 Using ARP → 2:48:36 - 2:58:08 History Of Cryptography → 2:58:09 - 3:05:35 Types Of Cryptography → 3:05:36 - 3:12:36 Public Key → 3:12:37 - 3:17:12 Certificates → 3:17:13 - 3:25:30 Hashing → 3:25:31 - 3:31:05 AES, DES, 3DES → 3:31:06 - 3:36:59 SSL and TLS → 3:37:00 - 3:44:47 SSH → 3:44:48 - 3:51:41 Disk Encryption → 3:51:42 - 3:56:00 Cryptographic Analysis → 3:56:01 - 3:59:45 Types Of Scans → 3:59:46 - 4:07:30 Using NMAP → 4:07:31 - 4:11:18 Other Types Of Scans → 4:11:19 - 4:18:21 HPing And Its Uses → 4:18:22 - 4:24:51 War Dialing → 4:24:52 - 4:28:45 IDS Evasion → 4:28:46 - 4:35:39 Banner Grabbing → 4:35:40 - 4:44:21 Vulnerability Scanning → 4:44:22 - 4:50:12 Using Nessus → 4:50:13 - 4:59:07 Enumeration Techniques → 4:59:08 - 5:05:54 SNMP → 5:05:55 - 5:15:00 LDAP → 5:15:01 - 5:23:41 Using Proxies → 5:23:42 - 5:29:24 Tor And Anonymizers → 5:29:25 - 5:34:44 Tunneling → 5:34:45 - 5:41:24 Goals → 5:41:25 - 5:49:12 Password Cracking And Complexity → 5:49:13 - 5:56:24 Password Attacks → 5:56:25 - 6:02:07 Password Storage Techniques → 6:02:08 - 6:06:41 Privilege Escalation → 6:06:42 - 6:12:55 Spyware, Rootkits And Key Loggers → 6:12:56 - 6:20:47 Metasploit Basics → 6:20:48 - 6:25:42 AuditingLogging → 6:25:43 - 6:33:46 Metasploit Again → 6:33:47 - 6:38:10 Definitions And History → 6:38:11 - 6:43:14 Detection Of Malware → 6:43:15 - 6:49:34 Anti-Virus Evasion → 6:49:35 - 6:54:06 Deployment Of Malware → 6:54:07 - 6:59:04 Virus Types → 6:59:05 - 7:05:10 Malware Analysis → 7:05:11 - 7:11:10 Windows ADS And Hiding Malware → 7:11:11 - 7:16:52 Doing Debugging - OllyDbg → 7:16:53 - 7:25:52 Packing And Automated A V Maker Tools → 7:25:53 - 7:29:30 More Malware Analysis → 7:29:31 - 7:35:36 What Is DoS DDoS → 7:35:37 - 7:40:28 DoS Attacks → 7:40:29 - 7:46:32 Cyber Crime → 7:46:33 - 7:53:21 Botnets → 7:53:22 - 8:00:19 Attack Countermeasures - Flooding → 8:00:20 - 8:09:16 What Is Web Application Testing → 8:09:17 - 8:14:12 Web Application Architecture → 8:14:13 - 8:19:24 Web Testing Tools Cross Site Scripting SQL Injection Cross Site Request Forgery Session Hijacking And Attacks And Cookies Password Attacks Encoding Wireless Networking Encryption Techniques - WEP, WPA, WPA2 Finding Hotspots Breaking WEP Encryption Rogue Access Points And Attacks Wireless Sniffing Protecting Wireless Networks What Is Evasion And Why Do We Use It Steganography Stacks And Heaps Buffer Overflows Format String De-Compilation Reverse Engineering Protecting Against Buffer Overflow Attacks Share this Video → https://youtu.be/z-aZYUuTrN0
Views: 699904 Sagar Bansal
Defeat 2FA token because of bad randomness - rhme2 Twistword (Misc 400)
 
10:25
Generating random numbers on computers is not easy. And while the intended solution was really hard, the challenge had a problem with the random number generation, which allowed me to solve it. Clarification from Andres Moreno (riscure) on the challenge: "The "official" challenge solution involved reading the tiny Mersenne twister (tinyMT) paper, writing some equations, and using a solver. The tinyMT is tricky to initialize. Giving a proper seed is not enough. You need to provide initial state matrices with certain properties (there is a generator for this). The challenge used improper initialized matrices (zeros) that reduced the PRNG period. During tests, we found that ~12hr were needed to solve the challenge (solver time only), but we did not test the amount of entropy reduction by improper state initialization. Fortunately, the problem was not in the PRNG." -=[ 🔴 Stuff I use ]=- → Microphone:* https://amzn.to/2LW6ldx → Graphics tablet:* https://amzn.to/2C8djYj → Camera#1 for streaming:* https://amzn.to/2SJ66VM → Lens for streaming:* https://amzn.to/2CdG31I → Connect Camera#1 to PC:* https://amzn.to/2VDRhWj → Camera#2 for electronics:* https://amzn.to/2LWxehv → Lens for macro shots:* https://amzn.to/2C5tXrw → Keyboard:* https://amzn.to/2LZgCFD → Headphones:* https://amzn.to/2M2KhxW -=[ ❤️ Support ]=- → per Video: https://www.patreon.com/join/liveoverflow → per Month: https://www.youtube.com/channel/UClcE-kVhqyiHCcjYwcpfj9w/join -=[ 🐕 Social ]=- → Twitter: https://twitter.com/LiveOverflow/ → Website: https://liveoverflow.com/ → Subreddit: https://www.reddit.com/r/LiveOverflow/ → Facebook: https://www.facebook.com/LiveOverflow/ -=[ 📄 P.S. ]=- All links with "*" are affiliate links. LiveOverflow / Security Flag GmbH is part of the Amazon Affiliate Partner Programm. #CTF #Cryptography
Views: 19182 LiveOverflow
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key
 
33:34
We propose a new class of post-quantum digital signature schemes that: (a) derive their security entirely from the security of symmetric-key primitives, believed to be quantum-secure, and (b) have extremely small keypairs, and, (c) are highly parametrizable. In our signature constructions, the public key is an image y=f(x) of a one-way function f and secret key x. A signature is a non-interactive zero-knowledge proof of x, that incorporates a message to be signed. For this proof, we leverage recent progress of Giacomelli et al. (USENIX'16) in constructing an efficient sigma protocol for statements over general circuits. We improve this sigma protocol to reduce proof sizes by a factor of two, at no additional computational cost. While this is of independent interest as it yields more compact proofs for any circuit, it also decreases our signature sizes. We consider two possibilities for making the proof non-interactive, the Fiat-Shamir transform, and Unruh's transform (EUROCRYPT'12,'15,'16). The former has smaller signatures, while the latter has a security analysis in the quantum-accessible random oracle model. By customizing Unruh's transform to our application, the overhead is reduced to 1.6x when compared to the Fiat-Shamir transform, which does not have a rigorous post-quantum security analysis. We implement and benchmark both approaches and explore the possible choice of f, taking advantage of the recent trend to strive for practical symmetric ciphers with a particularly low number of multiplications and end up using LowMC. This is joint work with Melissa Chase, David Derler, Steven Goldfeder, Claudio Orlandi, Christian Rechberger, Daniel Slamanig and Greg Zaverucha.  See more on this video at https://www.microsoft.com/en-us/research/video/post-quantum-zero-knowledge-and-signatures-from-symmetric-key/
Views: 979 Microsoft Research
Golang - Building a service for Secrets and Fun
 
01:12:30
If you want to see what we're building skip to: http://www.youtube.com/watch?v=0kZbtVwUonA&t=72m36s This is a code along for Building a new Service with golang - I would put the volume at half for now to avoid it being too loud =) This video implements the "Generate Key" Endpoint which will give our user a new aes 256bit key
DNA Secret Writing Techniques
 
00:57
The paper presents the principles of bio molecular computation (BMC) and several algorithms for DNA (deoxyribonucleic acid) steganography and cryptography: One- Time-Pad (OTP), DNA XOR OTP and DNA chromosomes indexing
Views: 245 logsig solutions
Crypto Defenses for Real-World System Threats - Kenn White - Ann Arbor
 
01:36:58
Modern encryption techniques provide several important security properties, well known to most practitioners. Or are they? What are in fact the guarantees of, say, HTTPS TLS cipher suites using authenticated encryption, IPSec vs. SSL VPNs, Property Preserving Encryption, or token vaults? We live in an era of embedded Hardware Security Modules that cost less than $1 in volume, and countless options now exist for encrypting streaming network data, files, volumes, and even entire databases. Let's take a deep dive into the edge of developed practice to discuss real-world threat scenarios to public cloud and IoT data, and look closely at how we can address specific technical risks with our current encryption toolkits. Advanced math not required. Bio: Kenneth White is a security researcher whose work focuses on networks and global systems. He is co-director of the Open Crypto Audit Project (OCAP), currently managing a large-scale audit of OpenSSL on behalf of the Linux Foundation's Core Infrastructure Initiative. Previously, White was Principal Scientist at Washington DC-based Social & Scientific Systems where he led the engineering team that designed and ran global operations and security for the largest clinical trial network in the world, with research centers in over 100 countries. White co-founded CBX Group which provides security services to major organizations including World Health, UNICEF, Doctors without Borders, the US State Department, and BAO Systems. Together with Matthew Green, White co-founded the TrueCrypt audit project, a community-driven initiative to conduct the first comprehensive cryptanalysis and public security audit of the widely used TrueCrypt encryption software. White holds a Masters from Harvard and is a PhD candidate in neuroscience and cognitive science, with applied research in real-time classification and machine learning. His work on network security and forensics and been cited by media including the Wall Street Journal, Forbes, Reuters, Wired and Nature. White is a technical reviewer for the Software Engineering Institute, and publishes and speaks frequently on computational modeling, security engineering, and trust. He tweets @kennwhite.
Views: 865 Duo Security
Blockchain: Distributed Trust - Bart Preneel
 
01:34:45
The Bitcoin ecosystem had a bumpy start, but driven in part by the demand created by the Silk Road and perhaps the Cyprus crisis, the impact grew quickly: the total value of bitcoins rose to several billion US$ in the first two years (currently it is around US$ 14 billion), hundreds of alternative cryptocurrencies (altcoins) were created and large mining entities were established, mostly in China. The ideas behind Bitcoin have opened up new approaches to cryptocurrencies, but also to distributed consensus, distributed naming, secure timestamping and commitment. One of the aspects that have drawn the most interest is the smart contract (that is, cryptographically enforceable agreements) on top of the Bitcoin ecosystem (or on other systems such as Ethereum). Even if some observers predict that the Bitcoin ecosystem will disappear or become irrelevant, the core ideas have already made a major impact. Unlike any other payment system or cryptocurrency created before, Bitcoin allows for fully decentralized generation of currency and fully decentralized verification of transactions. The core idea is the blockchain, a public ledger that registers all transactions under the form of a hash chain; the blockchain describes the state of the system, that is, it specifies who owns which amount. Transactions themselves are validated based on a scripting language, which creates some flexibility. In a distributed system, a central problem is how to achieve consensus (e.g., how to deal with double-spending transactions). Transactions are broadcast over a low-latency peer-to-peer network that offers some robustness against censoring or sabotage. This approach allows the Bitcoin ecosystem to achieve distributed consensus in a practical way assuming that players are rational (something which is known to be unachievable without additional assumptions such as rationality) albeit at the cost of a major computational effort in terms of mining. While the financial industry is less interested in the anarchistic aspects of the Bitcoin ecosystem (the governance model and the uncontrolled money supply), the distributed consensus idea is very appealing and is believed to have a very high business potential for a large number of financial transactions and interactions. In 2015, about US$ 1 billion was invested in venture capital in the area of blockchain and cryptocurrencies and the Aite Group predicted in 2016 that blockchain market could be worth as much as US$ 400 million in annual business by 2019. The idea of a public ledger for timestamping and registering documents using hash chains is more than 25 years old, as witnessed by the efforts of Surety Technologies in the early 1990 and the ISO standardization in this area in the mid 1990s –- but these earlier approaches did use a central authority to register all transactions. Bitcoin has inspired many actors to revisit those ideas by `taming’ the Bitcoin ecosystem into a private or permissioned ledger, where only a few selected actors have control over new currencies or verification of transactions (to get rid of distributed control) and where access to the ledger can be restricted (to get rid of full transparency). Some of the notable developments in this context are the open source initiative of IBM that is called Hyperledger and Intel's experimental Sawtooth Lake architecture. Professor Bart Preneel of KU Leuven heads the imec-COSIC (COmputer Security and Industrial Cryptography) research group. His main research areas are information security and privacy with a focus on cryptographic algorithms and protocols and efficient and secure implementations. He undertakes industrial consulting for major players in the finance, telco and hardware industry and has co-designed the Belgian eID and e-voting scheme. He is active in international standardization . Professor Preneel has served as Director, (1997-present), Vice President (2002-2007) and President (2008-2013) of the International Association for Cryptologic Research (IACR) and is co-founder and chairman of LSEC vzw (Leuven Security Excellence Consortium). He is a fellow of the IACR, a member of the Permanent Stakeholders group of ENISA (European Network and Information Security Agency) and of the Academia Europaea. He has testified for the European and Belgian parliament. He has been invited speaker at more than 150 conferences and schools in 40 countries. In 2014 he received the RSA Award for Excellence in the Field of Mathematics.
Views: 2212 secappdev.org
JCSA17 [2/8] TLS et l’utilisation de l’outil Scapy par Maxence Tury (ANSSI)
 
01:13:18
L’objectif de cette session est d’expliquer le protocole TLS à l’aide d’un tutoriel interactif utilisant Scapy, outil de manipulation de paquets en Python - http://www.secdev.org/projects/scapy/ Cette présentation par Maxence Tury de l'ANSSI a été faite le 6 juillet 2017 lors de Journée du Conseil scientifique de l'Afnic (www.afnic.fr) https://www.afnic.fr/fr/l-afnic-en-bref/actualites/actualites-generales/10658/show/retour-sur-l-edition-2017-de-la-journee-du-conseil-scientifique-de-l-afnic.html
Views: 452 AFNIC Registry