text:
Here is a listing and bio information for the 2012 spring football walk-ons (courtesy of USC sports information):
No. Name Pos. Hgt. Wgt. Birthday Cl.(Ath/Ac) Exp. Hometown (High School/JC/College)
36 AKIBA, John TB 5-8 190 8/5/90 Jr.*/Sr. -- Mission Viejo (Mission Viejo/Saddleback JC)
54 ARAKELIAN, Michael DE 6-1 210 10/26/90 Jr.*/Sr. -- Anaheim (Orange Lutheran/Chapman)
44 AVIV, Yonatan FB 6-0 270 7/25/90 So.*/Jr. -- Los Angeles (Yula)
26 DARLIN, Spencer WR 5-10 175 2/12/92 So.*/Jr. -- Encinitas (La Costa Canyon)
84 DOWNEY JR., Kevin TE 6-3 210 8/27/90 Jr.*/Sr. -- West Hills (El Camino Real/Pierce JC)
28 FU, Kevin WR 6-3 170 6/12/92 So.*/Jr. -- San Jose (Harker)
40 HUGHES, Brett WR 6-2 195 5/22/93 Fr.*/So. -- Mountain View (Mountain View)
38 JOLIN, Taylor S 6-2 195 12/26/91 So.*/Jr. -- San Diego (La Costa Canyon)
91 KUSNIR, Zack DT 6-5 250 2/6/89 Sr.*/Sr. SQ La Jolla (La Jolla Country Day/San Diego St.)
41 MATRANGA, Eric WR 5-10 180 1/13/90 Sr.*/Sr. TR Carmichael (Jesuit/San Joaquin Delta JC/Glendale JC)
46 SIMMONS, Hunter FB 6-1 240 9/20/90 Jr.*/Sr. 1V Pasadena (Loyola)
49 SUTTON, Christian CB 5-10 185 6/25/93 Fr.*/So. TR Suwanee, GA (North Gwinnett/Point)
27 TOBER, William CB 5-9 170 10/3/90 Jr.*/Sr. -- San Clemente (San Clemente)
49 UCHE, Chidozie WR 5-10 180 8/18/90 Sr.*/Sr. -- London, England (Strake Jesuit)
Junior College: As a 2010 sophomore running back at Saddleback Junior College in Mission Viejo (Calif.), he ran for 191 yards on 49 carries (3.9 avg.) with 3 TDs, caught 5 passes for 25 yards (5.0 avg.), had 2 kickoff returns for 16 yards (8.0 avg.) and made 2 tackles. He made the 2010 Southern California Football Association Scholar Team. As a 2009 freshman, he had 57 yards on 14 carries (4.1 avg.) and caught 5 passes for 90 yards (18.0 avg.) with 1 TD. High School: He was a 2008 All-South Coast League second team pick as a senior fullback at Mission Viejo (Calif.) High. He ran for 129 yards on 23 carries (5.6 avg.) with 2 TDs and caught 6 passes for 80 yards (13.3 avg.) with 2 TDs as a senior. As a 2007 junior, he had 109 yards on 22 carries (5.0 avg.) with 1 TD and caught 10 passes for 90 yards (9.0 avg.). Personal: He also plays rugby. He speaks fluent Japanese.
College: He started at defensive end as a 2009 freshman at Chapman, getting 31 tackles, including 2 for losses, plus 2 fumble recoveries and a blocked kick. High School: He played defensive end and tight end at Orange (Calif.) Lutheran High. As a 2007 junior, he had 33 tackles with 4 sacks.
High School: He played basketball at Yula High in Los Angeles (Calif.).
High School: He was a running back as a 2009 senior at La Costa Canyon High in Carlsbad (Calif.). He also was on La Costa Canyon's track team, competing in the sprints, hurdles, long jump and shot put.
2011: He joined the USC team in the spring of 2011 as a sophomore walk-on tight end, but was not on the team in the fall of 2011. Junior College: He attended Pierce Junior College in Woodland Hills (Calif.) before transferring to USC. High School: He had 5 sacks, 2 deflections and 1 fumble recovery as a 2008 senior defensive and offensive lineman at El Camino Real High in Woodland Hills (Calif.). He had 2 sacks as a 2007 junior.
High School: He earned All-Bay Football League second team honors as a 2009 senior running back, wide receiver, defensive back and defensive lineman at Harker High in San Jose (Calif.). As a 2008 junior, he ran for 113 yards on 13 carries (8.7 avg.), caught 2 passes for 17 yards (8.5 avg.) with 1 TD, returned 6 kickoffs for 156 yards (26.0 avg.) and made 11 tackles with 4 sacks. He also played volleyball at Harker.
High School: He was named All-San Jose Mercury News honorable mention and All-Santa Clara Valley Athletic League El Camino Division Most Outstanding Wide Receiver as a 2010 senior wide receiver and defensive back at Mountain View (Calif.) High. He had 32 receptions for 561 yards (17.5 avg.) with 6 TDs in 2010. He made the All-League first team as a 2009 junior. He also played basketball at Mountain View.
High School: He played football and baseball (pitcher and outfielder) at La Costa Canyon High in Carlsbad (Calif.). Personal: He has been a member of USC's club crew team. He has played guitar in rock bands.
2012: He is petitioning for a sixth year of eligibility because of injuries earlier in his career. 2011: He was a walk-on defensive tackle as a senior in 2011. He appeared briefly in 4 games in 2012 (Syracuse, Arizona State, Colorado, Washington), but he did not make a tackle. 2010: He joined the USC team in the spring of 2010 as a junior walk-on tight end, but did not see any action in 2010. San Diego State: He redshirted as a 2007 freshman quarterback at San Diego State. High School: He attended Whitfield High School, but competed in football, basketball and baseball for La Jolla (Calif.) Country Day as a 2006 senior...He was a 2-time All-League first team in baseball. Personal: His father, Michael, played football at Clarion University.
Junior College: He was an infielder at San Joaquin Delta Junior College in Stockton (Calif.) in 2010 (hitting .182) and at Glendale (Calif.) Junior College in 2011 (hitting .286). High School: He was an infielder at Jesuit High in Carmichael (Calif.), hitting .296 as a 2008 senior. Personal: He has been a member of USC's club baseball team.
2011: He was a walk-on fullback at USC as a sophomore in 2011 before leaving the team mid-season (he did not see any action). 2010: He played briefly in 4 games in 2010 at USC (Hawaii, Minnesota, Washington State and California) as a redshirt freshman walk-on fullback. 2009: He joined the USC team in the fall of 2009 as a first-year freshman walk-on fullback, but did not see any action in 2009. High School: As a 2008 senior at Loyola High in Los Angeles (Calif.), he had 33 tackles (with 3 sacks), 1 fumble recovery, 1 forced fumble and 1 blocked field goal as a defensive end and caught 5 passes for 45 yards (9.0 avg.) as a fullback. Personal: He was a member of the 2008 USA Under-18 National Rugby Team that competed in England.
College: He was a freshman defensive back at Point University in 2011. High School: He was a sprinter on the track team at North Gwinnett High in Suwanee (Ga.). He also played football at North Gwinett as a 2008 sophomore defensive. Personal: His grandfather ran track at Houston, his uncle played football at South Carolina, his father was a swimmer at Texas A&M and his cousin, Ashley, ran track at Ohio State.
High School: He had 40 tackles, 8 deflections, 1 interception and 1 forced fumble as a 2008 senior defensive back and wide receiver at San Clemente (Calif.) High. He had 3 tackles as a 2007 junior.
2011: He joined the USC team in the spring of 2011 as a junior walk-on wide receiver, but was not on the team in the fall of 2011. High School: He played soccer at Strake Jesuit High in Houston (Tex.). Personal: He is a native of London, England.


text:
To our loyal lovers of all that is exceptional,
We recognize and support your demand for the outstanding.
It is your standard for the superior in life that motivates our valuable customer service, the range of
design services we offer, and our dedication to the total beautification of your home. Our furniture and home
improvement resources are some of the best in the world, and it seems rather selfish not to share every detail
of the splendid things we know with you– through this very blog. Look forward to reading about designer tips from our own outstanding interior design team, the history behind the furniture you love and new trends in and out of the home. With this blog we hope to inspire, excite, and ignite your passion for all that is luxurious.
Our best,
Sheffield Furniture & Interiors

subset: commoncrawl


text:
Logo design: One line or one band ; Thick lines, bands ; Broken lines or bands (except A 26.11.13) ; Curved lines or bands (except A 26.11.13)
The European Union Trademark for ASQ (Figurative) was filed on 21.12.2001 for goods and services in class(es) 35 at the European Union Intellectual Property Office (EUIPO). The current status of the trademark No. 002512168 ASQ is 'registered'.


text:
Dead dog offered credit card
Desperate hunt for 'trapped cat' in 30-storey tower block due to be blown up
Thieves steal dead dog's diamond collar from pet cemetery
Man accused of killing and eating neighborhood pets
DOGTV The First Television Channel for dogs
Westminster Kennel Club Dog Show: Pet-Friendly Hotels In New York City
Dog From Above Bears Striking Resemblance To Certain Body Part
First Lady And Dog Bo Welcome Surprised School Kids At White House
Mirror, signal, manoeuvre
Vain Cat
They Call it Puppy Love and These Pets Have Got it!
Malachy, The Pekingese Who Won Best in Show: Big Pic
The Dog Walkers Of Buenos Aires (PHOTOS)
Festus the Three-Legged Therapy Dog
Animal Misconceptions That May Surprise You
Zimbabwe Tortoises Eaten By Chinese Tourists
Bouba Ndjida National Park Elephants Killed In Poaching Spree, Activists Claim
Entire Village in India Relocates to Make Room For Tigers
Fossil Footprints Reveal Oldest Elephant Herd
Trossachs barn owl numbers boosted by 'vole feast'
Animals Doing People Things
25 Goats Riding on Horses
Dormouse saved after walking into tea shop
Plastic peril duck saved - by a duck
The Hyrax – The Elephant's Cousin
As Bear Population Grows, More States Look At Hunts
Pictures: New Amphibians Without Arms or Legs Discovered
Why Some Poison Frogs Taste Bittersweet When Licked
Pictures: Miniature Chameleons Discovered—Fit on Match Tip
Goat kids can develop 'accents'
Crime chiefs agree to get tough on illegal tiger trade
Goodness Snakes! Sociable Rattlers Cuddle With Their Kin
Image Gallery: The Social Lives of Rattlesnakes
Australia's Struggling Marsupial: Photos of the Tasmanian Devil
Tasmanian Devil Cancer Traced Back to 'Immortal' Devil Girl
Flight Record: Songbirds Trek 9,000 Miles to Africa
The week in wildlife – in pictures
Angry birds? These lost species have every right to be...
Rats! Clever, Caring and Incredibly Cute
The World's Strangest Animals
Husky's Sad Ordeal in Wolf Trap Highlights the Horrors of Predator Control
The Week in Animal News: Inspiring Penguin Love, Rhesus Monkeys Gone Wild and More
Animal Rights In China Get Boost From Celebrity Activists And Shifting Attitudes
Dalmatian Pelicans In Caspian Sea Fed After Water Freezes
Animal Photos Of The Week
Otter Casts Worries To The Heavens, Prays
Ringling Brothers Bullhook Use Will Not Be Blocked In Atlanta Despite Local Ban
This Week's Adorable Adoptable Animals: Bunnies
Maryland's Turtles, Tadpoles, Salamanders Face Deadly Virus
Ambergris, Sperm Whale Poop, Is Almost Literally Worth Its Weight In Gold
Scientists Thrilled With Rare Whale's Remarkable Journey
Nurse shark birth captured on camera in China
'Abyss Box' to keep deep animals
Beluga whale sightings in SNH marine renewables report
Sea lion test to probe declines
Why Are So Many Dolphins Beaching Themselves?
Cuttlefish Use Humanlike Vision to Choose Camouflage
Turtles 'face extinction' without marine protection
Sea lions: not big Shakira fans
Threats to Whales You Can Help to Prevent
Coral Reef Cam Shows Where Large Fish Hang Out
Bangladesh Establishes New Sanctuaries to Protect Endangered River Dolphins
Even Sharks Make Friends
KE18 Hawaiian Monk Seal Sent To Waikiki Aquarium To Save Species
Spider Vs Wasp: A Deadly Battle in Pictures
Save our bees: scientists reveal the plants that could halt bee decline
Primitive and Eyeless, World's Deepest Land Animal Discovered Ants remember their enemy's scent
Flies Get Drunk to Kill Off Parasites
Pair of Male Gorillas Escape Zoo Enclosure Looking For Romance
Pittsburgh Zoo's New Baby Gorilla Is First Born There Since 2001


text:
Make your brand shine with our beautiful, customizable and self-managed listings.
Whether people are looking for your business on desktop or mobile devices, we're ready.
Make your business easy-to-find by selecting up to 12 business sub-categories.
Connect with our diverse & loyal user base. You can post unlimited job openings on our board.
Have a special offer you'd like to share? You can post unlimited offers to our special offers section.
Let our users know what events your company has coming up by posting to our member calendar.
You can earn user reviews that will make your business listing stand out from your competition.
We make getting foot traffic to your location easier by linking every listing to Google Maps.
Keep the conversation going by linking your social media profiles to your business listing.
Link an ad, introductory or how-to-video to directly to your business listing. It's easy! You can post unlimited videos.
Upload your swanky promotional brochure directly to your business listing.
Receive user messages directly from your business listing via our messaging platform free of charge.
According to the Professional Diversity Network despite the challenges of accurately counting LGBT members in the workforce, estimates and statistics offer positive news about their employment.
And here in Arizona, based on our State of LGBTQ Arizona Report:


text:
How much does Yuuri know?
Here's something I've been wondering for a while.
In Barcelona, Victor finds out that Yuuri doesn't remember the banquet.
They're in a public place, they're with their friends, and the situation is hilarious for almost everyone else, except it's annoying for Yuri P., awkward and embarrassing for Yuuri, and if I have to guess I'd say that it's awkward, slightly painful and a bit frustrating for Victor (though he probably also finds it a bit funny).
It's really not the right place and time for Victor and Yuuri to talk about it in depth, especially considering that the focus shifts right away to the rings they're wearing and their meaning.
After JJ makes his entrance, they all leave and presumably go back to the hotel, where we can only assume Yuuri had more questions about the banquet. And this is exactly what I've been wondering about.
Does Yuuri ask Victor for banquet details? Does Victor talk about it of his own accord?
I like to think that Victor does in fact share some things about that evening:
My question is: does Victor share The Moment? You know, this one?
The Moment all our hearts collectively broke because Victor had been pining over Yuuri since before going to Hasetsu. The Moment Victor fell in love.
Because we watch the rest of the show with the new knowledge that Victor was in love (or had a major crush at the very least) with Yuuri, I think we all kind of assumed that Yuuri must also know the full extend of it.
But does he?
Does Victor really tell Yuuri all of it? The way I see it, there are two options:
- Victor tells Yuuri everything. How smitten he was with Yuuri. How much it hurt when he didn't call him, didn't send any signals, didn't show up at competitions. And finally, how he thought that video was a direct message for him to go to Hasetsu and make good on his promise to be Yuuri's coach. And how it confused the hell out of him when Yuuri acted all shy around him.
Now, I'm not a huge fan of this option. Victor has known Yuuri for a while at this point, and he knows about his anxiety and his low self-esteem. He has a big competition ahead of him, and he doesn't need Victor adding to his anxiety by telling him how he (unintentionally) hurt him by leading him on, seducing him and abandoning him just like in the Eros story he tells in his SP.
- Victor only shares the bare minimum. He tells Yuuri that coming to Hasetsu to be his coach wasn't, in fact, a decision made on a whim, but it was something Yuuri (drunkenly) asked him. And because Victor was getting bored with his skating and his life, he was glad to do it, and glad that this made it possible for them fall in love with each other. What he doesn't share is the pining and the hurt.
I personally think that this is what happened, because Victor has learned how sensitive Yuuri is (even though he still doesn't fully know how Yuuri truly feels about Victor leaving ice skating - something he finds out at the end of episode 11). He doesn't need Yuuri to know he unintentionally hurt him, because it doesn't matter anymore, and telling him would only hurt Yuuri, and that's the last thing Victor wants.
TL;DR: we know exactly when Victor fell in love with Yuuri but Yuuri probably doesn't know.


text:
Go-Go Babyz vs Harness Backpack
Hi Ladies :smile:
My self and my two daughters (both under the age of six years) will be traveling over to Australia from the States in about 4-5 weeks, we are moving over as this is my home country.
I will be taking my youngest who is 3 yrs old, Britax Marathon with me, it will be just myself and my two daughters, so I know its going to be big and bulky to carry, not to mention keeping an eye on two little girls :(
So I have been reading allot about the Go-Go Babyz Travelmate car seat carrier, and seriously considering purchasing it, at least this way I can harness Abi in the car seat whilst pulling the GoGo Babyz, and only really have to keep an eye on my 5yr old.
Or get a harness backpack, and a Britax car seat cover so I can have it checked in with our luggage, and then Abi and can walk with us, but I have the harness on her so I don't have to chase her around the airport.
I have traveled with Alex (my 5yr old) over to Australia, all though she was only 6 months old at the time and it was much easier. But right now I am feeling overwhelmed with the thought of this :(
So any thoughts, experiences, we should be flying either Qantas or Air NZ.
|All times are GMT -7. The time now is 11:17 PM.
Powered by vBulletin® Version 3.8.9
Copyright ©2000 - 2017, vBulletin Solutions, Inc.
Search Engine Optimization by vBSEO 3.6.0
Copyright © 2003-2012 JustMommies.com, All Rights Reserved.


text:
Send to a Friend
Can the general public trace my IP address on FaceBook?
Asked by pleiades (6571) July 10th, 2014
I have an anonymous guise on FaceBook which I use for my record collecting comments. I don't want anyone to know my location, can they find my location simply by looking up my profile? I currently have nothing related to my address…
And trust me! I'm not being sketch or anything, I just don't want the record labels to know who's asking since I'm about 95% sure that I'm the only one from my specific city who orders all the time from these record labels and I don't want them to put a face to the name.
Thanks in advance!
Using Fluther


text:
For more Consultants Inspiration:
Check out our boards on Pinterest
Elite Circle Professionals are tried, tested and recommended!
Stay current with our Blog
Get up to date information on Facebook, Twitter and Instagram
Your Altar Ego
Revel in the Fun; Consultants Have You Covered
Photography courtesy of: Jennifer Bowen Photography
Designing an event that will reflect your lives, your story and your future can be a lot of fun, but it can also feel like a lot of pressure.
One of the best ways to craft a personal celebration is to enlist the help of an event planner. While many people imagine a planner following a checklist and keeping the day moving smoothly (which is true), one of the most significant benefits of hiring a consultant is to take advantage of his or her ability to help shape your celebration into a day that is representative of the two people who are getting married.
To get the rest of the story, pick up a copy of our latest
issue at one of these fine establishments
Featured Wedding Professionals:
Copyright © 2000-2017, Phoenix Weddings by Phoenix Bride & Groom, All Rights Reserved.
Website designed by SC Developments / Phoenix Bride & Groom


text:
Fully Licensed & Bonded
Hotel Egido Via Lusitana is a newly constructed hotel, inaugurated in August 2003, and specialized in business clients. Hotel Egido Via Lusitana is situated in Madrid, just a step from the city centre and the Islazul shopping and leisure centre. Hotel Egido Via Lusitana has 65 bedrooms of which 61 are doubles, or doubles for individual use, and 4 junior suites with an independent lounge. All the hotel has Wi-Fi internet access. The installations of the hotel are completed by the bar, cafeteria, restaurant, garden-terrace, a covered private car park and totally equipped rooms for meetings and banquettes. All the meeting rooms have TV and ADSL connections, and direct number telephone lines.


text:
Comedian Ron James brought his ultra-Canadian brand of comedy to CBC Hamilton for a live chat with the online audience Wednesday.
You can replay the conversation in the Cover It Live window on this page. Check back for a video of the chat.
James worked with the Second City troupe in Toronto in the 1980s. He has appeared at Montreal's Just For Laughs festival as a headliner with his own show. Since 2009, he has starred in The Ron James Show on CBC Television, airing Wednesdays at 8:30 p.m. EST.


text:
I love this game but after the last couple of updates the graphics have lost their crisp look and are blurry. This has remained even after the update that attempted to bring back the classic look. Even after a minute of playing I start to feel some eye strain because it looks as though the graphics are out of focus. This makes the game unplayable.
Does anyone else have this problem? I am using the iPad 3.


text:
Blog Archives
Festifall Arts Festival – October 2, 2016
On Sunday, October 2, the Mint Julep Jazz Band will be performing on the main stage at Chapel Hill's Festifall Arts Festival! Come dance, check out all the great vendors, artists, bands, and food trucks, and enjoy the fall weather with us. The festival is free and the band plays a set on the main stage (near the Franklin Hotel) from 1:55 p.m. to 2:55 p.m.
For more information visit the Festifall website: http://www.chapelhillfestifall.com/
Knoxville Lindy Exchange 2015
On Friday, September 25, 2015, we'll head west, over the mountains to Tennessee for the Knoxville Lindy Exchange! This weekend's live music lineup features some great swing bands based in the Southeast, including the Gamble Wilson Swing Orchestra (Asheville/Hendersonville), Michael Gamble and his Rhythm Serenaders (Asheville), Knoxville's own Scruffy City Syncopators, and yours truly representing Durham, NC. This promises to be a great swing dance event, come one come all from the corners of the southeast and beyond!
Our State Magazine – Music in the Library
The Mint Julep Jazz Band is excited to be invited to provide music for Our State Magazine's Music in the Library video series, which shares and highlights songs from North Carolina musical artists filmed at Our State Magazine's headquarters in Greensboro, North Carolina. We filled up their cozy library space with eight musicians, swing, and hot jazz on a hot June afternoon and the results came out great, using just three microphones and three cameras.
We are also featured in the magazine's August issue – pick one up from your local North Carolina newsstand!
The band recorded "Swingtime in Honolulu," "Rock it for Me," and our original tune (composed by alto/clarinet/soprano sax mad man, Keenan McKenzie) "Miami Boulevard" – visit the Our State YouTube channel for all the videos from this series!
Videos from February 1, 2014 TSDS Dance
We are very excited to have some updated videos of the Mint Julep Jazz Band – thanks to Ashley Warren, our videographer, who got some great footage at our performance for the Triangle Swing Dance Society's dance at the Murphey School in Durham on February 1! Six new videos posted below:
"Rockin' in Rhythm" performed by the Mint Julep Jazz Band at the Triangle Swing Dance Society dance, February 1, 2014.
"Betcha Nickel" performed by the Mint Julep Jazz Band at the Triangle Swing Dance Society dance, February 1, 2014.
"Undecided" performed by the Mint Julep Jazz Band at the Triangle Swing Dance Society dance, February 1, 2014.
"Sugarfoot Rag" performed by the Mint Julep Jazz Band at the Triangle Swing Dance Society dance, February 1, 2014.
"Besame Mucho" performed by the Mint Julep Jazz Band at the Triangle Swing Dance Society dance, February 1, 2014.
"Darktown Strutters Ball" (encore) performed by the Mint Julep Jazz Band at the Triangle Swing Dance Society dance, February 1, 2014.
Photos of Mint Julep Quintet at G2B from Ashley N. Warren Photography
Ashley Warren took some great photos of the band at our show at G2B Gastro Pub on January 10, 2014 – here are some of our favorites and you can check out the entire set at her website, Ashley N. Warren Photography.
Mint Julep Jazz Band on WUNC's The State of Things, November 22, 2013
We are excited to announce that the Mint Julep Jazz Band has been invited to appear on WUNC's The State of Things, hosted by Frank Stasio, on November 22, 2013 to help promote Housing for New Hope's inaugural Rent Party on November 23, 2013 at The Cookery in Durham (see post below). Tune in from noon to 1:00 p.m. to hear an interview and live music from the band – listen online or watch the live video stream!
Now, to figure out how to get 8 band members into a radio station studio… 🙂
All Balboa Weekend 2013
The Mint Julep Jazz Band's first big road trip is coming up this Friday, June 14, 2013 as we head to Cleveland, Ohio to perform at All Balboa Weekend! This is the longest-running, if not the largest, Balboa event in the world, and plays host to a number of competitions, dances, DJs, international instructors, live music, vendors, and other special events throughout the weekend. Needless to say, we are honored to be a part of their band lineup, along with Pittsburgh's Boilermaker Jazz Band, who is playing the Saturday night dance.
The Mint Julep Jazz Band is performing at the Friday night dance, from 9:00 p.m. to 1:00 a.m.!
For more information about the event, which runs from June 13-16, 2013, please visit http://www.allbalboa.com.
Streets at Southpoint Music on Main Concert Series, June 8, 2013
We are excited to be performing at the Music on Main Concert Series at The Streets at Southpoint on June 8, 2013. This free concert series is open to the public and occurs in the large open space with the fountain in front of Southpoint Cinemas.
Cinema Circle, in front of AMC Southpoint 17
8030 Renaissance Parkway
Durham, NC
6:00 p.m. to 8:45 p.m.
We'll see you there!
***RAIN PLAN*** If it rains, the show will move from the outdoor stage to inside the mall.


text:
FREE Fonts for St Patricks Day
I don't know about you but I am obsessed with fonts lately. I searched up some great ones for the up coming holiday. Here are some super cute FREE Fonts to use for your St Patricks Day posts! Enjoy!
Patrick King Arthur Irish Unci Brandegoris Clover Things Lombardic CelticMD Kelltika
To install the fonts see my directions on my Simple Scary Halloween Candles post.
~Check out more of my St. Patrick's Day Projects!
Simple St. Patrick's Day Wreath


text:
Quality CareFind out why Mayo Clinic is the right place for your health care. Make an appointment.
Meet the StaffFind a directory of doctors and departments at all Mayo Clinic campuses. Visit now.
Research and Clinical TrialsSee how Mayo Clinic research and clinical trials advance the science of medicine and improve patient care. Explore now.
Visit Our SchoolsEducators at Mayo Clinic train tomorrow's leaders to deliver compassionate, high-value, safe patient care. Choose a degree.
Professional ServicesExplore Mayo Clinic's many resources and see jobs available for medical professionals. Get updates.
Give to Mayo ClinicHelp set a new world standard in care for people everywhere. Give now.
See a list of Dr. Bu's publications on PubMed
Liu CC, Zhao N, Yamaguchi Y, Cirrito JR, Kanekiyo T, Holtzman DM, Bu G. Neuronal heparin sulfates promote amyloid pathology by modulating brain amyloid-β clearance and aggregation in Alzheimer's disease. Science Translational Medicine. 2016;8:332ra44.
Shinohara M, Kanekiyo T, Yang L, Linthicum D, Shinohara M, Fu Y, Price L, Frisch-Daiello JL, Han X, Fryer JD, Bu G. APOE2 eases cognitive decline during aging: Clinical and preclinical evaluations. Annals of Neurology. 2016;79:758.
Liu CC, Hu J, Tsai CW, Yue M, Melrose HL, Kanekiyo T, Bu G. Neuronal LRP1 regulates glucose metabolism and insulin signaling in the brain. The Journal of Neuroscience. 2015;35:5851.
Liu CC, Tsai CW, Deak F, Rogers J, Penuliar M, Sung YM, Maher JN, Fu Y, Li X, Xu H, Estus S, Hoe HS, Fryer JD, Kanekiyo T, Bu G. Deficiency in LRP6-mediated Wnt signaling contributes to synaptic abnormalities and amyloid pathology in Alzheimer's disease. Neuron. 2014;84:63.
Kanekiyo T, Xu H, Bu G. ApoE and Aβ in Alzheimer's disease: Accidental encounters or partners? Neuron. 2014;81:740.
Kanekiyo T, Cirrito JR, Liu CC, Shinohara M, Li J, Schuler DR, Shinohara M, Holtzman DM, Bu G. Neuronal clearance of amyloid-β by endocytic receptor LRP1. The Journal of Neuroscience. 2013;33:19276.
Liu CC, Kanekiyo T, Xu H, Bu G. Apolipoprotein E and Alzheimer's disease: Risk, mechanisms, and therapy. Nature Reviews Neurology. 2013;9:106.
Any use of this site constitutes your agreement to the Terms and Conditions and Privacy Policy linked below.
Mayo Clinic is a not-for-profit organization and proceeds from Web advertising help support our mission. Mayo Clinic does not endorse any of the third party products and services advertised.
A single copy of these materials may be reprinted for noncommercial personal use only. "Mayo," "Mayo Clinic," "MayoClinic.org," "Mayo Clinic Healthy Living," and the triple-shield Mayo Clinic logo are trademarks of Mayo Foundation for Medical Education and Research.


text:
Due to lucrative home buying options in plots and villas near the yamuna expressway the property is much in demand. Further because of plenty of space option numerous buyers are planning to move to these areas.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Yamuna Expressway Has Become First Choice
For Investors
With the growth of technology and internet facilities the real estate roots are going deeper and higher among the
peripheries of Delhi/NCR. Because of abundant of space and best connectivity the plots in yamuna expressway
area are much in demand for housing and commercial sector.
Gaursons India is a principal and renowned developer in the NCR construction market with their farsighted
approach. The brand has successfully crafted and delivered numerous eye catchy projects located at premium
location with full commitment. Being a popular name in the construction sector in India. The company has
successfully delivered high-quality structure in the Delhi/NCR region.
Furthermore there are many reasons why the area near Yamuna Expressway has gained enough
appreciation in terms of development of real estate. Here are the key reasons.
1. Location Advantage:- Buying plots near Expressway is very advantageous. This 165 kilometer long extend
stretch came into spotlight and pulled many top real estate developer to show off their creativity.
Nearness to Noida and Greater Noida, Ghaziabad are some of the additional benefit that fascinates enormous
home buyers and investors.
Better transportation and enhanced road network has shortened the travel time to Agra and adjoining areas.
Fortunately Gaursons India is one of the futurist developers who had constructed most innovative and luxurious
residential complex- Gaur Yamuna City at Yamuna Expressway just in front of F1 track & next to night safari which
exceeds the excitement of home buyers and developers to buy plots in this area.
2. Price Trends:- The affordable price of property is additional advantage of buying plots at Yamuna
Expressway. Thankfully today you will find 1000s of plots/villas in yamuna expressway within a reasonable price.
3. Green and clean Environment:- In the busiest life it is very difficult to find green and clean environment. The 2
bhk flats in yamuna expressway are well equipped with all the modern facilities. However, countries top builders
are planning to create incorporated townships and monstrous residential projects which attract investors more
towards this reason.
Since its inception the company has taken full care to protect the environment and natural surroundings, it had
crafted various environment-friendly infrastructures near Yamuna expressway with all the present and future
Contact Details:
Call: +91 9212-333-533
Website: http://www.gaursonsindia.com/township-projects/gaur-yamuna-city.php
Corporate Office
Gaur Biz Park
Plot No-1, Abhay Khand II, Indirapuram Ghaziabad-201014
Contact Details: +91-9212333533 or SMS: GAUR to 5303


text:
The Perry Daily Journal office is open Monday through
Friday, 8:00 a.m. 4:00p.m. to help you with your subscription order in
person or over the telephone.
Perry Daily Journal publishes Tuesday through Saturday and is delivered
through US post.
In Person:
Monday – Friday, 8:00 A.m. – 4:00 p.m. at 714 Delaware
Street, Perry, OK 73077
Circulation Department, P.O. Box 311, Perry, OK 73077
Click the logo above for printed subscription, electronic editions
and subscription rates
Specials: PDJ
will offer various specials during the year. Call PDJ 580-336-2222
or check our website
for current specials!
Delivery Problems:
Call 580-336-2222 if your paper has not arrived or if there are any
other problems with your paper.
PDJ offers a vacation package to all of its subscribers. Call the
office at 580-336-2222 and let us know when you plan to leave for
vacation and when you will return.
Copyright © 2009 - 2017 Perry Daily Journal. All Rights Reserved.


text:
Day Two--Moki and the Grand Canyon
North Rim Travel Blog› entry 4 of 8 › view all entries
We were up early and drove towards the lake. Our plan was to take the John Atlantic Burr Ferry (named for pioneer
From this point we got onto UT-276 and began our drive to the
We stopped at
We arrived at the North Entrance, and even though we already knew that we still had another 9 miles to go, we were still a bit disappointed that we weren't seeing the canyon yet. But it wouldn't be long now. The drive into the park saw more trees and prettier overall countryside. The sandstone features of south central
By the time we got setup it was not long until sunset. From the map we had gotten we saw that the Transept Trail was on the west side of this area, and sounded like a good place to watch the sunset over the canyon. So that is where we headed, to get our first good look at the canyon. It is hard to put into words the shear size of it. The feeling that you are small only compares when you gaze out into the ocean from a ship. The big difference here is that there so much to see. The ocean is just mile after mile of water. Peaceful and relaxing, Yes. But, you have to lose yourself in the churning of the water.
But we did move along. To get to the trail we had passed a general store, and we wanted to check hours and see what they sold. The exact details of both escape me, but Margo did notice a large area dedicated to moccasins. And as we were in Indian (Hopi) country, she brought up getting a pair. Sure, but not now.
The remainder of our evening was spent with dinner and getting the kids ready for bed. This campground featured pay showers. Margo was more than ready for one of those, but the kids got sponge baths, instead. Jolene didn't really appreciate the therapeutic powers of a shower yet. She was only 3, and Jessi obviously wasn't going to take one. But, that was pretty much it for the night. I think we picked up some snacks at the store, and some candy for Jolene, and bedded down for the night.


text:
A local advocacy group says state officials should do more to limit debt in Delaware Department of Transportation.
Lewes resident and former DelDOT Director of Highway Operations John Gilbert says increases in the gas tax and in public transit fare could create much-needed revenue for the department.
Delaware's Transportation Trust Fund Task Force was created in July 2010, when the fiscal year 2011 Bond Bill was signed by the governor. The task force conducted a five-month review, and, in March 2011, issued a number of recommendations to close the gap between revenues and the cost of capital programs in the Delaware Transportation Trust Fund – the primary funding source for public transportation, and construction and maintenance of roads and bridges.
Task force recommendations included transferring DelDOT operating costs from the Transportation Trust Fund back to the general fund over a period of time; increasing tolls, gas taxes and Department of Motor Vehicle fees; and creating new revenue streams.
Gilbert said legislators failed to take action on any of the task force's recommendations. He formed the Transportation Strategy Group in late 2011, with former DelDOT officials
Ray Harbeson and Joe Wutka, to advocate for the task force. The strategy group also issued its own recommendations to the state Joint Finance Committee and the Bond Bill Committee during public hearings in the last two years, including capping the amount of debt the fund can incur at 20 percent per year.
"We did talk to a couple legislators in the process, but there was really no formal response," Gilbert said.
The Bond Bill, which was approved by the state legislature in June, gave $5.1 million from the general fund to the Transportation Trust Fund. But Gilbert said the state should increase the gas tax or public transit fees to decrease the amount DelDOT needs to borrow; otherwise, he said, vital highway projects and public services will have to be cut.
Gilbert said DelDOT Secretary Shailen Bhatt has controlled budget growth and reduced debt since the recommendations were issued. "He's got to have the General Assembly's support," Gilbert said. "He cannot do it alone."
Joint Finance Committee Chairwoman Rep. Melanie George Smith, D-Bear/Newark, said
DelDOT's budget for fiscal year 2014 decreased by 1.2 percent compared to fiscal year 2013. "This decrease is directly attributable to the Secretary's recommendation and the General Assembly's approval to hold the line on new borrowing to finance the transportation capital improvement program," Smith said in an email.
Smith said Delaware Economic and Financial Advisory Council predicts debt service for the Transportation Trust Fund will decrease from 38 percent to 24.5 percent in fiscal year 2014, and the trust fund is not expected to acquire any new debt for at least six years.
Smith said Delaware Code already requires that the total debt service of the state and the Transportation Trust Fund cannot exceed 15 percent of the estimated general fund and trust fund revenue. "As a whole, the state is well below this cap and any consideration of capping TTF debt service payments should be discussed within the context of what is currently required by law," she said.
Smith also said the fiscal year 2013 budget included a requirement for a review of paratransit services. "This fall, the Joint Finance Committee intends to review the completed study and listen to Secretary Bhatt's ideas for how to control cost yet continue to deliver an efficient service within the confines of federal and state statutes," Smith said.
Most Popular
Brianna Parradine Ullman, sweet,...
Stadium fight costs student her...
Entertainment Briefs
Police investigate Oak Orchard home...
Cape Life Briefs
Indian River students charged in fight
Senior-living facility clears first...
Woman dies after Ellendale hit and run
Movies at Midway to debut The Cube
Winter WonderFest ushers in holiday...


text:
|Publication number
|Publication type
|Application number
|Publication date
|May 8, 2007
|Filing date
|Oct 25, 2003
|Priority date
|Nov 6, 2002
|Fee status
|Also published as
|Publication number
|Michael Fiske
|Original Assignee
|Fiske Software Llc
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (13), Non-Patent Citations (3), Referenced by (6), Classifications (14), Legal Events (5)
|External Links: USPTO, USPTO Assignment, Espacenet
This application claims the benefit of Provisional Patent Application Ser. No. 60/424,299 filed Nov. 6, 2002.
Not Applicable.
Attached with this patent application is a CD-ROM. A file named NADO.jar contains the JAVA byte code that implements an embodiment of NADO cryptography.
The present invention relates broadly to cryptographic methods and devices, and in particular to stream cipher and block cipher methods used in these methods and devices. This invention is also applicable in other fields, such as pseudo-random number generators, used by algorithms that require random numbers. Cryptographic devices and methods are generally used to encrypt and decrypt information transmitted through communication and transmission systems. However, they also may be used to encrypt passive data stored on a computer or another physical device such as a tape drive. Typically, the message is encrypted by a sending agent using a unique key, and the encrypted message, called ciphertext, is transmitted to a receiving agent. Using the same unique key, the receiving agent applies a decryption device or method to the ciphertext. The output of this decryption device or method is the same message that the sending agent gathered before encrypting and sending it.
In the references, section X, [SCHNEIER] provides a description of many of the cryptographic systems mentioned here.
U.S. Pat. Nos. 4,218,582 and 4,405,829 are examples of public-key encryption systems. U.S. Pat. No. 4,218,582 has been shown to be insecure. U.S. Pat. No. 4,405,829 (RSA) is based on number theory. RSA relies on the fact that no one currently knows of a computationally effective way to factor the product of two extremely large unknown prime numbers. While RSA is believed to be secure, it is too slow for computationally demanding encryption applications unless specialized hardware is built to execute its algorithms. Even in hardware, RSA is a few orders of magnitude slower than DES, which is a private-key system. Consequently, RSA is most useful for distributing private keys, utilized by private-key encryption systems, and for implementing protocols. As aptly stated in [SCHNEIER], public-key cryptography is best for key management and a myriad of protocols. Symmetric private-key cryptography is best for encrypting data.
DES is a commercial block cipher private-key cryptographic system. DES is commonly used by commercial banks, financial institutions and other unclassified government agencies. "DES has been traditionally used by banks and other financial institutions for protecting the transmission of the funds and other transactions requiring high security.", [NYTIMES]. In 1998, Paul Kocher demonstrated a hardware device that cracked a DES encrypted message in 56 hours. The cost of building the hardware device was less than 250,000 U.S. dollars.
Overall, up to this point in time, the use of non-autonomous dynamical systems applied to cryptography has not been proposed. (See subsections VI.D, VI.E, VI.G, and VI.I) While permutations have been utilized in cryptography for at least 75 years, [SCHNEIER, pp. 11–13], usually one or two permutations are used and these permutations stay fixed for a given key. (See U.S. Pat. Nos. 4,255,811; 4,316,055; 5,001,753; 5,297,207; 5,511,123). Using a sequence of permutations with different lengths to reorder a sequence of information or states has not been proposed. (See subsection VI.C.) The use of permutations to generate a non-autonomous dynamical system is new; and the use of inverse permutations to transpose elements of the permutation is also new. (See subsection VI.I.) Similarly, up to this point in time, creating a non-autonomous dynamical system, using n by n matrix multiplication on n by 1 matrices has not been proposed as an encryption process. (See subsections VI.E and VI.G.) Lastly, the creation of a Perturbator to break up periodic behavior in any kind of dynamical system, in particular any encryption process, is new. (See subsections VI.F and VI.H.)
Non-autonomous dynamical orbit (NADO) cryptography is a process for encrypting and decrypting information. The underlying process is a fast stream-like cipher that may be implemented efficiently in analog or digital hardware or software. The NADO process makes use of four novel concepts in cryptography: (1) A sequence of permutations which scrambles and spreads out the encrypted information; (2) A state generator built with a non-autonomous dynamical system to generate an unpredictable sequence of states; (3) One or more perturbators which over time change both the non-autonomous dynamical system and the sequence of permutations in a non-periodic way. (4) The use of the key to build the non-autonomous system and sequence of permutations.
NADO uses a symmetric private key to generate the mathematical systems in (1), (2), and (3). Furthermore, NADO composes these mathematical systems in a unique way, creating an astronomical number of possibilities to check in a brute-force attack. The composition of these systems makes NADO unbreakable to a brute-force attack with current computer technology.
One of the important advantages over previous methods is the difficulty of breaking this encryption method. The number of calculations required to crack the cipher is astronomical. At the same time, the executable code that implements NADO requires a small amount of computer memory. A second advantage is that without using any type of specialized hardware nor any type of data compression, the encryption processes of NADO execute much faster, as a function of the difficulty of cracking NADO. Its security and speed enable applications such as real-time encryption of wireless transmissions, demanding real-time military software, real-time embedded systems, commercial real-time networking, and real-time internet applications. A third advantage is that NADO requires smaller key sizes and enables variable-sized keys. A fourth advantage is that statistical tests on NADO-encrypted data show that plain-text attacks are as difficult as brute-force attacks.
Lastly, it can be mathematically shown that a broad class of current encryption algorithms generate a sequence of states that exhibit eventual periodicity. (See subsection VI.I.) It is possible that someone could propose a method of using this eventual periodicity to decode a message encrypted by these kinds of encryption algorithms—even for extremely large periods. NADO presents a new notion called a Perturbator to break up this eventual periodicity.
Further objects and advantages of NADO will become apparent from the attached software and ensuing description.
In this section, subsection A presents the general cryptographic process. Subsections B, C, D, and F explain definitions and concepts needed to discuss particular embodiments of the cryptographic process. Subsections E, F, G, H, I, J present embodiments of the NADO cryptographic process. Subsection J shows how to build instantiations of NADO from the key. Subsection K summarizes key distribution. Subsections L and M describe the JAVA byte code that executes two embodiments of NADO.
A. Cryptographic Process
In this patent, information that has not been encrypted is called a message: Please wire �50,000 to account 349-921118. Information that has been encrypted is called ciphertext: +,−3y=0z14.* 5A,0QxR4c
There are two ways to implement the cryptographic process.
Method A Encryption:
The expression [d1, d2, d3, d4, d5, . . . , dn, . . . ] represents a message.
Method A Decryption:
The expression [c1, c2, c3, c4, c5, . . . , cn, . . . ] represents ciphertext (encrypted message).
Method B Encryption:
The expression [d1, d2, d3, d4, d5, . . . , dn, . . . ] represents a message.
Method B Decryption:
The expression [c1, c2, c3, c4, c5, . . . , cn, . . . ] represents ciphertext (encrypted message).
Comments on Method A
There is an alternative way of decrypting in method A.
Comments on Step iv.
In step iv of methods A and B, there are many ways to implement both the function that encrypts the message element with the corresponding state element, and the inverse function that decrypts the ciphertext element with the corresponding state element.
Let ƒ denote the function used to encrypt message element d with state element s. Then the encrypted (ciphertext) element is c=ƒ(d, s). When decrypting ciphertext element c with state s, then the inverse of ƒ is used, denoted as ƒ−1. In this case, the decrypted element is ƒ−1(c, s). Observe that ƒ−1(ƒ(d, s), s)=d must hold so that the receiver can decrypt the encrypted message. ƒ−1(ƒ(d, s), s)=d is just a mathematical way of representing a simple idea: The sender encrypts a message; after the receiver decrypts this encrypted message, the receiver is able to read and understand the message.
The function ƒ should have the following two properties:
There are three preferred implementations of ƒ. First, the binary operator Exclusive-OR, denoted by ⊕, is the most preferable on digital computers because it and its inverse are extremely fast. (The Exclusive-OR function is its own inverse.) ⊕ is a binary operator obeying the following rules: 1⊕0=1. 0⊕1=1. 0⊕0=0. 1⊕1=0. If the state s and d are represented by more than one bit, then the bitwise Exclusive-OR function is defined by applying ⊕ to corresponding bits. As an example, suppose the message element d=[10110000], and the state s=[00101110]. In this case, ⊕(d, s)=[1⊕0, 0⊕0, 1⊕1, 1⊕0, 0⊕1, 0⊕1, 0⊕1, 0⊕0]=[10011110].
Second, suppose L is the number of distinct values that message element d or state s can be assigned. One can define ƒ(d, s)=(d+s) modulo L, and the inverse ƒ−1(c, s)=(c−s) modulo L. Vice versa also works: ƒ(d, s)=(d−s) modulo L, and ƒ−1(c, s)=(c+s) modulo L.
When K is a non-negative integer, K modulo n means divide K by n and the answer is the remainder. 29 modulo 8 equals 5 because 5 is the remainder when you divide 29 by 8. When K is a negative integer, the definition changes. Add the smallest positive multiple of n that makes the sum of K and this multiple greater than or equal to 0. More precisely, K modulo n equals K+c*n, where c is the smallest positive integer such that (K+c*n)≧0. As an example, −263 modulo 256 equals −263+(2*256)=249. Another example, −26 modulo 8 equals −26+(4*8)=6.
Third, defining ƒ as a particular permutation is fast and its inverse is fast too. The next subsection covers permutations.
B. The First Mathematical System
Step ii of method A applies a sequence of permutations when encrypting a message, and step iii of method B applies a sequence of inverse permutations when decrypting ciphertext. In method A, while encrypting the message, the purpose is to scramble the order of the message. In method B, while encrypting the message, the purpose is to scramble the order of a sequence of states.
In method A, when decrypting the ciphertext, the purpose is to unscramble the order of a sequence of ciphertext elements. In method B, when decrypting the ciphertext, the purpose is to unscramble the order of a sequence of states.
Let the symbol S denote a set. S can be a finite or infinite set. A permutation is a function σ: S→S that sends elements of S to elements of S, is 1 to 1, and is onto. 1 to 1 means that no two distinct elements from S get mapped by σ to the same element. More formally, if s1, s2 are any two distinct element from S, in other words s1≠s2, then σ(s1)≠σ(s2). Onto means that if you choose any element τ from S, you can find an element s so that σ maps s to τ. In other words, for any element τ from S, there is some element s in S satifying σ(s)=τ. In the context of cryptography, the properties 1 to 1, and onto are useful because they help assure that a sequence of a message or states that have been scrambled by a permutation(s) can be unscrambled by the inverse permutation(s).
The identity permutation is the permutation that sends every element to itself. Formally, i: S→S. For every element s in S, i(s)=s. As an example, choose S to be the numbers 0 thru 4, inclusive. The identity i sends every element to itself means that i(0)=0, i(1)=1, i(2)=2, i(3)=3, and i(4)=4.
A finite permutation is a permutation on a finite set. Any finite permutation can be represented as a finite sequence of numbers. The word 'sequence' means that the order of the numbers matters. The sequence [0, 1] is not the same sequence as (1, 0]. Square brackets [ ] represent a sequence.
The sequence, [0, 1, 2, 3, 4], represents the identity permutation on S. This sequence is interpreted as a permutation in the following way. The number 0 is at the beginning of the sequence, so i(0)=0. The next number in the sequence is 1, so i(1)=1. The number 2 follows 1 in the sequence, so i(2)=2. The number 3 follows 2 in the sequence, so i(3)=3. Finally, 4 follows 3 in the sequence, so i(4)=4.
As a different example, choose S to be the numbers 0 thru 7, inclusive. Choose λ=[1, 5, 3, 6, 7, 2, 4, 0]. The number 1 is at the beginning of the sequence, so λ(0)=1. The next number in the sequence is 5, so λ(1)=5. The number 3 follows 5, so λ(2)=3. Similarly, λ(3)=6, λ(4)=7, λ(5)=2, λ(6)=4, and λ(7)=0.
There is a simple way to check that λ is 1 to 1 and onto. Check that all 8 numbers are in the sequence, and make sure none of these numbers occurs in the sequence more than once.
If σ is a permutation, then the inverse of σ is denoted σ−1. When you apply σ and then apply σ−1, or vice versa, this composite function is the identity map. Formally, σ∘σ−1=σ−1∘σ=i. In other words, the function σ∘σ−1 sends every element to itself, and the function σ−1∘σ maps every element to itself.
The inverse of λ, denoted λ−1, is represented by the sequence, [7, 0, 5, 2, 6, 1, 3, 4]. The following analysis verifies that this sequence defines the inverse of lambda. From the sequence, λ−1(0)=7, λ−1(1)=0, λ−1(2)=5, λ−1(3)=2, λ−1(4)=6, λ−1(5)=1, λ−1(6)=3, and λ−1(7)=4. Next, check that λ∘λ−1(0)=λ(7)=0, λ∘λ−1(1)=λ(0)=1, λ∘λ−1(2)=λ(5)=2, λ∘λ−1(3)=λ(2)=3, λ∘λ−1(4)=λ(6)=4, λ∘λ−1(5)=λ(1)=5, λ∘λ−1(6)=λ(3)=6, λ∘λ−1(7)=λ(4)=7.
This paragraph defines two different operations on a permutation. A transposition is an operation that swaps two elements in a permutation. Let σ=[1, 0, 2, 6, 7, 5, 3, 4] be the initial permutation. Transpose 2 and 5 in σ. After the transposition, σ=[1, 0, 5, 6, 7, 2, 3, 4]. A rotation is an operation that rotates the elements in a permutation. Let σ=[1, 0, 2, 6, 7, 5, 3, 4] be the initial permutation. After a rotation, the new permutation is σ=[4, 1, 0, 2, 6, 7, 5, 3].
Any permutation can be constructed efficiently using transpositions. The following example illustrates how to build λ starting with the identity permutation and using only transpositions. The identity permutation on 8 elements is represented by the sequence: [0, 1, 2, 3, 4, 5, 6, 7]
It took only 7 transpositions to change the identity permutation to the permutation λ. Starting with the identity permutation, it takes at most 8 transpositions to generate any of the possible permutations. There are a total of 8! possible permutations, where 8! is a shorthand method of representing the first 8 numbers multiplied times each other: 1*2*3*4*5*6*7*8=40320.
In cryptography applications, we recommend permutations of size greater than 46 because 47! is greater than 1059. 1059 is an overwhelming number of possibilities to check with current computers and will be in the foreseeable future. For a permutation of size 256, the number of possible permutations is greater than 10506. In the future, as the speed of computers improves, one should increase the size of the permutations used to make brute-force attacks impractical.
If S has n elements, it takes at most n transpositions to construct any permutation on S. The general procedure for constructing any of the n! permutations is similar to the steps already mentioned. Start with the identity permutation, and then execute n transpositions.
This procedure is shown for a permutation of length 32. Initialize σ equal to the identity permutation:
Continue these steps for another 28 transpositions to build a random permutation on 32 elements. This method of constructing an arbitrary permutation is important because it prevents an intruder from trying to guess the permutation. A potential intruder can not eliminate permutations that may be unreachable by some other algorithm that constructs a permutation. In our case, the intruder must check on average
possibilities. Further, transpositions can be executed very quickly on a digital computer. A permutation σ of size 256 requires only 256 memory swaps, and about 2*256=512 bytes of memory to store σ and the inverse of σ. On the other hand, a brute force attack requires checking more than 10506 permutations because
This transposition method is able to generate an astronomical number of possibilities to check, using very little computation (256 memory swaps), and a small amount of memory.
C. Permuting Information and States
This section explains the method of using permutations to change the order of a sequence of information or a sequence of states.
Let D=[d0, d1, d2, d3, d4, d5, d6, d7, d8, d9, d10, d11, d12] be a sequence of a message with 13 elements. Each message element, di, represents ni bits, where ni≧1. Define the permutation λ of length 4 to be [2, 0, 3, 1]. This means that λ(0)=2, λ(1)=0, λ(2)=3, and λ(3)=1. Define the permutation a of length 6 to be σ=[4, 2, 0, 5, 3, 1]. This means that σ(0)=4, σ(1)=2, σ(2)=0, σ(3)=5, σ(4)=3, and σ(5)=1. Define γ=[2, 0, 1]. Then γ(0)=2, γ(1)=0, and γ(2)=1.
Apply λ to permute the first 4 elements of D, apply σ to permute the next 6 elements of D, and apply γ to permute the last 3 elements of D. The new permuted message sequence is: [dλ(0), dλ(0), dλ(2), dλ(3), dσ(0)+4, dσ(1)+4, dσ(2)+4, dσ(3)+4, dσ(4)+4, dσ(5)+4, dγ(0)+10, dγ(1)+10, dγ(2)+10], which equals [d2, d0, d3, d1, d8, d6, d4, d9, d7, d5, d12, d10, d11].
This paragraph provides further details on how to apply σ to the subsequence, [d4, d5, d6, d7, d8, d9], of the message sequence D. Applying σ creates a new permuted subsequence [d8, d6, d4, d9, d7, d5]. The 0th element of the permuted subsequence is d8 because σ(0)+4=8. The first element of the permuted subsequence is d6 because σ(1)+4=6. The second element of the permuted subsequence is d4 because σ(2)+4=4. The third element of the permuted subsequence is d9 because σ(3)+4=9. The fourth element of the permuted subsequence is d7 because σ(4)+4=7. The fifth element of the permuted subsequence is d5 because σ(5)+4=5. Notice that 4 is added each time because 4 is the sum of the lengths of the previous permutations applied to D. In this particular case, λ is the only previous permutation applied to D and λ's length is 4 so the sum is 4.
This paragraph provides further details on how to apply γ to the subsequence, [d10, d11, d12], of the message sequence D. Applying γ creates a new permuted subsequence [d12, d10, d11]. The 0th element of the permuted subsequence is d12 because γ(0)+10=12. The first element of the permuted subsequence is d10 because γ(1)+10=10. The second element of the permuted subsequence is d11 because γ(2)+10=11. Notice that 10 is added each time because 10 is the sum of the lengths of the previous permutations, λ and σ, applied to D.
In a similar way, use λ, σ, and γ to permute the sequence of states: S=[s0, s1, s2, s3, s4, s5, s6, s7, s8, s9, s10, s11, s12]. After applying λ, σ, and γ, the permuted sequence is [s2, s0, s3, s1, s8, s6, s4, s9, s7, s5, s12, s10, s11].
In general, let D be a sequence of a message [d0, d1, d2, d3, d4, . . . dn−1] with n message elements. Choose any sequence of permutations [σ1, σ2, . . . σk], where σ1 is a permutation of length m1, σ2 is a permutation of length m2, and so forth up to, σk is a permutation of length k, and all the lengths sum to n. In other words, m1+m2+m3+ . . . +mk=n. Permute the message sequence D with this sequence of permutations so that the new permuted message sequence is [dσ
Similarly, let S be a sequence of states [s0, s1, s2, s3, s4, . . . sn−1] with n elements. Choose any sequence of permutations [σ1, σ2, . . . σk], where σ1 is a permutation of length m1, σ2 is a permutation of length m2, and so forth, σk is a permutation of length k, and all the lengths sum to n. In other words, m1+m2+m3+ . . . +mk=n. Permute this sequence of states S so that the new permuted sequence is [sσ
D. The Second Mathematical System
The second system is a state generator. This system iterates a dynamical system to create this sequence of states. An iterative autonomous dynamical system is created by a function f: X→X, where X is a set, [ROBINSON]. When a function ƒ and an initial orbit point x are chosen, the iteration of ƒ on x creates a sequence of states: [x, ƒ(x), ƒ∘ƒ(x), ƒ∘ƒ∘ƒ(x), . . . ]. This sequence of states is called the orbit of a with the function ƒ. It is also possible to create a sequence of states using a sequence of functions [ƒ1, ƒ2, ƒ3, ƒ4, . . . ], rather than a single function. The iteration of this collection on an initial orbit point x creates a sequence of states: [x, ƒ1(x), ƒ2∘ƒ1(x), ƒ3∘ƒ2∘ƒ1(x), ƒ4∘ƒ3∘ƒ2∘ƒ1(x), . . . ]. As the system is iterated, if the function applied sometimes changes, then this is an iterative non-autonomous dynamical system, [FISKE]. An iterative autonomous dynamical system is a special case of a non-autonomous dynamical system. If all the ƒi represent the same function, then this is the definition of an autonomous dynamical system.
A smooth dynamical system is created by a vector field on a manifold, [SPIVAK]. If the vector field does not change over time, then it is a smooth autonomous dynamical system. If the vector field changes smoothly over time, then it is a smooth non-autonomous dynamical system. In a smooth dynamical system, one creates a sequence of unpredictable states by sampling the coordinates of the trajectory at successive time intervals: t0<t1<t2< . . .
E. Iterative Systems with Matrices Over F2
This subsection explains how to construct a discrete non-autonomous dynamical system, using matrices over the finite field F2. F2 is the finite field with two elements: 0 and 1. There are two operations for the finite field F2, addition and multiplication represented by + and *, respectively. The complete rules for addition are: 0+0=0. 0+1=1. 1+0=1. 1+1=0. The complete rules for multiplication are: 0*0=0. 0*1=0. 1*0=0. 1*1=1.
Matrices whose entries lie in F2 can be created. The dot product is defined with matrices that have only one row or one column. Choose the matrix V=(1 0 1). V has 1 row and 3 columns, and is called a 1 by 3 matrix.
Choose the matrix 3 by 1,
The dot product between v and w is a number in F2. The computation of the dot product consists of steps i. thru iv.
In the more general case, v is a 1 by n matrix and w is a n by 1 matrix.
Choose V=(v1 v2 v3 . . . vn), and
The dot product between V and W is (v1*w1)+(v2*w2)+(v3*w3)++(vn*wn).
Next, matrix multiplication is defined in terms of the dot product. Choose a 3 by 3 matrix,
Choose a 3 by 1 matrix,
Matrix multiplication A*B is computed by calculating a distinct dot product between each row of matrix A, and the 3 by 1 matrix B.
The first row of
is 1 because this matrix entry is computed by calculating the dot product between the first row of A and the matrix B. The first row of A is (1 0 1). This dot product computation is (1*1)+(0*1)+(1*0)=1. The second row of
is 0 because this matrix entry is computed by calculating the dot product between the second row of A and the matrix B. The second row of A is (0 0 1). This dot product computation is (0*1)+(0*1)+(1*0)=0. The third row of
is 1 because this matrix entry is computed by calculating the dot product between the third row of A and the matrix B. The third row of A is (0 1 0). This dot product computation is (0*1)+(1*1)+(0*0)=1.
In general, multiply an n by n matrix
by an n by 1 matrix
The result is an n by 1 matrix
The number in the first row of C equals the dot product between the first row of A and the matrix B. In other words, c11=(a11*b11)+(a12*b21)+(a13*b31)+ . . . +(a1n*bn1) Similarly, the number in the second row of C equals the dot product between the second row of A and the matrix B. In other words, c21=(a21*b11)+(a22*b21)+(a23*b31)+ . . . +(a2n*bn1) The ith row of C equals the dot product between the ith row of A and the matrix B. In other words, ci1=(ai1*b11)+(ai2*b21)+(ai3*b31)+ . . . +(ain*bn1)
Choose A to be a n by n matrix over F2. Let Xn be the set of all n by 1 matrices over F2. The matrix A creates a function A: Xn→Xn using matrix multiplication.
Choose s to be a n by 1 matrix lying in Xn. s is called the initial orbit point. Define A(s)=A*s. As described in subsection D, if A remains changed as the dynamical system is iterated, then A creates a discrete autonomous dynamical system. The orbit of s with respect to A is [s, A*s, A*A*s, A*A*A*s, . . . ]. The n by 1 matrices in the orbit, s, A*s, A*A*s, and so on, are called orbit points. A is called the iterating matrix.
As the dynamical system is iterated, if the matrix A changes occasionally, then this creates a discrete non-autonomous dynamical system. There are some important goals when changing the iterating matrix.
There are many ways to accomplish these objectives:
There are also a number of ways to decide when to change the matrix. The matrix can be changed after each iteration, or it can be remain unchanged for a number of iterations and then can be changed. If the matrix remains unchanged for a few iterations, this helps reduce computational time.
The next example illustrates changing the matrix in a non-periodic way. Initialize A and s0. The subscript denotes the iterate number.
After the first and second iterate,
the states are
Swap s2 with the first row of A. After the swap, the new values of A and s2 are
After the 3rd iterate,
Swap the 3rd and the 7th rows of A. After the swap,
After the 4th, 5th, 6th and 7th iterates with no changes made to A,
where s4=A*s3, s5=A*s4, s6=A*s5, and s7=A*s6.
After flipping the 5th row of s7 from 1 to 0,
After the 8th iterate,
Continue to generate states s9, s10, . . . indefinitely, changing A or si in a non-periodic way.
F. Perturbator
A Perturbator is a new notion. A general Perturbator is any process that changes some dynamical system in a non-periodic way. The Perturbator described in this section is designed to change A or si in a non-periodic way; execute fast; and use a small amount of memory.
Use part of the private key to initialize the integer variables: n, θ, δ, M and c. We prefer to initialize n=0, and the other variables so that M≧θ≧c≧0 and δ>0. The execution of the Perturbator consists of the steps below.
Add 1 to n if (n ≧ θ) { Set n equal to 0. Add δ to θ. Change A or si using one of the steps i. thru vii. if (θ > M) { Set θ equal to c. Add 1 to M. } }
The computer executes the steps of the Perturbator, after each iteration of the computation si+1=A*si.
G. Iterative Systems with Matrices Over Any Ring
All of the methods in the previous section, also hold for any collection of matrices whose entries lie in a mathematical ring. In the previous section, the entries in the matrix were in F2 for clarity. A ring R is any set of elements having the binary operations + and * with the following properties.
Below are some examples of rings whose elements can be in a matrix.
Note: Ri is neither isomorphic to Z4, nor isomorphic to Z2�Z2.
H. Changing a Dynamical System with a Perturbator
In the Perturbator discussed in section, one can substitute the step, Set M to the next prime number p, for the step Add 1 to M. Further, initialize M to some arbitrary prime number. These substitutions create a different implementation of a Perturbator. An important idea is that if M is changed to a value it has never been assigned, then the dynamical system can be perturbed in a non-periodic way. This idea enables a more general Perturbator that perturbs an arbitrary dynamical system in a non-periodic way. Below are the steps of this more general Perturbator that are executed after each iteration of the dynamical system.
Add 1 to n.
if (n ≧ θ)
Set n equal to 0.
Add δ to θ.
Change elements or parameters in the other dynamical system.
if (θ > M)
Set θ equal to c.
Change M.
The most general method is to use a distinct dynamical system P: Y→Y as the Perturbator. As stated in the section that introduces dynamical systems, let ƒ: X→X be any initial function that needs to be transformed into a non-autonomous dynamical system. Initialize D to a subset of Y. The execution steps are:
Iterate f: si = f(si−1).
Iterate P: yi = P(yi−1).
If (yi lies in D)
Change f.
Remove or add elements to D.
while (More states si need to be generated)
I. Non-autonomous Systems Using Permutations
The goal here is to create a sequence of states using a sequence of permutations. Choose an initial permutation σ with length L. Initialize the state number variable i to 0. Initialize variables k and j to two natural numbers lying in the set {0, 1, 2, 3, . . . , (L−1)}. Steps A thru E are executed inside of a loop. The number of times the loop is executed determines the number of states generated in the sequence. The system described below generates a sequence of states, [s0, s1, s2, . . . ].
In current technology, data written to and read from streams is often in bytes. A byte represents 28=256 distinct values. Thus, steps A thru E are illustrated on a permutation of length 256. Choose σ as:
[44, 248, 189, 104, 187, 201, 127, 226, 220, 136, 155, 237, 86, 144, 166, 27, 152, 204, 150, 202, 114, 157, 67, 245, 172, 22, 89, 167, 214, 145, 42, 191, 57, 77, 186, 251, 31, 161, 221, 111, 250, 51, 117, 205, 0, 48, 79, 165, 76, 209, 181, 151, 198, 78, 200, 129, 179, 49, 230, 3, 102, 222, 146, 203, 30, 227, 70, 196, 140, 109, 177, 63, 32, 75, 228, 178, 253, 43, 10, 105, 38, 128, 11, 174, 23, 215, 25, 223, 110, 182, 137, 216, 176, 229, 141, 163, 212, 94, 143, 193, 219, 88, 133, 218, 197, 180, 90, 171, 255, 84, 95, 81, 124, 185, 108, 121, 247, 194, 87, 40, 9, 41, 238, 92, 131, 168, 184, 115, 2, 14, 54, 103, 17, 122, 26, 192, 246, 4, 208, 225, 71, 119, 126, 118, 33, 130, 183, 46, 101, 159, 224, 1, 125, 142, 107, 217, 37, 234, 242, 15, 35, 239, 211, 236, 65, 154, 16, 5, 34, 98, 61, 156, 53, 6, 59, 100, 162, 116, 206, 68, 169, 85, 58, 113, 45, 62, 148, 106, 243, 249, 7, 55, 147, 66, 91, 233, 39, 36, 47, 190, 252, 29, 235, 82, 96, 60, 188, 97, 18, 213, 24, 153, 240, 158, 195, 139, 232, 72, 120, 93, 135, 210, 199, 164, 149, 99, 160, 134, 13, 19, 83, 52, 132, 175, 231, 123, 241, 28, 207, 73, 112, 64, 50, 12, 80, 74, 20, 56, 8, 173, 254, 138, 244, 170, 69, 21]. Executing steps A thru E in a loop ten times, the first ten states are: [s0, s1, s2, s3, s4, s5, s6, s7, s8, s9]=[224, 104, 158, 8, 149, 5, 133, 0, 21, 198].
Steps A thru E are described in more detail to show how the states are generated. Initialize j=143 and k=255.
At step A, k is set equal to 0 because 255+1 modulo 256 equals 0.
At step B, j is set equal to (143+σ−1(0)) modulo 256. Since σ(44)=0, σ−1(0)=44. Thus, after step B, j=187.
At step C, σ((σ(0)+σ(187)) modulo 256)=σ((44+106) modulo 256)=σ(150)=224 so state s0=224.
At step D, add 1 to i, so i=1.
At step E, the simplest way to understand this step is to recognize that for any number m the σ−1(m)th entry in σ is m. With this in mind, since k=0 and j=187, swap 0 and 187. The two entries swapped are shown in bold. After this transposition, the new value of σ is:
[44, 248, 189, 104, 0, 201, 127, 226, 220, 136, 155, 237, 86, 144, 166, 27, 152, 204, 150, 202, 114, 157, 67, 245, 172, 22, 89, 167, 214, 145, 42, 191, 57, 77, 186, 251, 31, 161, 221, 111, 250, 51, 117, 205, 187, 48, 79, 165, 76, 209, 181, 151, 198, 78, 200, 129, 179, 49, 230, 3, 102, 222, 146, 203, 30, 227, 70, 196, 140, 109, 177, 63, 32, 75, 228, 178, 253, 43, 10, 105, 38, 128, 11, 174, 23, 215, 25, 223, 110, 182, 137, 216, 176, 229, 141, 163, 212, 94, 143, 193, 219, 88, 133, 218, 197, 180, 90, 171, 255, 84, 95, 81, 124, 185, 108, 121, 247, 194, 87, 40, 9, 41, 238, 92, 131, 168, 184, 115, 2, 14, 54, 103, 17, 122, 26, 192, 246, 4, 208, 225, 71, 119, 126, 118, 33, 130, 183, 46, 101, 159, 224, 1, 125, 142, 107, 217, 37, 234, 242, 15, 35, 239, 211, 236, 65, 154, 16, 5, 34, 98, 61, 156, 53, 6, 59, 100, 162, 116, 206, 68, 169, 85, 58, 113, 45, 62, 148, 106, 243, 249, 7, 55, 147, 66, 91, 233, 39, 36, 47, 190, 252, 29, 235, 82, 96, 60, 188, 97, 18, 213, 24, 153, 240, 158, 195, 139, 232, 72, 120, 93, 135, 210, 199, 164, 149, 99, 160, 134, 13, 19, 83, 52, 132, 175, 231, 123, 241, 28, 207, 73, 112, 64, 50, 12, 80, 74, 20, 56, 8, 173, 254, 138, 244, 170, 69, 21].
These steps A thru E can be executed as many times as needed to create a sequence of states. Further, the order in which steps A thru E are executed can also be changed.
If smaller keys are the primary goal in the encryption system, use the same steps A thru E on a permutation with a smaller length. For example if σ has length 64, then each state si generated in step C is a number ranging from 0 to 63. This state si can be used to encrypt 6 bits of a message because 64=26.
This paragraph presents the concept of eventual periodicity. A sequence of states [s0, s1, s2, . . . ] is eventually periodic if there are two positive integers k and n such that for each integer j between 0 and n−1 inclusive sk+j=sk+j+mn for every integer m≧0. This sequence eventually has a period of n and that k is the threshold for this eventual periodicity.
As an example, the sequence [2, 7, 4, 3, 5, 1, 3, 5, 1, 3, 5, 1, . . . ] is eventually periodic because it eventually starts to repeat 3, 5, 1, 3, 5, 1, 3, 5, 1, . . . . It has a threshold k=3 and period n=3. As another example, the sequence [1, 0, 4, 3, 5, 7, 8, 2, 1, 7, 8, 2, 1, 7, 8, 2, 1, . . . ] is eventually periodic with k=5 and period n=4.
It can be mathematically shown that a broad class of current encryption algorithms generate a sequence of states that is eventually periodic. Some members of the cryptographic community believe that the encrypted message is not vulnerable if the threshold k or the period n are sufficiently large. However, there are methods in the field of dynamical systems to develop predictive models of this type of behavior. In the future, it is possible that someone could propose a method of using this eventual periodicity to decode an encrypted message even for extremely large periods.
There is a simple computationally efficient way to break up eventual periodicity. Use a Perturbator to change a in a non-periodic way. As stated before, in the Perturbator section, initialize the integer variables: n, θ, δ, M and c. We prefer to initialize n=0, and initialize the other variables so that M>θ≧c≧0 and δ>0. Our software implementation of a Perturbator consists of the following steps.
Add 1 to n.
if (n ≧ θ)
Set n equal to 0.
Add δ to θ.
Change σ.
if (θ > M)
Set θ equal to c.
Add 1 to M.
In the step, Change σ, there are two preferred ways to do this. The first way is to transpose two elements of σ when execution speed is more important. A second way is to rotate σ. The file NADO.jar changes σ using a rotation.
Below is a summary of the preferred method to generate a sequence of states, [s0, s1, s2, . . . ], using a non-autonomous system built from permutations.
Set k equal to (k + 1) modulo L.
Set j equal to (j + σ−1(k)) modulo L.
Set state si equal to σ((σ(k) + σ(j)) modulo L).
Set the state number i equal to i + 1.
Transpose the σ−1(k)th entry and σ−1(j)th entry in σ.
Execute a Perturbator to change σ in a non-periodic way.
while (More states si need to be generated)
Any reordering of the steps A thru F inside the do-while loop will work as well to generate a sequence of states. Further, step E can be removed, if the Perturbator in step F uses transpositions to change σ, σ changes frequently, and the Perturbator changes σ in a non-periodic way.
An alternative is to use more than one permutation to generate an unpredictable sequence of states. As an example, initialize two distinct permutations σ1, σ2 of length L. Initialize non-negative integers j1, j2, and k. Set i equal to 0.
Set k equal to (k + 1) modulo L.
Set j1 equal to (j1 + σ1 −1(k)) modulo L.
Set state si equal to σ1((σ1(j1) + σ2(k)) modulo L).
Set state si+1 equal to σ2 −1((σ1 −1(j2) + σ2 −1(j1)) modudo L).
Set j2 equal to (j2 + σ2 −1(k)) modulo L.
Set state si+2 equal to σ1 −1((σ1 −1(k) + σ2 −1(j2)) modulo L).
Set state si+3 equal to σ2((σ1(j2) + σ2(j1)) modulo L).
Transpose the σ1 −1(k)th entry and σ2(j2)th entry in σ1.
Transpose the σ2 −1(k)th entry and σ1(j1)th entry in σ2.
Execute a Perturbator to change σ1 in a non-periodic way.
Execute a Perturbator to change σ2 in a non-periodic way.
Set the state number i equal to i + 4.
while (More states si need to be generated)
The previous method with two permutations, approximately doubles the memory use and approximately doubles the speed. The spirit of this method can be extended to 3 or more permutations, when speed is a higher priority than memory usage.
J. Building NADO with a Key
A NADO key is a collection of integers, or a sequence of bits interpreted as a collection of integers. NADO uses one integer for the initial orbit point. NADO uses 3 positive integers and 1 non-negative integer for the initialization of θ, δ, M and c in the Perturbator, described in subsections VI.F and VI.H.
To generate a permutation σ, first initialize σ to the identity permutation, where n is the size of σ. A part of the NADO key can be a sequence of non-negative integers, denoted as k0, k1, . . . , km. In the case when the following three conditions hold:
If the above three conditions do not hold, then execute the following steps to initialize σ. Initialize r and q to 1.
while (r ≦ n)
Set v equal to r modulo (m + 1).
Set q equal to (kv + q − σ−1(r)) modulo n.
Transpose the rth and σ−1(q + 1)th entries in σ.
Increment r by 1.
An n by n matrix over F2 is initialized by the key as follows. First, a permutation-based non-autonomous dynamical system is initialized as described above. Then this system is iterated to build the matrix. This system's state after each iteration is 1 byte, which represents a sequence of 8 ones and zeros. This sequence of ones and zeros is stored in the n by n matrix over F2.
The part of the key that is used to build the matrix is contained in the array of integers, int[ ] values. The two dimensional array matrix[i][k] represents the n by n matrix over F2. The method call PermutationOrbitor.create(256, values) creates a non-autonomous dynamical system, using a sequence of permutations of size 256. The method call po.state( ) returns the system's state. The section of JAVA code below illustrates this in more detail:
int[] bytes = { 0, 0, 0, 0 };
int[] shiftbits = { 0, 8, 16, 24 };
PermutationOrbitor po = PermutationOrbitor.create(256, values);
for(int i = 0; i < numrows; i++)
for(int k = 0; k < numcolumns; k++)
for(int q = 0; q < 4; q++)
po.iterate( );
bytes[q] = (po.state( ) << shiftbits[q]);
matrix[i][k] = (bytes[0] {circumflex over ( )} bytes[1] {circumflex over ( )} bytes[2] {circumflex over ( )} bytes[3]);
This method of initializing an n by n matrix is highly effective at generating an unpredictable sequence of ones and zeros even with an extremely small, poor key. As an example, using only 4 small integers, values[0]=1, values[1]=2, values[2]=1, and values[3]=1, the code in NADO.jar generates the 32 by 32 matrix:
In NADO.jar, the non-autonomous system used in the encryption and decryption process depends on the key. In particular, from the key the parities of integers are determined. If the sum of the parities modulo 2 is 1, then the non-autonomous system is generated by a 32 by 32 matrix with entries in F2. If the sum modulo 2 is 0, then it is generated by a non-autonomous system of permutations of size 256, as described in subsection VI.I.
Keep in mind that in the general NADO cryptographic process, there is the choice of implementing one or more non-autonomous dynamical systems. If the choice is to implement only one, then, for example, an implementation might only use a 64 by 64 matrix with entries in F2 to generate the non-autonomous system. In this case, even if the key changes, this implementation would still use a 64 by 64 matrix with entries in F2. As a different example, an implementation might only use a non-autonomous system of permutations. In this case, even if the key changes, this implementation would still use a non-autonomous system of permutations.
K. Key Distribution
NADO uses a symmetric private key. There are different ways to distribute the key.
i. The sender uses an excellent random number generator to build the private key for NADO. At the beginning of the conversation or data exchange, the sending agent sends the NADO private key to the receiving agent using a public-private key system. After the private key has been sent, the public-private key system is no longer needed. [SCHNEIER] describes a number of protocols that describe how to exchange keys using public-private key methods. Some of these protocols for key exchange using a public-private key method are: Interlock, Dass, Denning-Sacco, Woo-Lam.
This technique greatly enhances the speed at which two parties can communicate in a secure way, as NADO encrypts and decrypts at a much faster rate then public-private key cryptographic methods. (See subsection N.)
ii. In applications where the number of potential recipients of an encrypted transmission is small and the recipients are known beforehand, the sending and receiving agents can agree to have the private key transmitted in a secure way. A courier may hand-carry the key. There are also a number of automated ways described in [SCHNEIER]: Wide-Mouth tog, Yahalom, Needhan-Schroeder, Otway-Rees, Kerberos, Neuman-Stubblebine.
Method i. is superior when the number of potential recipients of an encrypted transmission is large and potential recipients are unknown. These applications include:
Method ii. is preferred for military applications and specialized banking applications, when there are a small number of people communicating, and there is a high degree of confidence that the private key will not be intercepted and stolen.
L. Instructions on the Use of NADO.jar
On the CD-ROM, the file NADO.jar contains JAVA byte code that executes on a JAVA virtual machine. A JAVA virtual machine should be installed, and the system variable CLASSPATH should contain the directory path that NADO.jar is in. The main class in NADO.jar is NADO.class. NADO.class enables four different commands by calling four static methods: buildKey, encrypt, decrypt, and main.
Using arrays of integers as input, the first static method allows the user to create an object NADOKey which stores the NADO private key.
public static NADOKey buildKey(int[ ] ai0, int[ ] ai1, int[ ] ai2, int[ ] ai3)
The four arguments ai0, ai1, ai2, and ai3 store arrays of integers used to initialize the perturbator, the sequence of permutations, the orbit point, and the non-autonomous dynamical system. NADO.class assumes that these arrays of integers have already been generated elsewhere by a random generator, and distributed securely. The object NADOKey returned by method buildKey can be used as an argument by the next two methods encrypt and decrypt.
The second static method enables a user to read a message coming from Input-Stream plain, encrypt this message using the argument ky, and write the ciphertext to OutputStream cipher.
public static void encrypt(InputStream plain, OutputStream cipher, NADOKey ky)
The third static method enables a user to read ciphertext coming from InputStream cipher, decrypt the ciphertext using the argument ky, and write the message to Output-Stream decipher.
public static void decrypt(InputStream cipher, OutputStream decipher, NADOKey ky)
Because of the generality of the JAVA classes InputStream and OutputStream, the methods buildKey, encrypt and decrypt in NADO.jar enable a wide variety of encryption/decryption applications.
The fourth static method main enables the user to encrypt and decrypt files from the command line. main expects the files 032.txt, M32.txt, P.txt, and N.txt to be in the same directory as NADO.jar. 032.txt stores a single integer, and M32.txt, P.txt, and N.txt store integers that make up the NADO key. The encrypted and decrypted files should lie in the subdirectory/text. As an example, the command java NADO E plain1.txt reads the message in the file plain1.txt and writes the ciphertext to the file cipher32_plain1.txt. The command java NADO D cipher32_plain1.txt reads the encrypted file cipher32_plain1.txt, decrypts it, and writes the resulting message to plain1.txt. These commands must be typed in from the same directory as NADO.jar.
On the CD-ROM, there are two files cipher32_plain1.txt and cipher32_plain2.txt in the subdirectory/text. These two files were encrypted by NADO.jar.
M. Performance of NADO.jar
NADO.jar is fast enough to execute real-time encryption and decryption on wireless devices such as cell phones and other consumer products; to execute real-time encryption/decryption of data in military applications such as theatre missile defense; and to perform real-time encryption for high speed networking applications.
NADO.jar encrypts and decrypts uncompressed information at a speed ranging from 180,000 to 210,000 bytes per second, on a laptop computer running an Intel 150 Mhz Pentium x86 Family5 Model4 microprocessor. On a laptop computer running an Intel 996 Mhz Pentium III microprocessor, NADO.jar encrypts and decrypts uncompressed information at a speeding ranging from 2,200,000 to 2,400,000 bytes per second.
These speeds do not measure the amount of time to read from the input file and write to the output file because hard drive speeds vary considerably. Furthermore, in some cryptography applications, reading and writing to a file does not occur. Currently, cell phones and some handheld computers do not have a hard drive. Current cell phone technology requires a speed of 20,000 bits per second to perform real-time encryption, which is equivalent to 2,500 bytes per second (1 byte=8 bits). At these speeds, NADO easily enables real-time encryption and decryption on cell phones and wireless PDAs. NADO.jar uses 10,241 bytes of memory, so it can run on devices such as PDAs, cell phones, and small embedded military applications. Since NADO implementations in C or assembly code will be far more efficient, a C or assembly code implementation of NADO should take up less than 5,000 bytes of memory, and execute 10 to 100 times faster than the speeds stated here.
This section describes alternative embodiments of NADO.
Alternative 1. In cases where speed and a smaller key size is important, this alternative uses only a sequence of permutations to change the order of the message. This process is outlined in subsection VI.A, step ii of method A and step iii of method B. This process is described in detail in subsection VI.C. As shown in subsection VI.C., each permutation in the sequence may have a different length.
Alternative 2. This alternative is an extension of alternative 1. In addition to a sequence of permutations to reorder the message, it also uses a Perturbator to change the sequence of permutations in a non-periodic way.
Alternative 3. This alternative uses only a non-autonomous dynamical system to create a sequence of unpredictable states. This process is introduced in subsection VI.D. This process is covered in detail in subsections VI.E, VI.G, and VI.I.
Alternative 4. This alternative is an extension of alternative 3. In addition to a non-autonomous dynamical system to create a sequence of unpredictable states, it uses a Perturbator to change the non-autonomous system in a non-periodic way.
Alternative 5. This alternative is an extension of alternatives 1 and 3. It uses a sequence of permutations to reorder the message or states, and a non-autonomous dynamical system to create a sequence of unpredictable states, but does not use Perturbators.
Alternative 6. This alternative uses part of the cryptographic process to generate pseudo-random numbers. As introduced in section VI.D and discussed in detail in sections VI.E, VI.G, and VI.I, NADO generates a sequence of unpredictable states: [si
Alternative 7. As explained in alternative 6, pseudo-random numbers can be generated. These pseudo-random numbers can be used to build keys in a distinct encryption/decryption system. This distinct encryption/decryption device could be implemented with the DES algorithm, or some other well-known encryption algorithm, or even the NADO encryption/decryption process. Thus, NADO can be used to generate keys.
The process for encrypting and decrypting information makes use of three novel processes in cryptography: (1) A sequence of permutations which scrambles and spreads out the encrypted message; (2) A non-autonomous dynamical system to generate an unpredictable sequence of states; (3) One or more perturbators which perturb both the non-autonomous dynamical system and the sequence of permutations in a non-periodic way. As discussed in section VII, there are alternative embodiments that use particular combinations of (1), (2), and (3).
While NADO has been described in complete detail, and two implementations are demonstrated in JAVA byte code, NADO is not to be limited to such details, since many changes and modifications may be made to NADO without departing, from the spirit and scope thereof. Persons of ordinary skill in the art may implement the invention in various ways and configurations that embody the subject matter encompassed literally and by equivalents in the following claims. Hence, NADO is described to cover any and all modifications and forms which may come within the language and scope of the claims.
|Cited Patent
|Filing date
|Publication date
|Mar 25, 1975
|Mar 10, 1981
|International Business Machines Corporation
|Key controlled block cipher cryptographic system
|Dec 30, 1976
|Feb 16, 1982
|International Business Machines Corporation
|Stream/block cipher crytographic system
|Dec 14, 1977
|Sep 20, 1983
|Massachusetts Institute Of Technology
|Cryptographic communications system and method
|Mar 7, 1988
|Mar 19, 1991
|U.S. Philips Corporation
|Crytographic system and process and its application
|May 24, 1993
|Mar 22, 1994
|Degele Steven T
|Machine generation of cryptographic keys by non-linear processes similar to processes normally associated with encryption of data
|Apr 19, 1993
|Dec 20, 1994
|Yeda Research & Development Co., Ltd.
|Efficient signature scheme based on birational permutations
|Aug 4, 1994
|Apr 23, 1996
|Northern Telecom Limited
|Symmetric cryptographic system for data encryption
|Dec 21, 1995
|Nov 11, 1997
|Nec Corporation
|Small size product cipher apparatus
|Nov 1, 1995
|Mar 3, 1998
|Rsa Data Security, Inc.
|Block encryption algorithm with data-dependent rotations
|Apr 21, 1997
|Nov 10, 1998
|Rsa Data Security, Inc.
|Block encryption algorithm with data-dependent rotations
|Jul 17, 1997
|Feb 29, 2000
|Entrust Technologies, Ltd.
|Practical S box design
|Jun 3, 1999
|Dec 4, 2001
|Cryptography Research, Inc.
|Using unpredictable information to minimize leakage from smartcards and other cryptosystems
|Dec 15, 1998
|Feb 12, 2002
|Philips Electronics No. America Corp.
|Cryptographic device with encryption blocks connected parallel
|A symmetric cipher using autonomous and non-autonomous cellular automata Srisuchinwong, B.; York, T.A.; Tsalides, P.; Global Telecommunications Conference, 1995. GLOBECOM '95., IEEE vol. 2, Nov. 13-17, 1995 pp. 1172-1177 vol. 2.
|Generalized Bent Criteria for Boolean Functions (I) Riera, C.; Parker, M.G.; Information Theory, IEEE Transactions on vol. 52, Issue 9, Sep. 2006 pp. 4142-4159.
|Linear models for keystream generators Golic, J.D.; Computers, IEEE Transactions on vol. 45, Issue 1, Jan. 1996 pp. 41-49.
|Citing Patent
|Filing date
|Publication date
|Dec 8, 2005
|Feb 2, 2010
|Fiske Software Llc
|Cryptography related to keys
|Apr 24, 2007
|Apr 29, 2014
|AEMEA Inc.
|Active element machine computation
|Mar 5, 2013
|Jan 12, 2016
|Biogy, Inc.
|One-time passcodes with asymmetric keys
|Dec 8, 2005
|Jun 15, 2006
|Fiskesoftware Llc
|Cryptography related to keys
|Apr 24, 2007
|Dec 13, 2007
|Fiske Software Llc
|Active element machine computation
|Sep 4, 2009
|Feb 25, 2010
|Fiske Software Llc
|Cryptography related to keys with signature
|U.S. Classification
|380/37, 380/28, 380/268
|International Classification
|Cooperative Classification
|European Classification
|Mar 14, 2007
Owner name: FISKE SOFTWARE LLC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:FISKKE, MICHAEL;REEL/FRAME:019135/0129
Effective date: 20070312
Owner name: FISKE SOTFWARE LLC, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:FISKE, MICHAEL;REEL/FRAME:019130/0040
Effective date: 20070312
|Jul 14, 2010
|Fee payment
Year of fee payment: 4
|Dec 19, 2014
|Maintenance fee reminder mailed
|Jan 7, 2015
|Surcharge for late payment
Year of fee payment: 7
|Jan 7, 2015
|Fee payment
Year of fee payment: 8


text:
Thursday, August 4, 2011
That which we call a Rose … OH! Rose?
… But for the love of JK Rowling I can't come up with a name for the main character in my latest WIP.
Description: Character X is a young asst. curator at a museum. She has a boyish pixie, is cute and short with curves, and enjoys fashionable pencil skirts, Mary Janes, books about adventure, and tall roguish cable TV hosts with big egos … but she'll never admit to that last one.
At first, her name was Alana Wendell. I liked this for the feminine flow of the first name, which worked well with the tough, almost working class last name. The sound worked, and there were quite enough syllables to feel right on the tongue (or, the mind's tongue). But, I didn't love it. It was a little too 'floaty' – a nonsensical term for how I describe a name that's too girly, too angelic and too innocent.
It's still a favorite for the position of 'official name,' but I'm keeping my options open.
Then, she became Leona Bennette – fierce, strong and interesting first name anchored by a classic, feminine last name. I tried this out at my husband's suggestion (he's a tremendous help), but I'm just not feeling it. The first name is too ethnic for a librarian-esque girl who works in a museum. All I can see is a little Italian woman with her gray hair pulled into a tight bun. If I changed the spelling to Liona, that helps a little …
Now, I'm considering Claire Melisandre. It's got the librarian esque first name with a distinct flair of adventure in the last name. But, I'm just not sure. I feel like I might be quoting 'The Breakfast Club' lines while I'm writing.
So, I'm appealing to you all for some help, while also giving away some tips I've discovered for naming characters (because, despite what I'm showing here, I'm actually quite good at it and <3 it). Here are my best ones:
– Think of adjectives that describe the person. Write them down, and then look at the list. Maybe a few spark a memory of a girl you once knew, or a guy from a TV show you saw while clicking through the channels. Or, maybe if you're feeling crazy, you can piece together the adjectives themselves – using letters to form names or maybe parts of the words themselves.
– Watch movie credits. Let your eyes skim the first names – or the last names. Whatever. But you'll find a ton of interesting monikers you might never have thought of yourself. Also, the Disney/Pixar movies have a fun thing at the very end of the credits called 'Production Babies,' which shows all of the babies born during the making of the movie. HUGE wealth of info.
– Visit a graveyard. OK, this is not as morbid as it seems. A few years back I was unfortunate enough to be driving slowly past tombstones in a French-Canadian cemetery, and I was inappropriately struck with a desire to have my notebook.
…Which leads me to my last and best tip:
– Make a list. When you see a great name – someone being interviewed, a name in the news, an email from a PR person at work – make a note of it. Designate a page in the back of your writing notebook (I use the very last page) as a repository of great names. That way, whenever you get stuck, you have a starting point with notes you are giving yourself.
Remember, the name is a huge part of the character. Choose the one that will express something special about your character that you won't ever have to explain yourself. A perfect name sets the tone, while an imperfect name detracts from it … and could cause a reader to stop reading.
Things I try to avoid:
– Names recently used in popular books. The world doesn't need another Bella, Hermione, Clary or Juliet. Just. Say. No.
– Anthropomorphic names. Wren is very cool, but I'll always think of a bird first instead of a hot blond with dreadlocks.
– Names the general populous can't pronounce out loud. Russian names, while pretty to look at, are hard to read. So are some French names (gasp, mon amour!), Persian names, Irish names, etc. Exotic is great, but think of the poor audio reader who's going to be reading this aloud.
OK, now that I've hopefully helped you, could you help me? Alana Wendell or Liona Bennette or Claire Melisandre – or something else entirely? : ) Do you have another suggestion?
10 comments:
I usually pick names by meaning. I do a reverse look up. For instance I have an Antag named Belinda. Belinda means serpent--and she IS! Try picking your MC strongest trait and look us names by meaning. Good Luck!ReplyDelete
I love Claire for a librarian name (of course, I have a character named Claire in my WIP so maybe I'm biased) but I don't love her last name. Alana Wendell is all right, but sorta boring. Liona Bennette is strong, but I don't feel library curator type girl. What about Claire Bennette? Is it too few syllables? I like the strength of it. I don't know if you're quite there yet. Good luck!ReplyDelete
I like Alana Wendell! Actually, I like that one alot.ReplyDelete
Usually, a name pops into my head and that's it. I try not to overthink it too much or else I get all sorts of confused :)
I like Alana Wendell, too, but honestly when you described her, I could only think of this girl I met last week whose name was Rae. Not shortened for anything.ReplyDelete
But then Rae Melisandre sounds better than Rae Wendell, though the latter's not too bad...
Sorry I'm so all over the place! Good luck!
Well, the first name that popped into my brain was Jane. Then I saw you had narrowed the field, so, um, sorry. However I love Claire -- but I like it paired with last name Bennette.ReplyDelete
Claire Bennette.
Oh, that's funny, I didn't read the other comments until after I commented. D'oh! So, I agree with Laura.ReplyDelete
Hey, forgot to tell you, I gave you an award on my blog.ReplyDelete
I agree with the name Claire. My favorite last name that you had was Bennette, but I don't know if it's the best choice for her last name. Just remember, though, whatever the name is, your readers are going to love it! Good luck!ReplyDelete
I love the character description, but not loving Alana. I agree with you. She could be running a spa. For some reason, Jill came to mind...ReplyDelete
Love your twitter tag line. I'm a terrible knitter, but love it.
Absolutely fantastic blog!!! Glad I found it! Love it!!!ReplyDelete
Lola x