ABOUT US

Our development agency is committed to providing you the best service.

OUR TEAM

The awesome people behind our brand ... and their life motto.

  • Radha Roy

    Country Head

    I long for the raised voice, the howl of rage or love.

  • Shruti Das

    GM,India

    Contented with little, yet wishing for much more.

  • Divya Narayan

    Branch Head, Banglore

    If anything is worth doing, it's worth overdoing.

OUR SKILLS

We pride ourselves with strong, flexible and top notch skills.

Marketing

Development 90%
Design 80%
Marketing 70%

Websites

Development 90%
Design 80%
Marketing 70%

PR

Development 90%
Design 80%
Marketing 70%

ACHIEVEMENTS

We help our clients integrate, analyze, and use their data to improve their business.

150

GREAT PROJECTS

300

HAPPY CLIENTS

650

COFFEES DRUNK

1568

FACEBOOK LIKES

STRATEGY & CREATIVITY

Phasellus iaculis dolor nec urna nullam. Vivamus mattis blandit porttitor nullam.

PORTFOLIO

We pride ourselves on bringing a fresh perspective and effective marketing to each project.

Showing posts with label CRYPTOGRAPHY. Show all posts
Showing posts with label CRYPTOGRAPHY. Show all posts
  • TURING AWARD 2015





      







    ACM, the Association for Computing Machinery, honoured Whitfield Diffie, former Chief Security Officer of Sun Microsystems and Martin E. Hellman, Professor Emeritus of Electrical Engineering at Stanford University, recipients of the 2015 ACM A.M on 11 June 2016. Turing Award for critical contributions to modern cryptography. The ability for two parties to use encryption to communicate privately over an otherwise insecure channel is fundamental for billions of people around the world. On a daily basis, individuals establish secure online connections with banks, ecommerce sites, email servers and the cloud. Diffie and Hellman’s groundbreaking 1976 paper, “New Directions in Cryptography,” introduced the ideas of public-key cryptography and digital signatures, which are the foundation for most regularly-used security protocols on the Internet today. The DiffieHellman Protocol protects daily Internet communications and trillions of dollars in financial transactions. The ACM Turing Award, often referred to as the “Nobel Prize of Computing,” carries a $1 million prize with financial support provided by Google, Inc. It is named for Alan M. Turing, the British mathematician who articulated the mathematical foundation and limits of computing and who was a key contributor to the Allied cryptoanalysis of the German Enigma cipher during World War II. “Today, the subject of encryption dominates the media, is viewed as a matter of national security, impacts government-private sector relations, and attracts billions of dollars in research and development,” said ACM President Alexander L. Wolf. “In 1976, Diffie and Hellman imagined a future where people would regularly communicate through electronic networks and be vulnerable to having their communications stolen or altered. Now, after nearly 40 years, we see that their forecasts were remarkably prescient.” “Public-key cryptography is fundamental for our industry,” said Andrei Broder, Google Distinguished Scientist. “The ability to protect private data rests on protocols for confirming an owner's identity and for ensuring the integrity and confidentiality of communications. These widely used protocols were made possible through the ideas and methods pioneered by Diffie and Hellman.” Cryptography is a practice that facilitates communication between two parties so that the communication will be kept private and authenticated from a third party trying to read or alter what is being communicated. From ancient times, cryptography has been achieved through encryption, the conversion of readable information into gibberish that only a select few can decipher. In its earliest incarnations, encryption might have involved substituting one letter for another or rearranging the order of letters in the message. The development of radio in 1903, followed a decade later by World War I, gave cryptography a central role it never had before. At the same time, the development of electricity and machining allowed the development of machines that could encrypt far more securely than any human could. The post-World War I period saw the development of a number of enciphering machines that matured over the next 20 years and became the backbone of World War II cryptography. After the war, the development of computer technology led to faster and more secure cryptography by purely electronic machines. In encryption, a “key” is a piece of information used to transform readable plain text into garbled incomprehensible cipher text. Encryption is much like keying a lock to accept a particular key and decryption is like using the key to open the lock. In the past, when two parties were seeking to establish secure communications, they needed to have identical keys. Supplying these keys—key management— was a major limitation of the flexibility of encrypted communications. Two significant shortcomings of symmetric cryptosystems are the need for a secure means of key transfer and, because both parties have the same key, one could forge a message to oneself, claiming it came from the other. In addition, overuse of a particular key may provide an opponent with sufficient ciphertext to break the cryptosystem (i.e., discover the key). To limit the number of parties sharing the same key, separate keys are often distributed to each pair of communicating parties, posing additional key management challenges. In “New Directions in Cryptography,” Diffie and Hellman presented an algorithm that showed that asymmetric or public-key cryptography was possible. In Diffie and Hellman's invention, a public key, which is not secret and can be freely distributed, is used for encryption, while a private key, that need never leave the receiving device, is used for decryption. This asymmetric cryptosystem is designed in such a way that the calculation of the private key from the public key is not feasible computationally, even though one uniquely determines the other. Reversing the process provides a digital signature. The transmitter of a message uses a private key to sign the message, while the receiver uses the transmitter’s public key to authenticate it. Such digital signatures are more secure than written signatures because changing even one word of the message invalidates the signature. In contrast, a person’s written signature looks the same on a $10 check and a $1,000,000 check. Any user of the World Wide Web is likely to be familiar with the use of public-key cryptography to establish secure connections. A typical secure URL begins with “https,” where the “s” means that the Secure Transport Layer protocol will be used to encrypt the communication. The secure connection is established using a combination of public-key cryptography to transport a key with symmetric cryptography that is used to encrypt subsequent communications. In addition to laying the foundation for today’s online security industry and establishing cryptography as a leading discipline within computer science, Diffie and Hellman’s work made encryption technologies accessible to individuals and companies
  • A new dawn of Cryptography

    The new method creates truly random numbers with less computational effort than other methods, which could facilitate significantly higher levels of security for everything from consumer credit card transactions to military communications.


    Computer science professor David Zuckerman and graduate student Eshan Chattopadhyay will present research about their method in June at the annual Symposium on Theory of Computing (STOC), the Association for Computing Machinery's premier theoretical computer science conference. An invitation to present at the conference is based on a rigorous peer review process to evaluate the work's correctness and significance. Their paper will be one of three receiving the STOC Best Paper Award.

    "This is a problem I've come back to over and over again for more than 20 years," says Zuckerman. "I'm thrilled to have solved it."

    Chattopadhyay and Zuckerman publicly released a draft paper describing their method for making random numbers in an online forum last year (http://eccc.hpi-web.de/report/2015/119/). In a field more accustomed to small, incremental improvements, the computer science community hailed the method, suggesting that, compared with earlier methods, this one is light years ahead. Oded Goldreich, a professor of computer science at the Weizmann Institute of Science in Israel, commented that even if it had only been a moderate improvement over existing methods, it would have justified a "night-long party."
    "When I heard about it, I couldn't sleep," says Yael Kalai, a senior researcher working in cryptography at Microsoft Research New England who has also worked on randomness extraction. "I was so excited. I couldn't believe it. I ran to the (online) archive to look at the paper. It's really a masterpiece."
    The new method takes two weakly random sequences of numbers and turns them into one sequence of truly random numbers. Weakly random sequences, such as air temperatures and stock market prices sampled over time, harbor predictable patterns. Truly random sequences have nothing predictable about them, like a coin toss.

    The new research seems to defy that old adage in computer programming, "Garbage in, garbage out." In fact, it's the latest, most powerful addition to a class of methods that Zuckerman pioneered in the 1990s called randomness extractors.

    Previous versions of randomness extractors were less practical because they either required that one of the two source sequences be truly random (which presents a chicken or the egg problem) or that both source sequences be close to truly random. This new method sidesteps both of those restrictions and allows the use of two sequences that are only weakly random.

    An important application for random numbers is in generating keys for data encryption that are hard for hackers to crack. Data encryption is critical for making secure credit card purchases and bank transactions, keeping personal medical data private and shielding military communications from enemies, among many practical applications.

    Zuckerman says that although there are already methods for producing high-quality random numbers, they are very computationally demanding. His method produces higher quality randomness with less effort.
    "One common way that encryption is misused is by not using high-quality randomness," says Zuckerman. "So in that sense, by making it easier to get high-quality randomness, our methods could improve security."
    Their paper shows how to generate only one truly random number -- akin to one coin toss -- but Zuckerman's former student Xin Li has already demonstrated how to expand it to create sequences of many more random numbers.

    The website where Zuckerman and Chattopadhyay posted their draft last summer, called the Electronic Colloquium on Computational Complexity, allows researchers to share their work and receive feedback before publishing final versions in journals or at conferences. Computer scientists and mathematicians have been carefully reviewing the article, providing suggestions and even extending the method to make it more powerful.
  • 10 Simple Steps to Become Hacker

    1. Learn LINUX/ UNIX

    UNIX/LINUX are open source operating system. These operating systems are more secure then windows. UNIX was first developed by AT&T in Bell labs and contributed a lot in the world of security. LINUX is successor of UNIX. You should install LINUX freely available open source versions on your desktops as without learning UNIX/LINUX, it is not possible to become a hacker.

    2. Learn networking concepts

    Hacker should be good in networking concepts and understanding how the networks are created. To explore the loop holes in communication system, hacker should know the differences between different types of networks and must have a clear understanding of TCP/IP and UDP. Understanding of firewall is also very important.


    You must have a clear understanding and use of network tools such as Wireshark, NMAP for packet analyzing, network scanning etc.


    3. Coding in C language

    C programming is the base of all programming language, it is also base of learning UNIX/LINUX as these operating systems is coded in C programming which makes it the most powerful language as compared to other programming languages. To become a hacker you should master C language.

    4. Coding in more then one programming language

    It is important for a person in the hacking field to learn more than one programming. As different programming language have their own pros and cons. There are many programming languages to learn such as Python, JAVA, C++. One can easily learn about these languages online.



    5. Knowledge of different operating systems
    It is essential for a hacker to learn more than one operating system.  Every system has a loop hole, hacker needs it to exploit it.



    6. Knowledge of cryptography
    Encryption and Decryption are important skills in hacking. Encryption is widely done in several aspects of information system security in authentication, confidentiality and integrity of data. Decryption is used to recover encrypted data. Which is essential for hacking.


    7. Write vulnerability (Loop hole program)

    Vulnerability is the weakness of system, loop hole or open door through which you enter the system. Look for vulnerabilities by scanning the system, network etc. Try to write your own and exploit the system.


    8. Be a part of open source project

    An open source computer security project helps you a lot in polishing and testing your hacking skills. Some organizations such as MOZILLA, APACHE offer open source projects. Contribute and be a part of them even if your contribution is small, it will add a big value to your field.



    9. Habit of experimenting

    After learning some concepts, sit and practice them. You need a good computer system to start with as some tools may require powerful processor, RAM etc. Try different possible methods some will definitely give result. 


    10. Join different forums of hacking & meet hackers

    Most important for a hacker is to make a community or join forums, discussions with other hackers worldwide, so that they can exchange and share their knowledge and work as a team. Join different groups on social networking sites related to hacking where you can get more from experts.





  • Cryptographic system lets users control access to their data

    Most people with smartphones use a range of applications that collect personal information and store it on Internet-connected servers -- and from their desktop or laptop computers, they connect to Web services that do the same. Some use still other Internet-connected devices, such as thermostats or fitness monitors, that also store personal data online.


    Generally, users have no idea which data items their apps are collecting, where they're stored, and whether they're stored securely. Researchers at MIT and Harvard University hope to change that, with an application they're calling Sieve.
    With Sieve, a Web user would store all of his or her personal data, in encrypted form, on the cloud. Any app that wanted to use specific data items would send a request to the user and receive a secret key that decrypted only those items. If the user wanted to revoke the app's access, Sieve would re-encrypt the data with a new key.
    "This is a rethinking of the Web infrastructure," says Frank Wang, a PhD student in electrical engineering and computer science and one of the system's designers. "Maybe it's better that one person manages all their data. There's one type of security and not 10 types of security. We're trying to present an alternative model that would be beneficial to both users and applications."
    The researchers are presenting Sieve at the USENIX Symposium on Networked Systems Design and Implementation this month. Wang is the first author, and he's joined by MIT associate professors of electrical engineering and computer science Nickolai Zeldovich and Vinod Vaikuntanathan, who is MIT's Steven and Renee Finn Career Development Professor, and by James Mickens, an associate professor of computer science at Harvard University.
    Selective disclosure
    Sieve required the researchers to develop practical versions of two cutting-edge cryptographic techniques called attribute-based encryption and key homomorphism.With attribute-based encryption, data items in a file are assigned different labels, or "attributes." After encryption, secret keys can be generated that unlock only particular combinations of attributes: name and zip code but not street name, for instance, or zip code and date of birth but not name.
    The problem with attribute-based encryption -- and decryption -- is that it's slow. To get around that, the MIT and Harvard researchers envision that Sieve users would lump certain types of data together under a single attribute. For instance, a doctor might be interested in data from a patient's fitness-tracking device but probably not in the details of a single afternoon's run. The user might choose to group fitness data by month.
    This introduces problems of its own, however. A fitness-tracking device probably wants to store data online as soon as the data is generated, rather than waiting until the end of the month for a bulk upload. But data uploaded to the cloud yesterday could end up in a very different physical location than data uploaded by the same device today.
    So Sieve includes tables that track the locations at which grouped data items are stored in the cloud. Each of those tables is encrypted under a single attribute, but the data they point to are encrypted using standard -- and more efficient -- encryption algorithms. As a consequence, the size of the data item encrypted through attribute-based encryption -- the table -- is fixed, which makes decryption more efficient.
    In experiments, the researchers found that decrypting a month's worth of, say, daily running times grouped under a single attribute would take about 1.5 seconds, whereas if each day's result was encrypted under its own attribute, decrypting a month's worth would take 15 seconds.
    Wang developed an interface that displays a Sieve user's data items as a list and allows the user to create and label icons that represent different attributes. Dragging a data item onto an icon assigns it that attribute. At the moment, the interface is not particularly user friendly, but its purpose is to show that the underlying encryption machinery works properly.
    Blind manipulation
    Key homomorphism is what enables Sieve to revoke an app's access to a user's data. With key homomorphism, the cloud server can re-encrypt the data it's storing without decrypting it first -- or without sending it to the user for decryption, re-encryption, and re-uploading. In this case, the researchers had to turn work that was largely theoretical into a working system.
    "All these things in cryptography are very vague," Wang says. "They say, 'Here's an algorithm. Assume all these complicated math things.' But in reality, how do I build this? They're like, 'Oh, this group has this property.' But they don't tell you what the group is. Are they numbers? Are they primes? Are they elliptic curves? It took us a month or so to wrap our heads around what we needed to do to get this to work."
    Of course, a system like Sieve requires the participation of app developers. But it could work to their advantage. A given application might provide more useful services if it had access to data collected by other devices. And were a system like Sieve commercially deployed, applications could distinguish themselves from their competitors by advertising themselves as Sieve-compliant.
  • A milestone in Encryption

    World’s first scalable quantum computer has been designed and constructed by researchers at MIT and University of Innsbruck, it is going to be a milestone in encryption and security technology.'
     

    MIT Professor Peter Shor’s algorithm (1994) was carried out using laser pulses and atoms. It used 5 atoms and each of them was able to correctly factor 15. Together these atoms are so designed that they can factor much larger numbers, making it the only system that is capable of scaling Shor’s Algorithm.


    Isaac Chuang, professor at MIT, says that, “The algorithm is the most complex quantum algorithm known, but it can be upgraded in a laboratory setting”.Chuang had designed a computer in 2001 based on a molecule that could be held manipulated through nuclear magnetic resonance to factor the number 15. Those results were not scalable.


    Unlike traditional computing, which relies on 0s and 1s to carry out algorithmic instructions, quantum computing relies on qubits, which are atomic-scale units that can be 0 and 1 simultaneously, a state known as "superposition." That allows a supercomputer to carry out two separate lines of instructions at the same time, for example."We've been hearing about quantum computers for many years and the concerns about how they may be able to break existing encryption schemes," said Steve Pate, chief architect at HyTrust.


    "3DES -- pronounced trip-DES -- is a mode of the DES encryption algorithm that encrypts data three times. Three 64-bit keys are used, instead of one, for an overall key length of 192 bits. The first encryption is encrypted with a second key, and the resulting cipher text is again encrypted with a third key," Pate explained."This improves the security of the algorithm and uses a larger key size but makes the overall encryption/decryption time longer," he said.


  • WHAT WE DO

    We've been developing corporate tailored services for clients for 30 years.

    CONTACT US

    For enquiries you can contact us in several different ways. Contact details are below.

    RUDER FINN INDIA

    • Street :Unit 001A, Tower B, Ground Floor, Global Business Park, MG Road, Gurgaon – 122002, INDIA
    • Person :Radha Roy
    • Phone :91 124 388 2870
    • Country :India
    • Email :royr@ruderfinnasia.com

    Radha Roy.

    Radha Roy Country Head 91 124 388 2870 royr@ruderfinnasia.com Unit 001A, Tower B, Ground Floor, Global Business Park, MG Road, Gurgaon – 122002, INDIA