Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8450627
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 10, 20262026-06-10T11:01:12+00:00 2026-06-10T11:01:12+00:00

update! if so, the NEW Q will be: what is the strongest encryption algorithm

  • 0

update!

if so, the NEW Q will be:

what is the strongest encryption algorithm ? (no time limits)
note that the algorithm can Not make more letters than the input

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-10T11:01:14+00:00Added an answer on June 10, 2026 at 11:01 am

    http://en.wikipedia.org/wiki/One-time_pad

    If your requirements are complete security and not increasing the length of the message at all, then it is possible to do this using a one-time-pad implementation.

    Your key material needs to be:

    1. completely random
    2. the same length as your message
    3. never divulged
    4. never reused

    If you are able to do these 4 things, then you can achieve maximum security without increasing your message length.

    Your ability to implement this depends on your requirements. At the point you have done 1-4 above, you have not lessened the problem of key exchange (if indeed that is needed).

    Read the linked article, and it will explain in good detail.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

EntityManager.merge() can insert new objects and update existing ones. Why would one want to
I'm fairly new to C++, but my understanding is that a #include statement will
We're embarking on a new middle tier service that will allow internal client systems
I have a datagridview with 10 columns. Every month the user will update new
I can't use shutdown() and awaitTermination() because it is possible new tasks will be
What I want: Update all new commits from server with my local repository in
12:18:55,541 INFO [UpdateChecker] New update(s) found: 2.0.0 [ http://ehcache.org/news.html] How do I suppress ehcache
Here is my desired transaction order: User1 select field, perform operation, update with new
This is the new code with the update from capdragon, but now it would
button.setOnClickListener(new OnClickListener() { @Override public void onClick(View v) { db.update(); } }); On line

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.